• Title/Summary/Keyword: 저 복잡도

Search Result 634, Processing Time 0.028 seconds

Low Complexity ML Detection Based on Linear Detectors in MIMO Systems (MIMO시스템에서 저 복잡도 선형 ML검출 기법)

  • Niyizamwiyitira, Christine;Kang, Chul-Gyu;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2405-2411
    • /
    • 2009
  • MMSE, ZF and ML are the decoding mechanisms for V-BLAST system, and ML shows the best performance decoding the original signal among them. However, it has a problem that the computation complexity is increased exponentially according to the number of transmit antennas and transmit degrees. In this paper, we propose a low complexity linear ML detection algorithm having low computation complexity, then analyze the system performance in BER and computation complexity comparing with other algorithms. In the simulation, the BER performance of the proposed algorithm is superior than ZF and MMSE detection algorithms, and similar to ML detection algorithm. However, its computation complexity was 50% less than ML algorithm. From the results, we confirm that the proposed algorithm is superior than other ML detection algorithms.

A Receiver Architecture with Low Complexity for Chirp Spread Spectrum in IEEE 802.15.4a (IEEE 802.15.4a Chirp SpreadSpectrum을 위한 저복잡도 수신기 구조)

  • Kim, Yeong-Sam;Chong, Jong-Wha
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.8
    • /
    • pp.24-31
    • /
    • 2010
  • A receiver architecture with low complexity for chirp spread spectrum (CSS) of IEEE 802.15.4a is proposed. To demodulate the received signal at the highest signal to noise power ratio, matched filter is generally adopted for the receiver of wireless communication systems. It is, however, not resonable to adjust the matched filter to the receiver of CSS whose objectives are low complexity, low cost and low power consumption since complexity of the matched filter is high. In this paper, we propose a new receiver architecture using differential multiplication and accumulator not matched filter for demodulation. Also, bi-orthogonal decoder implemented by only adder/subtractor is proposed. The hardware resources for implementation are reduced in the proposed receiver architecture, although bit error rate performance is low compared with the receiver architecture based on the matched filter.

Pattern-based Depth Map Generation for Low-complexity 2D-to-3D Video Conversion (저복잡도 2D-to-3D 비디오 변환을 위한 패턴기반의 깊이 생성 알고리즘)

  • Han, Chan-Hee;Kang, Hyun-Soo;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.2
    • /
    • pp.31-39
    • /
    • 2015
  • 2D-to-3D video conversion vests 3D effects in a 2D video by generating stereoscopic views using depth cues inherent in the 2D video. This technology would be a good solution to resolve the problem of 3D content shortage during the transition period to the full ripe 3D video era. In this paper, a low-complexity depth generation method for 2D-to-3D video conversion is presented. For temporal consistency in global depth, a pattern-based depth generation method is newly introduced. A low-complexity refinement algorithm for local depth is also provided to improve 3D perception in object regions. Experimental results show that the proposed method outperforms conventional methods in terms of complexity and subjective quality.

New Low-Power and Small-Area Reed-Solomon Decoder (새로운 저전력 및 저면적 리드-솔로몬 복호기)

  • Baek, Jae-Hyun;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.96-103
    • /
    • 2008
  • This paper proposes a new low-power and small-area Reed-Solomon decoder. The proposed Reed-Solomon decoder using a novel simplified form of the modified Euclid's algorithm can support low-hardware complexity and low-Power consumption for Reed-Solomon decoding. The simplified modified Euclid's algorithm uses new initial conditions and polynomial computations to reduce hardware complexity, and thus, the implemented architecture consisting of 3r basic cells has the lowest hardware complexity compared with existing modified Euclid's and Berlekamp-Massey architectures. The Reed-Solomon decoder has been synthesized using the $0.18{\mu}m$ Samsung standard cell library and operates at 370MHz and its data rate supports up to 2.9Gbps. For the (255, 239, 8) RS code, the gate counts of the simplified modified Euclid's architecture and the whole decoder excluding FIFO memory are only 20,166 and 40,136, respectively. Therefore, the proposed decoder can reduce the total gate count at least 5% compared with the conventional DCME decoder.

Energy Consumption of Low Complexity Bluetooth Mesh Networks Study (저복잡도 블루투스 메쉬 네트워크의 에너지 소모 연구)

  • Woo Hyun Kim;Seung-Kyu Choi;Illsoo Sohn
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.156-157
    • /
    • 2023
  • 사물인터넷은 무선 통신 기술의 발달로 스마트 시티, 스마트 홈, 스마트 농장, 스마트 건물, 스마트 공장과 같은 다양한 분야에서 주목을 받고 있다. 특히 무선 통신 기술 중 하나인 블루투스 메쉬는 비동기 동적 스캐닝을 이용하여 저전력 통신을 제공하기 때문에 사물인터넷 분야에서 주목을 받고 있다. 본 논문은 네트워크의 신뢰성을 유지하면서 적은 계산 복잡도로 에너지 효율을 높이는 방법을 제안한다. 이를 통해 대부분의 저전력 무선네트워크 환경에서 효과적인 에너지 최적화를 실현한다.

