• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.126-130
• /
• 2005

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providingthe V-BLAST schemes with ML performance at low detection complexity.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.2
• /
• pp.71-77
• /
• 2017

This paper proposes a low complexity frequency modulated continuous wave (FMCW) surveillance radar algorithm. In the conventional surveillance radar systems, the two dimensional (2D) fast Fourier transform (FFT) method is usually employed in order to detect the distance and velocity of the targets. However, in a surveillance radar systems, it is more important to immediately detect the presence or absence of the targets, rather than accurately detecting the distance or speed information of the target. In the proposed algorithm, in order to immediately detect the presence or absence of targets, 1D FFT is performed on the first and M-th bit signals among a total of M beat signals and then a phase change between two FFT outputs is observed. The range of target is estimated only when the phase change occurs. By doing so, the proposed algorithm achieves a significantly lower complexity compared to the conventional surveillance scheme using 2D FFT. In addition, show in order to verify the performance of the proposed algorithm, the simulation and the experiment results are performed using 24GHz FMCW radar module.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.254-259
• /
• 2010

In this paper, we propose a low-complexity carrier frequency offset (CFO) estimation algorithm for OFDM based wireless LAN, IEEE 802.11a. The complexity of the arctangent operation to calculate the argument of auto-correlation for CFO estimation is reduced by a novel range pointer method. The proposed algorithm estimates fine CFO value first and then based on the fine CFO value, simple criteria is used for the boundary decision of integer CFO estimation. The simulation results show that the performance of the proposed algorithm is slightly better than the conventional method while the computational complexity is reduced by 50%. Furthermore, the proposed method can be easily implemented for the low complex next generation MIMO-OFDM based WLAN systems.

• ETRI Journal
• /
• v.41 no.3
• /
• pp.308-315
• /
• 2019

Due to its high spectrum efficiency, 64-amplitude phase-shift keying (64-APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite-second generation. However, 64-APSK suffers from considerable computational complexity because of the de-mapping method that it employs. In this study, a low-complexity de-mapping method for (4 + 12 + 20 + 28) 64-APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.20-25
• /
• 2016

This study addresses a low complexity and lossless frame memory compression algorithm based on block-buffer structure for efficient high resolution video processing. Our study utilizes the block-based MHT (modified Hadamard transform) for spatial decorrelation and AGR (adaptive Golomb-Rice) coding as an entropy encoding stage to achieve lossless image compression with low complexity and efficient hardware implementation. The MHT contains only adders and 1-bit shift operators. As a result of AGR not requiring additional memory space and memory access operations, AGR is effective for low complexity development. Comprehensive experiments and computational complexity analysis demonstrate that the proposed algorithm accomplishes superior compression performance relative to existing methods, and can be applied to hardware devices without image quality degradation as well as negligible modification of the existing codec structure. Moreover, the proposed method does not require the memory access operation, and thus it can reduce costs for hardware implementation and can be useful for processing high resolution video over Full HD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8C
• /
• pp.522-528
• /
• 2011

The iterative detection and decoding (IDD) has been shown to dramatically improve the bit error rate (BER) performance of the multiple-input multiple-output (MIMO) communication systems. However, these techniques require a high computational complexity since it is required to compute the soft decisions for each bit. In this paper, we show IDD comprised of sphere decoder with low-density parity check (LDPC) codes and present the tree search strategy, called a layer symbol search (LSS), to obtain soft decisions with a low computational complexity. In addition, an adaptive early termination is proposed to reduce the computational complexity during an iteration between an inner sphere decoder and an outer LDPC decoder. It is shown that the proposed approach can achieve the performance similar to an existing algorithm with 70% lower computational complexity compared to the conventional algorithms.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• 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.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.21-27
• /
• 2013

In this paper, we propose a low-complexity Turbo coded BICM-ID (bit-interleaved coded modulation with iterative decoding) system. A Turbo code is a powerful error correcting code with a BER (bit error rate) performance very close to the Shannon limit. In order to increase spectral efficiency of the Turbo code, a coded modulation combining Turbo code with high order modulation is used. The BER performance of Turbo-BICM can be improved by Turbo-BICM-ID using iterative demodulation and decoding algorithm. However, compared with Turbo-BICM, the decoding complexity of Turbo-BICM-ID is increased by exchanging information between decoder and demodulator. To reduce the decoding complexity of Turbo-BICM-ID, we propose a low-complexity Turbo-BICM-ID system. When compared with conventional Turbo-BICM-ID, the proposed scheme not only show similar BER performance but also reduce the decoding complexity.