Research and Markets, the largest resource for market research information in world providing essential market research reports, industry research, industry analysis, forecasts, market studies, company profiles and country reports.
Welcome - Register - Login - Help/FAQ - 0 items View Basket
Worlds Largest Market Research Resource - 1516374 Live Reports
Search Research and Markets
  Search
Enter keywords, a title or
a report id number below.





Advanced   
Company search
Register for free email updates of market research
Currency
  Select a currency for use throughout the site



Viewing report

Order by Fax
Ask a Question
Printer Friendly
PDF Brochure
Hard CopyAdd to Basket
Live Chat Live Help Software for Website

Enhancements to Low Density Parity Check Codes. Edition No. 1

VDM Publishing House, Jan 2010, Pages: 88


  Description  
   Authors   
    
    
    
     
  Enquire before Buying   
  Send to a Friend   

LDPC Codes are considered to be serious competitors to turbo codes in terms of performance and complexity. They are specified by a sparse parity check matrix containing mostly 0s and relatively few 1s. In this book, LDPC codes used in the IEEE 802.16 standard physical layer were studied. Two novel techniques to enhance the performance of such codes are introduced. In the first technique, a novel parity check matrix for LDPC codes over GF(4) is proposed based on the binary parity check matrix used in the IEEE 802.16 standard . The proposed code has proven to outperform the binary code used in the IEEE 802.16 standard over both AWGN and SUI-3 channel model. In the second technique, high rate LDPC code is used, in a concatenated coding structure, as an outer code, with a convolutional code as an inner code. The performance of such a concatenated codes is compared with the commonly used one utilizing Reed-Solomon codes over the standard SUI-3 channel model, and show better performance.



For enquiries please call us on:
  +353-1-415-1241 (GMT Office Hours)
  1-917-300-0470 (EST Office Hours)

   All rights reserved. © Copyright 2012 Research and Markets
   Terms and conditions Privacy Policy Publishers Employment Opportunities Site Map Link to us Webmaster Affiliate Network


Research and Markets RSS Feeds