Paper Info
Title
A Modified Rejection-Based Architecture To Find The First Two Minima In Min-Sum-Based Ldpc Decoders
Abstract
One of the essential elements of min-sum lowdensity parity-check (LDPC) decoders is to find the first two minima between the binary messages arriving in the check nodes along with the index of the minimum which are altogether used to compute the messages for sending back to the neighboring variable nodes. The main techniques for this task are tree-based and bit-serial architectures. The latest tree-based architecture, known as rejection-based scheme finds the first two minima and the binary index of the minimum with higher speed than the previous tree-based methods. However, in min-sum LDPC decoders, having one-hot sequence of the minimum of the messages is preferred as it has implementation benefits. In this paper, we modify the existing rejection-based technique to yield the one-hot sequence instead of the binary representation of the minimum index. The proposed modification doesn't cause any latency in the operation of the module. We also provide the results of the implementation of the modified rejection-based technique and the bit-serial architecture, conducted on a Xilinx Virtex-7 FPGA. The two major architectures are compared in terms of latency, maximum clock frequency, area and power.
Year
DOI
Venue
2020
10.1109/WCNC45663.2020.9120630
2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)
DocType
ISSN
Citations 
Conference
1525-3511
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Alireza Hasani102.70
Lukasz Lopacinski275.77
Steffen Büchner321.83
Jörg Nolte42910.00
Rolf Kraemer510625.01