Irregular repeat quaternary-accumulate (IRqA) codes and two-dimensional BCJR decoding

Access Full Text

Irregular repeat quaternary-accumulate (IRqA) codes and two-dimensional BCJR decoding

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.

The study introduces novel codes called irregular repeat quaternary-accumulate (IRqA) codes whose performance is better than that of the standard irregular repeat accumulate (IRA) codes for the medium-to-short block lengths. The codes are a serial concatenation of an irregular repeat code and a quaternary-accumulate (qA) code. The decoding is performed iteratively by exchanging extrinsic information. The decoding of qA codes is executed using two-dimensional BCJR (Bahl, Cocke, Jelinek and Raviv) decoding. Our codes are found by optimising irregular repetition factors, based on EXIT charts. We also present some simulation results, which show that IRqA codes surpass IRA codes with the comparable encoding and decoding complexities.

Inspec keywords: codes; encoding; decoding

Other keywords: encoding complexities; irregular repeat quaternary-accumulate codes; medium-to-short block lengths; decoding complexities; two-dimensional BCJR decoding; irregular repeat accumulate codes; EXIT charts

Subjects: Codes

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • Crozier, S.: `New high-spread high-distance interleavers for turbo-codes', 20thBiennial Symp. on Communications, May 2000, Kingston, Ontario, Canada, p. 3–7.
    9. 9)
    10. 10)
    11. 11)
      • Divsalar, D., Dolinar, S., Thorpe, J.: `Accumulate-repeat-accumulate-accumulate-codes', Proc. 60th IEEE Veh. Technol. Conf., September 2004, Los Angeles, CA, 4, p. 2292–2296.
    12. 12)
    13. 13)
      • R.G. Gallager . (1963) Low density parity check codes.
    14. 14)
    15. 15)
      • Jin, H., Khandekar, A., McEliece, R.J.: `Irregular repeat-accumulate codes', Proc. 2nd Int. Symp. Turbo Codes and Related Topics, September 2000, Brest, France, p. 1–8.
    16. 16)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2011.0894
Loading

Related content

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