Mixed-Kernels Constructions of Polar Codes

Noam Presman, Ofer Shapira, Simon Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

Mixed kernels of polar codes are mapping functions having inputs of different alphabet sizes that are used to construct polar coding scheme. These schemes are constructed by incorporating several (homogeneous) kernels, each one over different alphabet size. In this paper, the idea of mixed-kernels construction is introduced and analyzed. An asymptotic analysis of the proposed scheme shows that its polarization properties are strongly related to the ones of the constituent kernels. Simulation of finite length instances of the scheme indicate their advantages both in error correction performance and complexity compared to the known polar coding structures.

Original languageEnglish
Article number7339419
Pages (from-to)239-253
Number of pages15
JournalIEEE Journal on Selected Areas in Communications
Volume34
Issue number2
DOIs
StatePublished - 1 Feb 2016

Keywords

  • Polar codes
  • code decomposition
  • successive cancellation

Fingerprint

Dive into the research topics of 'Mixed-Kernels Constructions of Polar Codes'. Together they form a unique fingerprint.

Cite this