Referenced Items are not available for this document.
Shuffled versions of iterative decoding of low-density parity-check codes and turbo codes are presented. The proposed schemes have about the same computational complexity as the standard versions, and converge faster. Simulations show that the new schedules offer better performance/complexity tradeoffs, especially when the maximum number of iterations has to remain small.
Published in:
Communications, IEEE Transactions on
(Volume:53
,
Issue:
2
)
Date of Publication: Feb. 2005
- Page(s):
- 209 - 213
- ISSN :
- 0090-6778
- INSPEC Accession Number:
- 8327431
- Digital Object Identifier :
- 10.1109/TCOMM.2004.841982
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 March 2005
- Issue Date :
- Feb. 2005
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
