Decoding device, decoding method, receiving device, and storage medium reproducing device
View Patent ↗A decoding device for a linear code on a ring R, the decoding device including: a plurality of storage media; and a processing section; wherein the processing section uses a part of reliability of all symbols at a previous time to update reliability of each symbol in a process of iterative decoding for increasing the reliability of each symbol, and further retains a part used to update retained reliability information and a part unused to update the retained reliability information on two separate storage media.
1. A decoding device for a linear code on a ring R, said decoding device comprising:
a plurality of storage media including a register and a semiconductor memory; and
a processing section;
wherein said processing section uses a part of reliability of all symbols at a previous time to update reliability of each symbol in a process of iterative decoding for increasing the reliability of each symbol, and further retains a part used to update retained reliability information in the register and a part unused to update the retained reliability information in the semiconductor memory.
2. The decoding device according to claim 1 ,
wherein said processing section uses belief propagation (BP) as said iterative decoding, and further uses approximation by a UMP (Uniformly Most Powerful) decoding method at a time of a reliability update.
3. The decoding device according to claim 2 ,
wherein said processing section obtains reliability of a received word, determines order of priority in diagonalizing a parity check matrix on a basis of the obtained reliability, diagonalizes the parity check matrix on a basis of the determined order of priority, and updates the reliability of the received word by performing belief propagation (BP) one or a plurality of times using a resulting parity check matrix.
4. The decoding device according to claim 1 ,
wherein one of an algebraic geometry code on a finite field and an isomorphic code of the algebraic geometry code is used as a linear code.
5. The decoding device according to claim 4 , wherein one of a Reed-Solomon code, a Bose-Chaudhuri-Hocquenghem (BCH) code, and isomorphic codes of the Reed-Solomon code and the Bose-Chaudhuri-Hocquenghem (BCH) code is used as an algebraic geometry code, and bounded distance decoding is performed in a subsequent stage with reliability obtained by a plurality of updates as an input received word.
6. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquendem (BCH) encoder to a convolutional encoder, said receiving device comprising:
a decoding device using a reliability update and a decoding method in claim 5 .
7. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquenghem (BCH) encoder to a convolutional encoder, said receiving device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 5 .
8. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
a decoding device using a reliability update and a decoding method in claim 5 .
9. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 5 .
10. The decoding device according to claim 4 ,
wherein one of a Reed-Solomon code, a Bose-Chaudhuri-Hocquenghem (BCH) code, and isomorphic codes of the Reed-Solomon code and the Bose-Chaudhuri-Hocquenghem (BCH) code is used as an algebraic geometry code, and hard decision list decoding by a predetermined algorithm is performed with reliability obtained by a plurality of updates as an input received word.
11. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquenghem (BCH) encoder to a convolutional encoder, said receiving device comprising:
a decoding device using a reliability update and a decoding method in claim 10 .
12. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquenghem (BCH) encoder to a convolutional encoder, said receiving device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 10 .
13. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
a decoding device using a reliability update and a decoding method in claim 10 .
14. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 10 .
15. The decoding device according to claim 4 ,
wherein one of a Reed-Solomon code, a Bose-Chaudhuri-Hocquenghem (BCH) code, and isomorphic codes of the Reed-Solomon code and the Bose-Chaudhuri-Hocquenghem (BCH) code is used as an algebraic geometry code, and multiplicity setting and soft decision list decoding by a predetermined algorithm is performed with reliability obtained by a plurality of updates as an input received word.
16. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquenghem (BCH) encoder to a convolutional encoder, said receiving device comprising:
a decoding device using a reliability update and a decoding method in claim 15 .
17. A receiving device for receiving a signal transmitted from a device formed by connecting one of a Reed-Solomon (RS) encoder and a Bose-Chaudhuri-Hocquenghem (BCH) encoder to a convolutional encoder, said receiving device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 15 .
18. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
a decoding device using a reliability update and a decoding method in claim 15 .
19. A storage medium reproducing device for a signal resulting from n-dimensional product coding using one of a Reed-Solomon (RS) code and a Bose-Chaudhuri-Hocquenghem (BCH) code, said storage medium reproducing device comprising:
an iterative decoding device using a reliability update and a decoding method in claim 15 .
20. A decoding method for a linear code on a ring R,
wherein a part of reliability of all symbols at a previous time is used to update reliability of each symbol in a process of iterative decoding for increasing the reliability of each symbol, and further a part used to update retained reliability information is retained on a register and a part unused to update the retained reliability information is retained on a semiconductor memory.
21. The decoding method according to claim 20 ,
wherein belief propagation (BP) is used as said iterative decoding, and further approximation by a UMP (Uniformly Most Powerful) decoding method is used at a time of a reliability update.
22. The decoding method according to claim 21 ,
wherein reliability of a received word is obtained, order of priority in diagonalizing a parity check matrix is determined on a basis of the obtained reliability, the parity check matrix is diagonalized on a basis of the determined order of priority, and the reliability of the received word is updated by performing belief propagation (BP) one or a plurality of times using a resulting parity check matrix.