Latency analysis and architecture design of simplified SC polar decoders

Chuan Zhang, Keshab K. Parhi

Research output: Contribution to journalArticlepeer-review

36 Scopus citations


Recently, a low-latency decoding scheme called the simplified successive cancellation (SSC) algorithm has been proposed for polar codes. In this brief, we present the first systematic approach to formally derive the SSC decoding latency for any given polar code. The method to derive the SSC polar decoder architecture for any specific code is also presented. Moreover, the architecture of the precomputation SSC polar decoder is also proposed, which can further reduce the decoding latency. Compared with their SC decoder counterparts, the proposed SSC and precomputation SSC polar decoders can save up to 39.6% decoding latency with the same hardware cost.

Original languageEnglish (US)
Article number6680761
Pages (from-to)115-119
Number of pages5
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Issue number2
StatePublished - Feb 2014


  • Binary tree
  • Data-flow graph (DFG)
  • Polar codes
  • Precomputation
  • Simplified successive cancellation (SSC)


Dive into the research topics of 'Latency analysis and architecture design of simplified SC polar decoders'. Together they form a unique fingerprint.

Cite this