Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/2167
Title: | PERFORMANCE EVALUATION OF HYBRID ARQ USING LDPC CODES |
Authors: | Madanmohan, Kochar Inderkumar |
Keywords: | LDPC CODES;WIRELESS COMMUNICATION;AWGN;ELECTRONICS AND COMPUTER ENGINEERING |
Issue Date: | 2010 |
Abstract: | Packet-oriented data transmission is gaining more and more importance in wireless communication systems. Typically, data transmission is not strictly delay-sensitive but requires a virtually error-free link. In order to provide such level of reliability over wireless channels, Automatic Repeat Request (ARQ) schemes can be combined with suitable Forward Error Correction (FEC) schemes, resulting in a Hybrid ARQ system. When fading varies slowly over the duration of a codeword, coding takes care of the channel noise while retransmissions take care of bad channel conditions. A desired level of performance can only be achieved if the FEC code is chosen properly. The LDPC code is one of the preferred choices for error correction in a Hybrid ARQ system, since it has the virtue of approaching the Shannon's limit. This dissertation examines the throughput achievable by both Type-I and Type-II HARQ schemes using LDPC codes over Additive White Gaussian Noise (AWGN) and flat Rayleigh fading channel with both the Go-Back N and the ideal Selective Repeat protocol. The results suggest that regular finite-length LDPC codes are very attractive for wireless communications based on HARQ schemes, as they outperform schemes based on other channel codes, including the capacity achieving Turbo codes. |
URI: | http://hdl.handle.net/123456789/2167 |
Other Identifiers: | M.Tech |
Research Supervisor/ Guide: | Chakravorty, S. |
metadata.dc.type: | M.Tech Dessertation |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECDG20098.pdf | 6.52 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.