Partial sums generation architecture for successive cancellation decoding of polar codes

Abstract : Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes partial sums computations. We take advantage of the recursive structure of polar codes to introduce an efficient partial sums computation unit that can also implements the encoder. The proposed architecture is synthesized for several code-lengths in 65nm ASIC technology. The area of the resulting design is reduced up to 26% and the maximum working frequency is improved by 25%.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00955730
Contributor : Christophe Jego <>
Submitted on : Wednesday, March 5, 2014 - 6:19:38 PM
Last modification on : Thursday, September 12, 2019 - 8:38:07 AM
Long-term archiving on : Thursday, June 5, 2014 - 11:01:11 AM

File

SiPS_version_finale.pdf
Files produced by the author(s)

Identifiers

Citation

Guillaume Berhault, Camille Leroux, Christophe Jego, Dominique Dallet. Partial sums generation architecture for successive cancellation decoding of polar codes. Signal Processing Systems (SiPS), 2013 IEEE Workshop on, Oct 2013, Taipei, Taiwan. pp.407-412, ⟨10.1109/SiPS.2013.6674541⟩. ⟨hal-00955730⟩

Share

Metrics

Record views

324

Files downloads

670