Preview

Reed-Solomon Code Research Paper

Powerful Essays
Open Document
Open Document
2727 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Reed-Solomon Code Research Paper
VLSI IMPLEMENTATION OF INTERPOLATION PROCESSOR FOR SOFT-DECISION REED-SOLOMON DECODING

ABSTRACT

Error detection and correction plays a very important role in data communication. Various codes such as convolutional and block codes are available for the purpose of error detection and correction. Among the block codes Reed-Solomon code provides several advantages. Reed-Solomon codes are powerful error-correcting codes that finds wide applications in many fields. The soft-decision decoding of Reed-Solomon codes provides reliable information from the channel into the decoding process. Many soft-decision decoding algorithms are available. Among them the Koetter-Vardy algorithm is used in this paper. The gain of soft-decision …show more content…
An important function of any modern digital communications system is error control coding. Such coding in the field of communication deals with techniques for detecting and correcting errors in a signal. Though used in a variety of systems, error control coding is especially useful in wireless communication system. Such systems typically operate with a low signal-to-noise ratio (SNR) and suffer from distortion because of a multipath channel. The harsh wireless environment means that the received signal is prone to …show more content…
Reed-Solomon code

Reed-Solomon are block-based error correcting codes that can be found in many digital communication standards. It finds a wide range of applications in many areas such as storage devices, wireless or mobile communications, satellite communications, digital television, high speed modems.

Fig.1. A typical communication system

The Reed-Solomon encoder takes a block of digital data and adds extra “redundant” bits. Errors occur during transmission or storage for a number of reasons such as noise or interference, scratches on a CD. The Reed-Solomon decoder processes each block and attempts to correct errors and recover the data. The number and type of errors that can be corrected depends on the characteristics of the Reed-Solomon code.

2.1.Properties of Reed-Solomon codes

The Reed-Solomon code is specified as RS(n,k) with s-bit symbols. This means that the encoder takes k data symbols of s bits each and adds parity symbols to make an n symbol codeword. There are n-k parity symbols of s bits each. A Reed-Solomon decoder can correct up to t symbols that contain errors in a codeword, where 2t=n-k[16]. Fig.2. A typical Reed-Solomon code
Continue Reading
View Writing Issues

You May Also Find These Documents Helpful

  • Powerful Essays

    Nt1310 Unit 1 Exercise 1
    • 5033 Words
    • 21 Pages

    Nt1310 Unit 1 Exercise 1

    Objective: To enable the receiver of a message transmitted through noisy channel to check whether the message has been corrupted. The aim of an error detection technique is to enable the receiver of a message transmitted through noisy channel to determine whether the message has been corrupted. To do this, the transmitter constructs a value called a checksum that is the function of message and appends it’s to message. The receiver can then use the same function to calculate the checksum of the received message and compare it with the appended checksum to see if the message was correctly received.…

    • 5033 Words
    • 21 Pages
    Powerful Essays
    Read More
  • Good Essays

    Nt1310 Unit 5 Application Of Mo System
    • 674 Words
    • 3 Pages

    Nt1310 Unit 5 Application Of Mo System

    The matrix elements are complex numbers that correspond to the attenuation and phase shift that the wireless communication channel introduces to the signal reaching the receiver with delay τ.…

    • 674 Words
    • 3 Pages
    Good Essays
    Read More
  • Powerful Essays

    Unit 422: Computer Architecture
    • 1721 Words
    • 7 Pages

    Unit 422: Computer Architecture

    2: Redundant via Hamming code; an error-correcting code is calculated across corresponding bits on each data disk, and the bits of the code are stored in the corresponding bit positions on multiple parity disks. 3: Bit-interleaved parity; similar to level 2 but instead of an error-correcting code, a simple parity bit is computed for the set of individual bits in the same position on all of the data disks. 4: Block-interleaved parity; a bit-by-bit parity strip is calculated across corresponding strips on each data disk, and the parity bits are stored in the corresponding strip on the parity disk. 5: Block-interleaved distributed parity; similar to level 4 but distributes the parity strips across all disks. 6: Block interleaved dual distributed parity; two different parity calculations are carried out and stored in separate blocks on different…

    • 1721 Words
    • 7 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Unit 8 Data Communication Research Paper
    • 3587 Words
    • 15 Pages

    Unit 8 Data Communication Research Paper

    Add a section 2 to your guide (entitled ‘Error detection and correction’) which explains the techniques that can be used to reduce data transmission…

    • 3587 Words
    • 15 Pages
    Powerful Essays
    Read More
  • Satisfactory Essays

    Midterm Test
    • 562 Words
    • 3 Pages

    Midterm Test

    Department of Electrical and Computer Engineering ELE635 - Communication Systems - Spring 2012 Midterm Test…

    • 562 Words
    • 3 Pages
    Satisfactory Essays
    Read More
  • Good Essays

    Coding Theory Case Study
    • 1093 Words
    • 3 Pages

    Coding Theory Case Study

    The first two aspects, error detecting and error correcting can be studied together. When a digital message is transmitted, it is done so by a sequence of 0’s and 1’s which encodes a given message. These messages have the potential of being corrupted by noise. Once a message is written an error-detecting code can be written into the message so that any errors can be detected and corrected before the message reaches its final destination. One of the most common types of error- detecting code is called a parity check. A parity check is “the process that ensure accurate data transmission between nodes during communication. A parity bit is appende to the original data bits to create an even or odd bit number; the number of bits with one value. The source then transmits this data via a link, and bits are checked and verified at the destination. Data is considered accurate if the number of bits (even or odd) matches the number transmitted from the source.” (Janseen, 2014) An example could be the message 1101. We add a 0 or 1 to the end of…

    • 1093 Words
    • 3 Pages
    Good Essays
    Read More
  • Powerful Essays

    Civil Confinement for Sex Offenders Research Papers
    • 2465 Words
    • 10 Pages

    Civil Confinement for Sex Offenders Research Papers

    Hansen, R., Harris, A., Phenix, A., Thornton, D. (2003). STATIC 99 Coding Rules – Revised 2003. Retrieved June 18, 2009 from http://ww2.ps-sp.gc.ca/publications/corrections/pdf/Static-99-coding-Rules_e.pdf…

    • 2465 Words
    • 10 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Digital and Analog Comparison
    • 1657 Words
    • 7 Pages

    Digital and Analog Comparison

    Technology is constantly changing in communications. The analog signal was used for several years and was limited in number and did not have the ability to handle the amount of data interchange used today, because of the size requirements. Analog signals are still used today, but are more complex and are in most circumstances converted to a digital signal. This paper will compare the different types of analog and digital technology we used and are currently using today.…

    • 1657 Words
    • 7 Pages
    Powerful Essays
    Read More
  • Good Essays

    The Power of God
    • 25712 Words
    • 103 Pages

    The Power of God

    © 2007 Copyright Hewlett-Packard Development Company, L.P. Edition 1, 2/2007 Reproduction, adaptation or translation without prior written permission is prohibited, except as allowed under the copyright laws. The information contained herein is subject to change without notice. The only warranties for HP products and services are set forth in the express warranty statements accompanying such products and services. Nothing herein should be construed as constituting an additional warranty. HP shall not be liable for technical or editorial errors or omissions contained herein. Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD4 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD4 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any part of this documentation and/or software.…

    • 25712 Words
    • 103 Pages
    Good Essays
    Read More
  • Good Essays

    Generic Data Compression Techniques
    • 536 Words
    • 3 Pages

    Generic Data Compression Techniques

    Data compression schemes fall into two categories. Some are lossless, others are lossy. Lossless schemes are those that do not lose information in the compression process. Lossy schemes are those that may lead to the loss of information. Lossy techniques provide more compression than lossless ones and are therefore popular in settings in which minor errors can be tolerated, as in the case of images and audio. In cases where the data being compressed consist of long sequences of the same value, the compression technique called run-length encoding, which is a lossless method, is popular. It is the process of replacing sequences of identical data elements with a code indicating the element that is repeated and the number of times it occurs in the sequence. For example, less space is required to indicate that a bit pattern consists of 253 ones, followed by 118 zeros, followed by 87 ones than to actually list all 458 bits. Another lossless data compression technique is frequency-dependent encoding; a system in which the length of the bit pattern used to represent a data item is inversely related to the frequency of the item’s use. Such codes are examples of variable-length codes, meaning that items are represented by patterns of different lengths as opposed to codes such as Unicode, in which all symbols are represented by 16 bits. David Huffman is credited with discovering an algorithm that is commonly used for developing frequency-dependent codes, and it is common practice to refer to codes developed in this manner as Huffman codes. In turn, most frequency-dependent codes in use today are Huffman codes.…

    • 536 Words
    • 3 Pages
    Good Essays
    Read More
  • Powerful Essays

    Data Link Layer
    • 2855 Words
    • 12 Pages

    Data Link Layer

    Briefly explain how parity is used to find the location of single-bit errors in the forward error correction method?…

    • 2855 Words
    • 12 Pages
    Powerful Essays
    Read More
  • Good Essays

    Reed-Solomon Codes: Irving Reed And Gus Solomon
    • 982 Words
    • 4 Pages

    Reed-Solomon Codes: Irving Reed And Gus Solomon

    The general idea is the construction of a polynomial, the coefficient produced will be symbols such that the generator polynomial will exactly divide the data/parity polynomial. The basic principle of encoding is to find the remainder for the message divided by a generator polynomial G(x).The Reed-Solomon codeword is generated using a special polynomial known as the Generator polynomial. All valid code words are exactly divisible by the generator polynomial. The generator polynomial of the RS encoder is represented…

    • 982 Words
    • 4 Pages
    Good Essays
    Read More
  • Powerful Essays

    Digital Counter for Car Parking System
    • 3471 Words
    • 14 Pages

    Digital Counter for Car Parking System

    Bibliography: 1. Floyd, Thomas L. , 2006, Digital Fundamentals: Ninth Edition, New Jersey, USA, Pearson Prentice Hall…

    • 3471 Words
    • 14 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Convolution codes and viterbi algorithm
    • 1848 Words
    • 7 Pages

    Convolution codes and viterbi algorithm

    Convolutional codes have memory that uses previous bits to encode or decode following bits It is denoted by (n, k, L), where L is code memory depth. Code rate r is determined by input rate TO output rate . Convolutional codes are used extensively in numerous applications in order to achieve reliable data transfer, including digital video, radio, mobile communication, and satellite communication. These codes are often implemented in concatenation with a hard-decision code, particularly Reed Solomon. Prior to turbo codes, such constructions were the most efficient, coming closest to the Shannon limit.…

    • 1848 Words
    • 7 Pages
    Powerful Essays
    Read More
  • Powerful Essays

    Internet Technology
    • 4775 Words
    • 20 Pages

    Internet Technology

    INSY402 S.A.Idowu email:saidowuclass@yahoo.co.in 1 Lesson1,2 and 3  Internet   Network Edge Network Core  Core Network Switching Schemes   Circuit Switching Packet Switching (pipelining)  Network Delay     Nodal Processing Delay Queuing Delay Transmission Delay Propagation Delay 2 OSI 7-Layer Model In the 70's, computer networks were ad hoc, vendor-specific Open Systems Interconnection model     developed by the ISO (International Organization for Standardization) in 1984 provides an abstract model of networking divides the tasks involved in moving information between networked computers into 7 task groups each task group is assigned a layer Each layer is reasonably self-contained, so   can be implemented independently changes/updates to a layer need not effect other layers 3 Protocol Layers • • • • • • • Application layer – describes how applications will communicate e.g., HTTP, FTP, Telnet, SMTP…

    • 4775 Words
    • 20 Pages
    Powerful Essays
    Read More

Related Topics