Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

ROBUST ITERATIVEPRUNED-TREE DETECTION ANDLDPCC DECODING

Message

Note: This site will be unavailable for a couple hours for scheduled maintenance starting at 3:00 pm EST (UTC-5:00) on Friday, Jan. 28, 2022.

Hu, Xinde (2004) ROBUST ITERATIVEPRUNED-TREE DETECTION ANDLDPCC DECODING. Master's Thesis, University of Pittsburgh. (Unpublished)

[img]
Preview
PDF
Primary Text

Download (698kB) | Preview

Abstract

A novel sub-optimal low-complexity equalization and turbo-iterative decoding scheme based on running the sum-product algorithm on an aggressively pruned tree is proposed in this paper for use in a multiple transmit and receive antenna (MIMO) system operating over severe frequency-selective fading inter-symbol interference (ISI) channels. The receiver deals with the issue of signal processing complexity which with a full-search equalization grows with power-law. The sum-product algorithm is applied to the pruned tree which is constructed by two main operations, a sphere list detection and a threshold-based tree search algorithms. At a particular node of the tree, only a number of most probable branches in the tree of hypothetical symbols are expanded and included in the list of candidates; at a particular tree-section, all but some of most probable candidatesare pruned. This pruned tree takes the soft input and generates the soft output, and is utilized in the turbo-iterative manner with the decoder of the low-density parity check code. We oobtained the approximated error probability using the pair-wise error calculation averaged over the fading ensemble, and use it to boundour simulation results. Our current simulation results are obtained for MIMO systems up to four transmit and four receive antennas, using 4-QAM symbols. They indicate the proposed receiverperforms extremely well. The proposed transceiver system is ideal for a system of higher spectral efficiency with even larger signal constellations. Adopting Hassbi-Vikalo's framework, we provide a method which enables a quick evaluation of the signal processing complexity required in the proposed algorithm at a given set of system parameters.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: University of Pittsburgh ETD
Status: Unpublished
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Hu, Xindexih1@pitt.eduXIH1
ETD Committee:
TitleMemberEmail AddressPitt UsernameORCID
Committee ChairLee, Heung-nohnlee@ee.pitt.edu
Committee MemberChaparro, Luis Fchaparro@ee.pitt.eduLFCH
Committee MemberMcCloud, Michaelmmccloud@engr.pitt.edu
Date: 9 June 2004
Date Type: Completion
Defense Date: 9 April 2004
Approval Date: 9 June 2004
Submission Date: 12 April 2004
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Institution: University of Pittsburgh
Schools and Programs: Swanson School of Engineering > Electrical Engineering
Degree: MSEE - Master of Science in Electrical Engineering
Thesis Type: Master's Thesis
Refereed: Yes
Uncontrolled Keywords: joint decoding and equalization; LDPC codes; MAP; MIMO; reduced complexity; turbo-iteration; wireless communication
Other ID: http://etd.library.pitt.edu/ETD/available/etd-04122004-201506/, etd-04122004-201506
Date Deposited: 10 Nov 2011 19:35
Last Modified: 15 Nov 2016 13:39
URI: http://d-scholarship.pitt.edu/id/eprint/7027

Metrics

Monthly Views for the past 3 years

Plum Analytics


Actions (login required)

View Item View Item