2018
DOI: 10.1109/access.2018.2815640
|View full text |Cite
|
Sign up to set email alerts
|

Area-Optimized Fully-Flexible BCH Decoder for Multiple GF Dimensions

Abstract: Recently, there are increasing demands for fully flexible Bose-Chaudhuri-Hocquenghem (BCH) decoders, which can support different dimensions of Galois fields (GF) operations. As the previous BCH decoders are mainly targeting the fixed GF operations, the conventional techniques are no longer suitable for multiple GF dimensions. For the area-optimized flexible BCH decoders, in this paper, we present several optimization schemes for reducing hardware costs of multi-dimensional GF operations. In the proposed optimi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 23 publications
0
12
0
Order By: Relevance
“…As a result, the proposed (106,920, 95,040) block-level interleaved-BCH ECC can recover the burst errors of up to 1080 bits during transmitting a data frame of 106,920 bits. Without applying the block-level interleaving scheme, one can use a long BCH code for correcting total 1080 error bits in a user data of 95,040 bits; however, such a long BCH code requires an impractical amount of hardware complexity due to the increased dimension of finite field [30,31]. It is also possible to apply the RS code as a component code for providing the symbol-level correction [32,33]; however, the RS code only focuses on the burst-error channel condition.…”
Section: Baseband Processing With Block-level Interleaved-bch Codesmentioning
confidence: 99%
“…As a result, the proposed (106,920, 95,040) block-level interleaved-BCH ECC can recover the burst errors of up to 1080 bits during transmitting a data frame of 106,920 bits. Without applying the block-level interleaving scheme, one can use a long BCH code for correcting total 1080 error bits in a user data of 95,040 bits; however, such a long BCH code requires an impractical amount of hardware complexity due to the increased dimension of finite field [30,31]. It is also possible to apply the RS code as a component code for providing the symbol-level correction [32,33]; however, the RS code only focuses on the burst-error channel condition.…”
Section: Baseband Processing With Block-level Interleaved-bch Codesmentioning
confidence: 99%
“…In noisy channels, using error correction code (ECC) is considered an important for digital communication systems to achieve the reliability of the transmission information [22]. In practical applications, Bose-Chaudhuri-Hocquenghem (BCH) is usually adopted to achieve data reliability among the several ECCs because of its acceptable hardware cost and strong error correcting performance [23]. Furthermore, BCH code outperforms both of turbo and convolutional codes with LTE system in terms of BER performance and lower complexity [17].…”
Section: Introductionmentioning
confidence: 99%
“…The syndrome generator is the first step of the BCH decoding process [6,20]. The syndromes Si of the received vector r(x) are given as:Si=r(αi)…”
Section: Introductionmentioning
confidence: 99%
“…Second, the solution should be able to scale across different bit errors t . Different configurable BCH decoder solutions have been proposed [20,24], but they lack support for both configurable parameters of the BCH decoders. Inspired by the attempt to solve BCH decoders for multiple GF dimensions in [20], we propose an alternate hybrid approach to have a flexible solution.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation