Results 231 to 240 of about 37,717 (290)
An Integrated Cyber-Physical Digital Twin Architecture with Quantitative Feedback Theory Robust Control for NIS2-Aligned Industrial Robotics. [PDF]
Sensors (Basel)Karlova-Sergieva V +2 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Low-Complexity Parallel Cyclic Redundancy Check
2021 IEEE International Symposium on Circuits and Systems (ISCAS), 2021Cyclic redundancy check (CRC) is adopted in many digital communication and storage systems to ensure data integrity. CRC en/decoding is carried out using linear feedback shift registers (LFSRs) and a parallel LFSR can be implemented by registers with a feedback matrix multiplication and an input pre-processing matrix multiplication. A large parallelism
Xinmiao Zhang, Yok Jye Tang
openaire +1 more source
Cyclic redundancy checking by program
Proceedings of the May 16-18, 1972, spring joint computer conference on - AFIPS '72 (Spring), 1971Recent advances in the use of mini-computers as control elements of a computer complex and as intelligent terminals are indicative of a trend toward relocation of certain hardware functions to micro-program or machine level program. One such function which is a particularly good candidate, for various reasons, has already been moved into program in ...
P. E. Boudreau, R. F. Steen
openaire +1 more source
Interleaved cyclic redundancy check (CRC) code
The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2004In this paper, we investigate interleaved cyclic redundancy check (CRC) code. The interleaved CRC can be obtained by merging independent small message blocks into one large block (merged interleaving) or by dividing the original message block into independent small sub blocks (divided interleaving) and then by alternatively dividing the resulting ...
null Jun Jin Kong, K.K. Parhi
openaire +1 more source
Implementation of Cyclic Redundancy Check in Data Recovery
2021 Second International Conference on Electronics and Sustainable Communication Systems (ICESC), 2021Cyclic 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 present in the transmission channels. This technique was very simple and easy to implement.
Nandivada Sridevi +2 more
openaire +1 more source
Partitioned and parallel cyclic redundancy checking
Proceedings of 36th Midwest Symposium on Circuits and Systems, 2002In this paper, the linear feedback shift register (LFSR) is redesigned to process several bits of a long data stream simultaneously in order to obtain a signature more quickly. The resulting structure is capable of encoding, decoding, detecting, and correcting errors in cyclic codes partitioned into variable length words; hence, it is given the name ...
A. Sobski, A. Albicki
openaire +1 more source
A self-timed cyclic redundancy check (CRC) in VLSI
Proceedings of 40th Midwest Symposium on Circuits and Systems. Dedicated to the Memory of Professor Mac Van Valkenburg, 1999A self-timed approach to implement a cyclic redundancy check (CRC) for the application of telecommunications is described. The approach is oriented toward multiple channel communications. The paper presents a new scheme to handle an asynchronous feedback to implement the CRC engine.
S.Henry Li, Charles A. Zukowski
openaire +1 more source
Cyclic redundancy checks in Ada95
ACM SIGAda Ada Letters, 1997Among the many error detection techniques used in (tele)communications, the Cyclic Redundancy Check (CRC) is probably the most powerful one. Roughly speaking the CRC is merely a modulo-2 division of the data (bits) to be transmitted by some 'magical' polynomial known for its high error detection capabilities.
openaire +1 more source
On the cyclic redundancy-check codes with 8-bit redundancy
Computer Communications, 1998Polynomials of degree eight over GF(2) which are suitable to be used as generator polynomials for cyclic redundancy-check (CRC) codes are investigated. Their minimum distance, properness and undetected error probability for binary symmetric channels (BSCs) are compared with the existing ATM standard.
Tsonka Baicheva +2 more
openaire +1 more source
Finding cyclic redundancy check polynomials for multilevel systems
IEEE Transactions on Communications, 1998Summary: This letter describes a technique for finding cyclic redundancy check polynomials for systems for transmission over symmetric channels that encode information in multiple voltage levels so that the resulting redundancy check gives good error protection and is efficient to implement. The codes that we construct have a Hamming distance of 3 or 4.
Davis, James A. +2 more
openaire +2 more sources