Publication:
Performance of iterative detection and decoding for MIMO-BICM systems

dc.contributor.author Yang, Tao en_US
dc.date.accessioned 2022-03-21T12:17:52Z
dc.date.available 2022-03-21T12:17:52Z
dc.date.issued 2006 en_US
dc.description.abstract Multiple-input multiple-output (MIMO) wireless technology is an emerging cost-effective approach to offer multiple-fold capacity improvement relative to the conventional single-antenna systems. To achieve the capacities of MIMO channels, MIMO bit-interleaved-coded-modulation (BICM) systems with iterative detection and decoding (IDD) are studied in this thesis. The research for this dissertation is conducted based on the iterative receivers with convolutional codes and turbo codes. A variety of MIMO detectors, such as a maximum a posteriori probability (MAP) detector, a list sphere detector (LSD) and a parallel interference canceller (PIC) together with a decision statistic combiner (DSC), are studied. The performance of these iterative receivers is investigated via bounding techniques or Monte-Carlos simulations. Moreover, the computational complexities of the components are quantified and compared. The convergence behaviors of the iterative receivers are analyzed via variance transfer (VTR) functions and variance exchange graphs (VEGs). The analysis of convergence behavior facilitates the finding of components with good matching. For a fast fading channel, we show that the &quotwaterfall region&quot of an iterative receiver can be predicted by VEG. For a slow fading channel, it is shown that the performance of an iterative receiver is essentially limited by the early interception ratio (ECR) which is obtained via simulations. After the transfer properties of the detectors are unveiled, a detection switching (DSW) methodology is proposed and the switching criterion based on cross entropy (CE) is derived. By employing DSW, the performance of an iterative receiver with a list sphere detector (LSD) of a small list size is considerably improved. It is shown that the iterative receiver achieves a performance very close to that with a maximum a posteriori probability (MAP) detector but with a significantly reduced complexity. For an iterative receiver with more than two components, various iteration schedules are explored. The schedules are applied in an iterative receiver with PIC-DSC. It is shown that the iterative receiver with a periodic scheduling outperforms that with the conventional scheduling at the same level of complexity. en_US
dc.identifier.uri http://hdl.handle.net/1959.4/26197
dc.language English
dc.language.iso EN en_US
dc.publisher UNSW, Sydney en_US
dc.rights CC BY-NC-ND 3.0 en_US
dc.rights.uri https://creativecommons.org/licenses/by-nc-nd/3.0/au/ en_US
dc.subject.other MIMO systems en_US
dc.subject.other Signal processing en_US
dc.subject.other Iterative methods (Mathematics) en_US
dc.subject.other Coding theory en_US
dc.title Performance of iterative detection and decoding for MIMO-BICM systems en_US
dc.type Thesis en_US
dcterms.accessRights open access
dcterms.rightsHolder Yang, Tao
dspace.entity.type Publication en_US
unsw.accessRights.uri https://purl.org/coar/access_right/c_abf2
unsw.identifier.doi https://doi.org/10.26190/unsworks/16075
unsw.relation.faculty Engineering
unsw.relation.originalPublicationAffiliation Yang, Tao, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW en_US
unsw.relation.school School of Electrical Engineering and Telecommunications *
unsw.thesis.degreetype Masters Thesis en_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
whole.pdf
Size:
847.38 KB
Format:
application/pdf
Description:
Resource type