A Parallel Sphere Decoder Algorithm for High-order MIMO System (고차 MIMO 시스템을 위한 저 복잡도 병렬 구형 검출 알고리즘)

  • Koo, Jihun;Kim, Jaehoon;Kim, Yongsuk;Kim, Jaeseok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.11-19
    • /
    • 2014
  • In this paper, a low complexity parallel sphere decoder algorithm is proposed for high-order MIMO system. It reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by static tree-pruning and dynamic tree-pruning using scalable node operators, and offers near-maximum likelihood decoding performance. Moreover, it also offers hardware-friendly node operation algorithm through fixing the variable computational complexity caused by the sequential nature of the conventional SD algorithm. A Monte Carlo simulation shows our proposed algorithm decreases the average number of expanded nodes by 55% with only 6.3% increase of the normalized decoding time compared to a full parallelized FSD algorithm for high-order MIMO communication system with 16 QAM modulation.

A Low-complexity Mixed QR Decomposition Architecture for MIMO Detector (MIMO 검출기에 적용 가능한 저 복잡도 복합 QR 분해 구조)

  • Shin, Dongyeob;Kim, Chulwoo;Park, Jongsun
    • Journal of IKEEE
    • /
    • v.18 no.1
    • /
    • pp.165-171
    • /
    • 2014
  • This paper presents a low complexity QR decomposition (QRD) architecture for MIMO detector. In the proposed approach, various CORDIC-based QRD algorithms are efficiently combined together to reduce the computational complexity of the QRD hardware. Based on the computational complexity analysis on various QRD algorithms, a low complexity approach is selected at each stage of QRD process. The proposed QRD architecture can be applied to any arbitrary dimension of channel matrix, and the complexity reduction grows with the increasing matrix dimension. Our QR decomposition hardware was implemented using Samsung $0.13{\mu}m$ technology. The numerical results show that the proposed architecture achieves 47% increase in the QAR (QRD Rate/Gate count) with 28.1% power savings over the conventional Householder CORDIC-based architecture for the $4{\times}4$ matrix decomposition.

New Video Compression Method based on Low-complexity Interpolation Filter-bank (저 복잡도 보간 필터 뱅크 기반의 새로운 비디오 압축 방법)

  • Nam, Jung-Hak;Jo, Hyun-Ho;Sim, Dong-Gyu;Choi, Byeong-Doo;Cho, Dae-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.5
    • /
    • pp.165-174
    • /
    • 2010
  • The H.264/AVC standard obtained better performance than previous compression standards, but it also increased the computational complexity of CODEC simultaneously. Various techniques recently included at the KTA software developed by VCEG also were increasing its complexity. Especially adaptive interpolation filter has more complexity than two times due to development for coding efficiency. In this paper, we propose low-complexity filter bank to improve speed up of decoding and coding gain. We consists of filter bank of a fixed-simple filter for low-complexity and adaptive interpolation filter for high coding efficiency. Then we compensated using optimal filter at each macroblock-level or frame-level. Experimental results shows a similar coding efficiency compared to existing adaptive interpolation filter and decoding speed of approximately 12% of the entire decoder gained.

Channel Estimation and Analog Beam Selection for Uplink Multiuser Hybrid Beamforming System (상향링크 다중사용자 하이브리드 빔포밍 시스템에서 채널 추정과 아날로그 빔 선택 방법)

  • Kim, Myeong-Jin;Ko, Young-Chai
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.3
    • /
    • pp.459-468
    • /
    • 2015
  • In this paper, we consider an uplink multiuser hybrid beamforming system where an access point (AP) communicates with multiple users simultaneously. The performance of the uplink multiuser hybrid beamforming system depends on the effective channel which is given by the product of the channel matrix and the analog beams. Therefore, to maximize the performance, we need to obtain the channel information and then select the analog beams appropriately by using the acquired channel information. In this paper, we propose the channel estimation method and low complexity analog beam selection algorithm for the uplink multiuser hybrid beamforming system. Additionally, our analysis shows that the proposed low complexity analog beam selection algorithm provides much less complexity than the optimum analog beam selection algorithm. From the numerical results, we confirm that the proposed low complexity analog beam selection algorithm has little performance degradation in spite of much less complexity than the optimum analog beam selection algorithm under the equal system configuration.

Distributed Multi-Hop Multicast Transmission Scheme for Low-Power and Low-Complexity Wireless Devices (저 전력 저 복잡도 무선 기기를 위한 분산적인 다중 홉 멀티 캐스트 중계 기법)

  • Ko, Byung Hoon;Jeon, Ki-Jun;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.5
    • /
    • pp.931-937
    • /
    • 2015
  • Distributed relay scheme for wireless ad hoc multi-hop multicast network composed of low-power and low-complexity wireless devices with high density is proposed. The proposed relay scheme is shown to be better than flooding, which is the distributed relay scheme applied to ZigBee, in the outage probability and the multicast transmission rate by simulations.