Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Mathematics of cyclic redundancy checks"'
Publikováno v:
2021 Second International Conference on Electronics and Sustainable Communication Systems (ICESC).
Cyclic Redundancy Check (CRC) technique can be widely used in data communication and storage devices in order to detect the sudden errors present in the data. The main motivation of this research was to detect the sudden, random or burst errors prese
Publikováno v:
ISIT
Cyclic redundancy check (CRC) codes combined with convolutional codes yield a powerful concatenated code that can be efficiently decoded using list decoding. To help design such systems, this paper presents an efficient algorithm for identifying the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa4232f247edbe0936a15c412b2b59a5
Publikováno v:
VTC Spring
A method of distributing CRC bits from a single CRC polynomial over a block of information bits for Polar codes via an interleaver to facilitate early termination and enhanced error correction is proposed and investigated. The interleaver is designed
Publikováno v:
Journal of the Chinese Institute of Engineers. 38:770-779
An efficient lookup table algorithm for computing the values of message polynomials during high throughput encoding of Reed–Solomon (RS) codes is presented in this paper. The algorithm can be applied to RS codes encoders, which are based on Vanderm
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811073281
The intent of this paper is to design VLSI architectures for different CRC polynomial equations to achieve high throughput and low latency using DSP algorithms for signal processing. These architectures for CRC polynomials are designed using differen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8db5c98359414027aee6aa775c74410c
https://doi.org/10.1007/978-981-10-7329-8_3
https://doi.org/10.1007/978-981-10-7329-8_3
Publikováno v:
DATE
Current techniques for formally verifying circuits implemented in Galois field (GF) arithmetic are limited to those with a known irreducible polynomial P(x). This paper presents a computer algebra based technique that extracts the irreducible polynom
Cyclic Redundancy Codes (CRCs) are important for maintaining integrity in data transmissions. CRC performance is mainly affected by the polynomial chosen. Recent increases in data throughput require a foray into determining optimal polynomials throug
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5400549a7c6b3a4af92b27097410dbdb
https://zenodo.org/record/4062761
https://zenodo.org/record/4062761
Autor:
Bhu Dev Sharma, Ankita Gaur
Publikováno v:
Journal of applied mathematics & informatics. 32:529-537
Publikováno v:
Applied Mechanics and Materials. 482:390-393
Reed Solomon code is described as a theoretical decoder that corrected errors by finding the most popular message polynomial. The Verilog language is applied to descript decoding algorithm. Cyclone series FPGA EP1C6Q240C8 is adopted as a core of hard
Autor:
Sangeeta Singh
Publikováno v:
IOSR Journal of VLSI and Signal Processing. 2:66-72
Error detection is important whenever there is a non-zero chance of data getting corrupted. A Cyclic Redundancy Check (CRC) is the remainder, or residue, of binary division of a potentially long message, by a CRC polynomial. This technique is ubiquit