38 citations · 109 across the 18 of their papers we have counts for
24 papers
Unrolled and Pipelined Decoders based on Look-Up Tables for Polar Codes
Pascal Giard, Syed Aizaz Ali Shah, Alexios Balatsoukas-Stimming +2
Unrolling a decoding algorithm allows to achieve extremely high throughput at the cost of increased area. Look-up tables (LUTs) can be used to replace functions otherwise implement…
Implementation-Efficient Finite Alphabet Decoding of Polar Codes
Philipp Mohr, Syed Aizaz Ali Shah, Gerhard Bauch
An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet dec…
Low-Resolution Horizontal and Vertical Layered Mutual Information Maximizing LDPC Decoding
Philipp Mohr, Gerhard Bauch
We investigate iterative low-resolution message-passing algorithms for quasi-cyclic LDPC codes with horizontal and vertical layered schedules. Coarse quantization and layered sched…
A Variable Node Design with Check Node Aware Quantization Leveraging 2-Bit LDPC Decoding
Philipp Mohr, Gerhard Bauch
For improving coarsely quantized decoding of LDPC codes, we propose a check node aware design of the variable node update. In contrast to previous works, we optimize the variable n…
Uniform vs. Non-Uniform Coarse Quantization in Mutual Information Maximizing LDPC Decoding
Philipp Mohr, Gerhard Bauch
Recently, low-resolution LDPC decoders have been introduced that perform mutual information maximizing signal processing. However, the optimal quantization in variable and check no…
Reconstruction-Computation-Quantization (RCQ): A Paradigm for Low Bit Width LDPC Decoding
Linfang Wang, Caleb Terrill, Maximilian Stark +7
This paper uses the reconstruction-computation-quantization (RCQ) paradigm to decode low-density parity-check (LDPC) codes. RCQ facilitates dynamic non-uniform quantization to achi…