Low-Latency Burst Error Detection and Correction in Decision-Feedback Equalization

Dey, Shovon; Aurangozeb,; Hossain, Masum

doi:10.1109/ojcas.2020.3039256

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 7 uses the hamming code parity for horizontal bits and modulo-2 addition for vertical bits which reduces the complexity of adder. As per the hamming parity scheme, for each horizontal representation of matrix 32-bits require 6-bits of parity bits to obtain hamming code as: (11,12,13,14,15,16,17,18,19,20,21,22,23,24,25), and − H(5) = xor (26,27,28,29,30,31). So, a total of 12 horizontal bits and 32 vertical bits are required for parity i.e., 44 parity bits for 64-bits of data.…”

Section: Optimal Error Detection and Correction Codesmentioning

confidence: 99%

Low overhead optimal parity codes

Neelima

Subhas

2022

TELKOMNIKA

View full text Add to dashboard Cite

The error detecting and correcting codes are used in critical applications like in intensive care units, defense applications, and require highly reliable data. This brief focuses on codes to detect and correct adjacent errors within a single clock cycle by using modulo-2 addition of data bits for parity generation, syndrome calculation, error location identification and correction by improving code rate and minimizing bit overhead. The optimal parity codes devised can correct odd number of adjacent errors upto (N/2)-1 data bits when compared with the existing codes with less delay. Four optimal codes are proposed using existing decimal matrix codes properties. The proposed codes prove better in terms of area, delay, power, bit overhead, code rate, code efficiency, and with good reliability. The components are developed in veriloghardware description language and verified for zynq 7000 series field programmable gate array in xilinx integrated synthesis environment 14.5 Tool. Among the codes devised, optimal code-4 proves to be a better code with 65.3% code rate and 53.12% bit overhead. Also when compared with other codes, it uses 33.3% less area and 1.89% less power delay product for encoder and 32.2% less area and 0.36% power delay product for decoder respectively.

show abstract