Please use this identifier to cite or link to this item: https://doi.org/10.1109/TVT.2007.912163
Title: Bypass decoding: A reduced-complexity decoding technique for LDPC-coded MIMO-OFDM systems
Authors: Xin, Y. 
Mujtaba, S.A.
Zhang, T.
Jiang, J. 
Keywords: Broadband wireless communications
Low-density parity-check (LDPC) codes
Multiple-input-multiple-output (MIMO)
Orthogonal frequency-division multiplexing (OFDM)
Sum-product algorithm
Issue Date: Jul-2008
Citation: Xin, Y., Mujtaba, S.A., Zhang, T., Jiang, J. (2008-07). Bypass decoding: A reduced-complexity decoding technique for LDPC-coded MIMO-OFDM systems. IEEE Transactions on Vehicular Technology 57 (4) : 2319-2333. ScholarBank@NUS Repository. https://doi.org/10.1109/TVT.2007.912163
Abstract: In this paper, we propose a simple reduced-complexity decoding technique called bypass decoding for low-density parity-check (LDPC)-coded multiple-input-multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems. Employing the bypass decoding technique, the receiver of an LDPC-coded MIMO-OFDM system decodes a codeword in two steps based on the log-likelihood ratios (LLRs) of coded bits. The hard decisions are first made on the coded bits whose LLRs have magnitudes above a certain threshold, and the rest of the coded bits will next be decoded by using an iterative receiver. We show that, as long as the threshold is properly selected, the bypass decoding technique not only delivers considerable complexity reductions but also maintains a comparable performance in LDPC-coded MIMO-OFDM transmissions. We also provide a selection rule for choosing a suitable threshold and show its effectiveness by simulations. © 2008 IEEE.
Source Title: IEEE Transactions on Vehicular Technology
URI: http://scholarbank.nus.edu.sg/handle/10635/55244
ISSN: 00189545
DOI: 10.1109/TVT.2007.912163
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.