2019
DOI: 10.21629/jsee.2019.04.02
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of encoder and decoder for LDPC codes based on FPGA

Abstract: This paper proposes a parallel cyclic shift structure of address decoder to realize a high-throughput encoding and decoding method for irregular-quasi-cyclic low-density parity-check (IR-QC-LDPC) codes, with a dual-diagonal parity structure. A normalized min-sum algorithm (NMSA) is employed for decoding. The whole verification of the encoding and decoding algorithm is simulated with Matlab, and the code rates of 5/6 and 2/3 are selected respectively for the initial bit error ratio as 6% and 1.04%. Based on the… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…Figure 3(b) shows that 62% of the CPU time is spent on memory access (49% for the data read and 13% for the data write), 36% for instructions, and only 2% for memory access out of the cache memory. Te higher percentage of access memory can be justifed by the separated processing of (1) Initialize all m c i ⟶ v j � 0, m v j ⟶ c i � L(0) v j and Itermax (2) for i � 1 to Itermax do Horizontal processing (C2V computation): (3) for each check node c i (4) for each variable node v j connected to c i (5) Calculate min 1 & min 2 (6) end for line 4 (7) for each variable node v j connected to c i (8)…”
Section: Results Of the Profling Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Figure 3(b) shows that 62% of the CPU time is spent on memory access (49% for the data read and 13% for the data write), 36% for instructions, and only 2% for memory access out of the cache memory. Te higher percentage of access memory can be justifed by the separated processing of (1) Initialize all m c i ⟶ v j � 0, m v j ⟶ c i � L(0) v j and Itermax (2) for i � 1 to Itermax do Horizontal processing (C2V computation): (3) for each check node c i (4) for each variable node v j connected to c i (5) Calculate min 1 & min 2 (6) end for line 4 (7) for each variable node v j connected to c i (8)…”
Section: Results Of the Profling Analysismentioning
confidence: 99%
“…Te frst one is hardware based on application-specifc integrated circuits (ASICs) or feld-programmable gate array (FPGA) circuits. Tis approach not only achieves low latency and high throughput [6][7][8][9] but also brings a high development cost. Tis is a limitation for applications requiring fast time-to-market or for technologies with multiple and fast-evolving standards.…”
Section: Introductionmentioning
confidence: 99%
“…Further strategies to enhance LDPC encoding and decoding techniques were proposed in subsequent studies [38][39][40]. One such investigation proposed a high-throughput IR-QC-LDPC encoding and decoding method that utilized a normalized min-sum algorithm (NMSA), achieving a decoding throughput of 27.85 Mbps when implemented on an FPGA.…”
Section: Related Workmentioning
confidence: 99%
“…It developed and tested a prototype 5G mm-wave large multiple input multiple output (MIMO) antenna using standard PCB techniques. It works in the 5G spectrum and is quite selective [12].…”
Section: Introductionmentioning
confidence: 99%