Results 201 to 210 of about 174,118 (259)
Some of the next articles are maybe not open access.

Related searches:

Parallel crc realization

IEEE Transactions on Computers, 2003
This paper presents a theoretical result in the context of realizing high-speed hardware for parallel CRC checksums. Starting from the serial implementation widely reported in the literature, we have identified a recursive formula from which our parallel implementation is derived.
G. CAMPOBELLO, G. PATANE', RUSSO, Marco
openaire   +3 more sources

Parallel CRC generation

IEEE Micro, 1990
Theoretical aspects of encoding cyclic redundant codes (CRCs) are reviewed. A method of designing hardware parallel encoders for CRCs that is based on digital system theory and z-transforms is presented. It allows designers to derive the logic equations of the parallel encoder circuit for any generator polynomial.
ALBERTENGO, GUIDO, SISTO, Riccardo
openaire   +2 more sources

The dimensions of the CRC problem

Best Practice & Research Clinical Gastroenterology, 2010
Colorectal cancer is a significant health problem, the importance of which will increase substantially in the coming years, both in more, as well as in less developed regions of the world. The present paper describes the dimensions of the problem from an epidemiologic viewpoint as well as from the perspective of policy makers and professionals seeking ...
L V, Karsa   +4 more
openaire   +2 more sources

Fast CRCs

IEEE Transactions on Computers, 2009
CRCs have desirable properties for effective error detection. But their software implementation, which relies on many steps of the polynomial division, is typically slower than other codes such as weaker checksums. A relevant question is whether there are some particular CRCs that have fast implementation.
openaire   +1 more source

A tutorial on CRC computations

IEEE Micro, 1988
The theory of cyclic redundancy codes (CRS) is reviewed. Four software algorithms for performing CRC computations are described: table lookup, reduced table lookup, on-the-fly, and wordwise. They are compared in terms of their speeds and storage requirements. >
Tenkasi V. Ramabadran, Sunil S. Gaitonde
openaire   +1 more source

Fast CRC calculation

Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93, 2002
The integrity of messages in data communications is always ensured by the addition, at the end of the message, of a frame check sequence (FCS) traveling with the message itself so it can be checked at far end for proper transmission. A cyclic redundancy code (CRC) is employed to generate FCS at one end and check the entire received message (data plus ...
René J. Glaise, X. Jacquart
openaire   +1 more source

A note on the modified CRC

ACM SIGCOMM Computer Communication Review, 1990
The theory underlying the modification of the CRC which is used in protocols such as HDLC and ADCCP is sketched, and a possible pitfall in the implementation is described.
openaire   +1 more source

Home - About - Disclaimer - Privacy