1992
DOI: 10.1109/26.141415
|View full text |Cite
|
Sign up to set email alerts
|

High-speed parallel CRC circuits in VLSI

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
68
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 147 publications
(68 citation statements)
references
References 2 publications
0
68
0
Order By: Relevance
“…This unfolding technique can be used to implement higher order parallelism which gives more speedup. But this technique has a drawback of higher fan-out as we increase the order of parallelism [10]. A more efficient technique called state-space transformation can be used to implement parallel CRC circuits [11].…”
Section: Crc Computation Techniquesmentioning
confidence: 99%
“…This unfolding technique can be used to implement higher order parallelism which gives more speedup. But this technique has a drawback of higher fan-out as we increase the order of parallelism [10]. A more efficient technique called state-space transformation can be used to implement parallel CRC circuits [11].…”
Section: Crc Computation Techniquesmentioning
confidence: 99%
“…Step by step, the register state value D 8 can be described as, In table 1, ⊕ is EXOR operation. Therefore, a parallel circuit structures are achieved for (2, 1, 5) convolutional encodes.…”
Section: Parallel Convulutional Encodesmentioning
confidence: 99%
“…Furthermore, the characters of more high speed computing and much less low power dissipation are needed for convolutional codes. Although many papers focus on parallel cyclic redundancy check (CRC) algorithm [8], these are not completely adapted to the convolutional encodes. So in this paper, we pay attentions to implementation of parallel convolutional encodes, which is proved to be a available method to approach more high speed computing and much less low power dissipation.…”
Section: Introductionmentioning
confidence: 99%
“…The parallel CRC algorithm in [1] processes an m -bit message in (m+k)/L clock cycles, where k is the order of the generator polynomial and L is the level of parallelism. However, in [2], m message bits can be processed in m/L clock cycles. High speed architectures for parallel long encoders are based on the multiplication and division computations on generator polynomial are efficient in terms of speeding up the parallel linear feedback shift register (LFSR) structures.…”
Section: Introductionmentioning
confidence: 99%