University of SaskatchewaneCommons
  • Browse
    • All of eCommons
    • Communities & Collections
    • By Issue Date
    • Authors
    • Titles
    • Subjects
    • This Collection
    • By Issue Date
    • Authors
    • Titles
    • Subjects
  • My Account
    • Login
    • Register
        • Login
        View Item 
        • eCommons Home
        • College of Graduate and Postdoctoral Studies
        • Electronic Theses and Dissertations
        • View Item
        • eCommons Home
        • College of Graduate and Postdoctoral Studies
        • Electronic Theses and Dissertations
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Bandwidth-efficient communication systems based on finite-length low density parity check codes

        Thumbnail
        View/Open
        HuyVu_Thesis.pdf (1.536Mb)
        Date
        2006-10-17
        Author
        Vu, Huy Gia
        Type
        Thesis
        Degree Level
        Doctoral
        Abstract
        Low density parity check (LDPC) codes are linear block codes constructed by pseudo-random parity check matrices. These codes are powerful in terms of error performance and, especially, have low decoding complexity. While infinite-length LDPC codes approach the capacity of communication channels, finite-length LDPC codes also perform well, and simultaneously meet the delay requirement of many communication applications such as voice and backbone transmissions. Therefore, finite-length LDPC codes are attractive to employ in low-latency communication systems. This thesis mainly focuses on the bandwidth-efficient communication systems using finite-length LDPC codes. Such bandwidth-efficient systems are realized by mapping a group of LDPC coded bits to a symbol of a high-order signal constellation. Depending on the systems' infrastructure and knowledge of the channel state information (CSI), the signal constellations in different coded modulation systems can be two-dimensional multilevel/multiphase constellations or multi-dimensional space-time constellations. In the first part of the thesis, two basic bandwidth-efficient coded modulation systems, namely LDPC coded modulation and multilevel LDPC coded modulation, are investigated for both additive white Gaussian noise (AWGN) and frequency-flat Rayleigh fading channels. The bounds on the bit error rate (BER) performance are derived for these systems based on the maximum likelihood (ML) criterion. The derivation of these bounds relies on the union bounding and combinatoric techniques. In particular, for the LDPC coded modulation, the ML bound is computed from the Hamming distance spectrum of the LDPC code and the Euclidian distance profile of the two-dimensional constellation. For the multilevel LDPC coded modulation, the bound of each decoding stage is obtained for a generalized multilevel coded modulation, where more than one coded bit is considered for level. For both systems, the bounds are confirmed by the simulation results of ML decoding and/or the performance of the ordered-statistic decoding (OSD) and the sum-product decoding. It is demonstrated that these bounds can be efficiently used to evaluate the error performance and select appropriate parameters (such as the code rate, constellation and mapping) for the two communication systems.The second part of the thesis studies bandwidth-efficient LDPC coded systems that employ multiple transmit and multiple receive antennas, i.e., multiple-input multiple-output (MIMO) systems. Two scenarios of CSI availability considered are: (i) the CSI is unknown at both the transmitter and the receiver; (ii) the CSI is known at both the transmitter and the receiver. For the first scenario, LDPC coded unitary space-time modulation systems are most suitable and the ML performance bound is derived for these non-coherent systems. To derive the bound, the summation of chordal distances is obtained and used instead of the Euclidean distances. For the second case of CSI, adaptive LDPC coded MIMO modulation systems are studied, where three adaptive schemes with antenna beamforming and/or antenna selection are investigated and compared in terms of the bandwidth efficiency. For uncoded discrete-rate adaptive modulation, the computation of the bandwidth efficiency shows that the scheme with antenna selection at the transmitter and antenna combining at the receiver performs the best when the number of antennas is small. For adaptive LDPC coded MIMO modulation systems, an achievable threshold of the bandwidth efficiency is also computed from the ML bound of LDPC coded modulation derived in the first part.
        Degree
        Doctor of Philosophy (Ph.D.)
        Department
        Electrical Engineering
        Program
        Electrical Engineering
        Supervisor
        Nguyen, Ha H.; Dodds, David E.
        Committee
        Salt, J. Eric; Krzymien, Witold A.; Ko, Seok-Bum; Shwedyk, Edward
        Copyright Date
        October 2006
        URI
        http://hdl.handle.net/10388/etd-10302006-234840
        Subject
        bounding techniques
        communication theory
        error control coding.
        Collections
        • Electronic Theses and Dissertations
        • College of Graduate Studies & Research
        • University Library
        University of Saskatchewan

        © University of Saskatchewan
        Contact Us | Disclaimer | Privacy