Please use this identifier to cite or link to this item:
|Title:||Iterative soft QRD-M decoding of coded IFDMA systems|
|Source:||Png, K.-B.,Peng, X.,Chin, F.,Ko, C.C. (2010). Iterative soft QRD-M decoding of coded IFDMA systems. IEEE Wireless Communications and Networking Conference, WCNC : -. ScholarBank@NUS Repository. https://doi.org/10.1109/WCNC.2010.5506327|
|Abstract:||We introduce an iterative decoding algorithm for the decoding of coded interleaved frequency division multiple access (IFDMA) system in this paper. The iterative decoding algorithm incorporates a low complexity a posterior probability (APP) detector based on breadth-first tree search algorithm with a soft-input soft-out (SISO) error-correcting codes (ECC) decoder. The proposed detector combines the principles of the M-algorithm with QR decomposition (QRD-M) to generate soft decision statistics in place of the conventional APP detector which has a high computational cost. We show through simulations that the purposed iterative decoding algorithm is able to achieve significant performance gain using only very small number of iterations. Furthermore, the simulated bit error rate (BER) performance of a system using the proposed algorithm not only exhibits similar diversity order as the hypothetical matched filter bound but also approaches it at high signal-to-noise ratio (SNR). ©2010 IEEE.|
|Source Title:||IEEE Wireless Communications and Networking Conference, WCNC|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.