XOR-Free Approach for Implementation of Polar Encoder

This letter presents a new algorithmic approach to construct an XOR-Free architecture for a nonsystematic polar encoder (NSPE). Optimization of XOR units is the main concern while implementing NSPE, which consumes a significant amount of dynamic power. To generate polar sequences of code length N, the approach uses <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(N/2)-1$ </tex-math></inline-formula> binary patterns extracted from the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(N/2)^{\mathrm { th}}$ </tex-math></inline-formula> order generator matrix <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G_{N/2}$ </tex-math></inline-formula> instead of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G_{N}$ </tex-math></inline-formula>. The algorithm reduces the logical operations by virtue of the recursive patterns, thereby improving hardware (HW) cost. The pattern logics are inferred with 2:1 multiplexers and inverters, making the implementation XOR-Free. An auto HDL code generation script is written targeting variable code lengths (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2{^{{3}}} \leq {N} \leq 2{^{{10}}}$ </tex-math></inline-formula>) for direct comparison with similar approaches, viz. stage folded and punctured NSPE design. The results show that the proposed architecture improves area by 31%–83% and power consumption by 15%–57% for various N and code rates (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R{=}1$ </tex-math></inline-formula>, 1/2) on Virtex-6 FPGA devices.

Authors

Institutions

Publication Details

Journal
IEEE Embedded Systems Letters
Published
2024-11-11
DOI
https://doi.org/10.1109/les.2024.3495657
Citations
2
Primary Topic
Sensor Technology and Measurement Systems
Type
article
Field-Weighted Citation Impact
0.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

XOR-Free Approach for Implementation of Polar Encoder

Deepak Kedia, Gaurav Purohit, Navin Kumar
2 citations
IEEE Embedded Systems Letters
Sensor Technology and Measurement Systems
0.70
article

XOR-Free Approach for Implementation of Polar Encoder

Deepak Kedia, Gaurav Purohit, Navin Kumar
article en
2 citations

Abstract

This letter presents a new algorithmic approach to construct an XOR-Free architecture for a nonsystematic polar encoder (NSPE). Optimization of XOR units is the main concern while implementing NSPE, which consumes a significant amount of dynamic power. To generate polar sequences of code length N, the approach uses <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(N/2)-1$ </tex-math></inline-formula> binary patterns extracted from the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(N/2)^{\mathrm { th}}$ </tex-math></inline-formula> order generator matrix <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G_{N/2}$ </tex-math></inline-formula> instead of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G_{N}$ </tex-math></inline-formula>. The algorithm reduces the logical operations by virtue of the recursive patterns, thereby improving hardware (HW) cost. The pattern logics are inferred with 2:1 multiplexers and inverters, making the implementation XOR-Free. An auto HDL code generation script is written targeting variable code lengths (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2{^{{3}}} \leq {N} \leq 2{^{{10}}}$ </tex-math></inline-formula>) for direct comparison with similar approaches, viz. stage folded and punctured NSPE design. The results show that the proposed architecture improves area by 31%–83% and power consumption by 15%–57% for various N and code rates (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$R{=}1$ </tex-math></inline-formula>, 1/2) on Virtex-6 FPGA devices.

IEEE Embedded Systems LettersVol. 17(3)
Guru Jambheshwar University of Science and Technology (IN), Chaudhary Charan Singh Haryana Agricultural University (IN), Central Electronics Engineering Research Institute (IN)
Openalex Percentile: Top 27%
Sensor Technology and Measurement Systems
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.