Corpus ID: 17499858

Error Detection and Correction: An Introduction

  title={Error Detection and Correction: An Introduction},
  author={Vikas Gupta and C. Verma},
In most communication system whether wired or wireless convolutional encoders are used and AWGN introduces errors during transmission. Various error correcting and controlling mechanisms are present. In this paper all mechanisms are studied and best mechanism on the basis of accuracy, complexity and power consumption is selected. There should be trade off between complexity of hardware and power consumption in decoder. 

Figures, Tables, and Topics from this paper

Cyclic Redundancy Codes: Study and Implementation
This paper introduces a way to authenticate the data transmitted over the network using Cyclic Redundancy Check (CRC) error detection technique which work on the concept of binary division. A network
A Form of List Viterbi Algorithm for Decoding Convolutional Codes
A modified approach, which involves a form of List Viterbi for decoding the convolutional code is investigated, which shows considerable improvement in bit-error performance when compared to classical approach.
Lagrange Interpolating for Error Detection and correction in antijamming attack
Due to vulnerable signals in wireless channels or through jamming of one or multiple channels, Errors affected all transmitted data . Therefore errors detection and correction can be effective
Implementation of Multidirectional Parity Check Cod e Using Hamming Code for Error Detection and Correction
Reliability and efficiency for data transmission pl ay important role in data computer network. As communication system is nondeterministic in its nat ure so reliability of data transmission deals
Low delay error correction codes to correct stuck-at defects and soft errors
This paper tends to correct two single bit errors within the combination of one soft error and one stuck-at defect and to reduce delay of Error Correction Codes.
Design of a Data Error Correction System Based on Associative Memory
A new method is suggested to guarantee 100% accuracy in correct one more bits of the erring messages and the obtained results proved that the proposed method can reach the goal with simple design for the system.
An area efficient Error correction codes to protect against stuck-at defects and soft errors
This paper tends to correct two single bit errors within the combination of one soft error and one stuck-at defect and also minimizing the number of ones in generator matrix and parity check matrix of SEC-DED codes, to reduce the area introduced by error correction codes.
A robust reversible watermarking technique based on prediction error expansion using ECC
The effect of salt and pepper noise on prototypical Prediction error expansion based reversible watermarking and proposed prediction error expansion scheme using encoded border embedding for gray scale medical images are presented.
Measurement-based quantum error correction
Measurement-based (or one-way) quantum error correction (MBQEC) is a method with the capability to detect and correct any errors present in a measurement-based quantum computation (MBQC) setup [1].
Error Detection and Correction on the Credit Card Number using Luhn Algorithm
A chronology of the events leading up to and including the publication of chapter one of The Art of War is described.


A new efficient fangled Viterbi algorithm is proposed in this paper with less complexity and processing time along with 2 bit error correction capabilities.
Fundamental limits on complexity and power consumption in coded communication
—We provide fundamental information-theoretic bounds on the required communication complexity and computation power consumption for encoding and decoding of error-correcting codes in VLSI
A low-power Viterbi decoder design for wireless communications applications
  • S. Ranpara, D. Ha
  • Computer Science
    Twelfth Annual IEEE International ASIC/SOC Conference (Cat. No.99TH8454)
  • 1999
The proposed design reduces the power dissipation of an original Viterbi decoder design by 55% and the schemes employed in the low-power design are clock-gating and toggle filtering.
A Mathematical Theory of Communication
This paper opened the new area the information theory. Before this paper, most people believed that the only way to make the error probability of transmission as small as desired is to reduce the
Green codes: Energy-efficient short-range communication
  • P. Grover, A. Sahai
  • Computer Science, Mathematics
    2008 IEEE International Symposium on Information Theory
  • 2008
It is shown that contrary to the classical intuition, the rate for green codes is bounded away from zero for any given error probability, and as the desired bit-error probability goes to zero, the optimizing rate for the authors' bounds converges to 1.
Towards a Communication-Theoretic Understanding of System-Level Power Consumption
This paper models the required decoding power and investigates the minimization of total system power from two complementary perspectives, using new lower bounds on the complexity of message-passing decoding to show there is a fundamental tradeoff between transmit and decoding power.
Modern Coding Theory
This summary of the state-of-the-art in iterative coding makes this decision more straightforward, with emphasis on the underlying theory, techniques to analyse and design practical iterative codes systems.
Digital communications. 3rd ed
Digital communications is the foundation of modern telecommunications and digital signal processing. The second edition of Digital Communications is updated to include current techniques and systems
An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors
A grouped-parallel low-density parity-check (LDPC) decoder is designed for the (2048,1723) Reed-Solomon-based LDPC (RS- LDPC) suitable for 10GBASE-T Ethernet, and the proposed post-processor is conveniently integrated with the decoder, adding minimal area and power.
Fundamental bounds on the interconnect complexity of decoder implementations
  • P. Grover, A. Sahai
  • Mathematics, Computer Science
    2011 45th Annual Conference on Information Sciences and Systems
  • 2011
This paper derives lower bounds on the wire-length for decoding any code (even if it is nonlinear) and any message-passing decoding algorithm given the performance and the number of clock-cycles at the decoder.