Generalised low-density parity-check codes with binary cyclic codes as component codes

Access Full Text

Generalised low-density parity-check codes with binary cyclic codes as component codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Irregular low-density parity-check (LDPC) codes outperform turbo codes for the block length 104 and above. This study introduces generalised LDPC (GLDPC) codes with binary cyclic codes as component codes whose performance is better than that of irregular LDPC codes. The codes are found by optimising degree distributions. The authors also present some simulation results, which show that the codes surpass the irregular LDPC codes.

Inspec keywords: cyclic codes; binary codes; parity check codes

Other keywords: component code; turbo code; codes surpass; binary cyclic code; generalised low-density parity-check code; degree distribution; GLDPC code

Subjects: Codes

References

    1. 1)
      • N. Mladinovic , M.P.C. Fossorier . (2005) Generalized LDPC codes with reed-solomon and BCH codes as component codes for binary channels.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • IEEE 802.16e: ‘Air interface for fixed and mobile broadband wireless access systems’. IEEE P802.16e/D12 Draft, 2005.
    6. 6)
    7. 7)
      • J. Pearl . (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2011.0816
Loading

Related content

content/journals/10.1049/iet-com.2011.0816
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading