| 摘要 |
PROBLEM TO BE SOLVED: To transmit information at a transmission rate close to communication path capacity of a general communication path having noise, to make error probability in decoding into a value close to "0" without limit, and to perform coding and decoding in real time. SOLUTION: Among candidates of code words in which a product with a first sparse matrix becomes a zero matrix, and a product with a second sparse matrix becomes information, the one whose input probability distribution becomes largest is selected by optimization algorithm, and the selected candidate is generated as a code word of the information to information for transmission. Furthermore, among candidates of a code word in which the product with the first sparse matrix becomes the zero matrix, when itself is input in the communication path, the one in which probability that the output code word calculated by using input probability distribution and conditional probability distribution is output, becomes largest by the optimization algorithm, and the product between the selected candidate and the second sparse matrix is generated as a decode word of the output code word. COPYRIGHT: (C)2009,JPO&INPIT
|
