Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
New Computational Complexity Reducing IDD Scheme Designed with Optimum Parameters
- Authors
- Cho, Jehoon; Kim, Minsung; Jeong, Sinsung; Park, Jungho; Oh, Taewon
- Issue Date
- 7월-2013
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Computational complexity; Dynamic List Sphere Detector (D-LSD); Extrinsic Information Transfer (EXIT) chart; Iterative Detection and Decoding (IDD) receiver; Multiple-Input Multiple-Output (MIMO); Quality of Service (QoS); target Bit Error Rate (BER)
- Citation
- IEEE COMMUNICATIONS LETTERS, v.17, no.7, pp.1313 - 1316
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE COMMUNICATIONS LETTERS
- Volume
- 17
- Number
- 7
- Start Page
- 1313
- End Page
- 1316
- ISSN
- 1089-7798
- Abstract
- An Iterative Detection and Decoding (IDD) scheme in a high-order Multiple-Input Multiple-Output (MIMO) wireless communication system requires a heavy computational complexity for an outstanding Bit Error Rate (BER) performance in a given Signal-to-Noise Ratio (SNR) environment. A new computational complexity reducing IDD scheme designed with optimum parameters is proposed in this paper to guarantee Quality of Service (QoS) without the loss of BER performance. There are three parameters to control the trade-off between computational complexity and BER performance of an IDD scheme: a candidate list size of Dynamic List Sphere Detector (D-LSD), a number of intra-iteration of Turbo decoder, and a number of IDD iteration. A complexity reduction of about 70 % is demonstrated in this study, when the target BER is around 1.0 x 10((-4)) at E-b/N-0 = 7dB in the case of a 4 x 4 MIMO system with 16-ary Quadrature Amplitude Modulation (QAM).
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.