Hamming iteration and interpretation method based on sum and product algorithm

An iterative decoding, Hamming code technology, applied in the direction of error correction/detection using linear codes, error correction/detection using block codes, data representation error detection/correction, etc., which can solve decoding complexity and performance tradeoffs, etc. question
CN1558557AInactive Publication Date: 2004-12-29ηŽ‹η³
0 Cites 7 Cited by

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Applications(China)
Current Assignee / Owner
ηŽ‹η³
Publication Date
2004-12-29
Estimated Expiration
Not applicable Β· inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention relates to the field of communication system technology, in particular a Hamming code iterated interpretation method based on sum of products algorism, which can be applied to bluetooth systems, computer memory systems, mobile memory systems and DVD system, wherein iterated code translation based on sum of products algorism is introduced into Hamming code to solve the problem of code interpreting complexity and performance.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention belongs to the technical field of communication systems, and in particular relates to a Hamming code iterative decoding method based on a sum-product algorithm, which is applied to a bluetooth system, a computer storage system, a mobile storage system, a DVD system, and the like. Background technique

[0002] In 1948, Shannon first proposed the famous channel coding theory in his groundbreaking paper "Mathematical Principles of Communication": For any communication channel with a channel capacity of C, if the transmission rate R required by the communication system is less than C, then there is A coding method, when the code length n is sufficiently large and maximum likelihood decoding is applied, the error rate of the system can be arbitrarily small. He applied three basic conditions in the theorem:

[0003] 1) Use random coding;

[0004] 2) The code length nβ†’βˆž, that is, the code length tends to be infinite;

[0005] 3) Decoding adop...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More