http://iet.metastore.ingenta.com
1887

Low complexity list successive cancellation decoding of polar codes

Low complexity list successive cancellation decoding of polar codes

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

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.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 authors propose a low complexity list successive cancellation (LCLSC) decoding algorithm, where the advantages of the successive cancellation (SC) decoding and the list successive cancellation (LSC) decoding are both considered. In the proposed decoding, SC decoding instead of LSC decoding is implemented when all information bits from bad subchannels are received reliably. While the reliability of each information bit is estimated by its likelihood ratio (LR), the bit channel quality is measured via its Bhattacharyya parameter. To achieve this goal, the authors introduce two thresholds: LR threshold and Bhattacharyya parameter threshold. Also, the methods to determine them are both elaborated. The numerical results suggest that the complexity of LCLSC decoding is much lower than LSC decoding and can be close to that of SC decoding, while the error performance is almost equal to that of LSC decoding. Especially, when the code rate is in low region, the advantage of our decoding is more obvious.

References

    1. 1)
    2. 2)
      • 2. Arikan, E.: ‘Source polarization’. IEEE Int. Symp. Information Theory (ISIT), Austin, TX, June 2010, pp. 899903.
    3. 3)
      • 3. Korada, S.B.: ‘Polar codes for channel and source coding’. Ph.D. dissertation, EPFL, 2009.
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • 7. Goela, N., Korada, S.B., Gastpar, M.: ‘On LP decoding of polar codes’. IEEE Information Theory Workshop (ITW), Dublin, Ireland, 2010, pp. 15.
    8. 8)
      • 8. Tal, I., Vardy, A.: ‘List decoding of polar codes’. IEEE Int. Symp. Information Theory (ISIT), Saint Petersburg, Russia, 2011, pp. 15.
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 12. Zhang, Y., Zhang, Q., Pan, X., Ye, Z., Gong, C.: ‘A simplified belief propagation decoder for polar codes’. Proc. IWS 2014, March 2014, pp. 14.
    13. 13)
      • 13. Fan, Y., Tsui, C.: ‘An efficient partial-sum network architecture for semi-parallel polar codes decoder implementation’, IEEE Trans. Signal Process., accepted for publication.
    14. 14)
      • 14. Zhang, Y., Liu, A., Pan, X., Ye, Z., Gong, C.: ‘A modified belief propagation polar decoder’, IEEE Commun. Lett., accepted for publication.
    15. 15)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2014.0227
Loading

Related content

content/journals/10.1049/iet-com.2014.0227
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address