• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.637-640
• /
• 2012

The Davey-MacKay construction is a promising concatenated coding scheme involving an outer $2^k$-ary code and an inner code of rate k/n, for insertion-deletion-substitution channels. Recently, a lookup table (LUT)-based inner decoder for this coding scheme was proposed to reduce the computational complexity of the inner decoder, albeit at the expense of a slight degradation in word error rate (WER) performance. In this letter, we show that negligible deterioration in WER performance can be achieved with an LUT as small as $7{\cdot}2^{k+n-1}$, but no smaller, when the probability of receiving less than n-1 or greater than n+1 bits corresponding to one outer code symbol is at least an order of magnitude smaller than the WER when no LUT is used.

• Journal of information and communication convergence engineering
• /
• v.4 no.1
• /
• pp.5-9
• /
• 2006

In this paper, a low-complexity ML decoder based on QR decomposition, called LCMLDec decoder, is proposed for the V-BLAST with 2 transmit antennas. Then, it is combined with other suboptimal interference nulling and cancelling decoders originated form QR decomposition such as sorted QR or MMSE-SQRD decoder to generate efficient decoders that significantly improve the performance of the V-BLAST with more than 2 transmit antennas, at the expense of a small increase in complexity. Simulation results are provided to demonstrate the performances and complexities of the proposed decoders.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.110-116
• /
• 2005

In this paper, a low-complexity ML decoder based on QR decomposition, called LCMLDec decoder, is proposed for the V-BLAST with 2 transmit antennas. Then, it is combined with other suboptimal interference nulling and cancelling decoders originated form QR decomposition such as sorted QR or MMSE-SQRD decoder to generate efficient decoders that significantly improve the performance of the V_BLAST with more than 2 transmit antennas, at the expense of a small increase in complexity. Simulation results are provided to demonstrate the performances and complexities of the proposed decoders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.79-89
• /
• 2010

Recently, distributed video coding (DVC) has been actively studied for low complexity video encoder. The complexity of the encoder in DVC is much simpler than that of traditional video coding schemes such as H.264/AVC, but the complexity of the decoder in DVC increases. In this paper, we propose the Region-Of-Interest (ROI) based DVC with low decoding complexity. The proposed scheme uses the ROI, the region the motion of objects is quickly moving as the input of the Wyner-Ziv (WZ) encoder instead of the whole WZ frame. In this case, the complexity of encoder and decoder is reduced, and the bite rate decreases. Experimental results show that the proposed scheme obtain 0.95 dB as the maximum PSNR gain in Hall Monitor sequence and 1.87 dB in Salesman sequence. Moreover, the complexity of encoder and decoder in the proposed scheme is significantly reduced by 73.7% and 63.3% over the traditional DVC scheme, respectively. In addition, we employ the layered belief propagation (LBP) algorithm whose decoding convergence speed is 1.73 times faster than belief propagation algorithm as the Low-Density Parity-Check (LDPC) decoder for low decoding complexity.

• Journal of information and communication convergence engineering
• /
• v.4 no.4
• /
• pp.136-140
• /
• 2006

In this paper, we consider the detection of orthogonal space-time block codes (OSTBCs) without channel state information (CSI) at the receiver. Based on the conventional blind cyclic decoder, we propose an enhanced blind cyclic decoder which has higher system performance than the conventional one. Furthermore, the proposed decoder offers low complexity since it does not require the computation of singular value decomposition.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.157-160
• /
• 2000

In order to design a low complexity and high performance SOVA decoder for Turbo Codes, we need to analyze the decoding performance with respect to several important design parameters and find out optimal values for them. Thus, we use a scaling factor of soft output and a update depth as the parameters and analyze their effect on the BER performance of the SOVA decoder. finally, we shows the optimal values of them for maximum decoding performance of SOVA decoder for 3GPP complied Turbo codes.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.865-868
• /
• 2001

TCM offers considerable coding gains without compromising bandwidth or signal power. But TCM decoder is more complex than convolutional Viterbi decoder. Because, the number of branches exponentially increased by the constraint length and input symbol bits. The parallelism of ACS and memory management technique of SPMM is one of the important factor for speed-up and hardware complexity. This paper proposes a multi-processing technique of ACS and also gives a memory management technique of SPMM in TCM decoders.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2525-2532
• /
• 2009

In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.