IP Library Granted Patent US 12,301,259
Granted Patent B2
US 12,301,259 · App. 18/258,967 · Granted May 13, 2025

Decoding apparatus, decoding method and program

Inventor: Jun Muramatsu (Tokyo, JP)
Assignee: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
H03M13/3944H03M13/13
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,301,259
App. No.
18/258,967
Granted
May 13, 2025
Kind
B2
Abstract

A decoding device includes a memory and a processor configured to execute inputting a code word encoded by a polar code from an original message; decoding the original message from the code word based on a conditional probability expressed by a symmetric parameterization and having observation information as a condition; and outputting the decoded original message.

Claims (32)

1. A decoding device, comprising:

a memory; and

a processor configured to execute

receiving, through a communication channel or a storage medium, a code word encoded by a polar code from an original message, from an encoding device;

decoding the original message from the code word based on a conditional probability expressed by a symmetric parameterization and having observation information as a condition, the conditional probability expressed by the symmetric parameterization expressing how much a value of a bit to be decoded deviates from ½ so as to reduce a memory space required to store values of the conditional probability; and

outputting the decoded original message,

wherein the original message is transmitted to the decoding device with error correction or data compression.

2. The decoding device according to claim 1 , wherein, in a case where the decoding device is applied to decoding for an information source code, the processor further executes,

inputting information of a frozen bit as the code word from the communication channel or the storage medium that is noise-free, and

decoding the original message by using auxiliary information as the observation information.

3. The decoding device according to claim 1 , wherein, in a case where the decoding device is applied to decoding for communication channel code, the processor further executes,

inputting, as the code word, a communication channel output from the communication channel having noise, and

decoding the original message by using the communication channel output as the observation information.

4. The decoding device according to claim 3 , wherein, in a case where the decoding device is applied to decoding for a systematic communication channel code,

information of a frozen bit is shared between an encoding side and a decoding side, and

the processor further executes inputting the communication channel output in which the original message and additional information obtained by polar conversion on the encoding side are used as communication channel inputs, and

decoding the original message by using the information of the frozen bit and the communication channel output.

5. The decoding device according to claim 3 , wherein, in a case where the decoding device is applied to decoding for a non-systematic communication channel code,

information of a frozen bit is shared between an encoding side and a decoding side, and

the processor further executes inputting the communication channel output in which information of non-frozen bit and information obtained by polar conversion from the information of the frozen bit on the encoding side are used as communication channel inputs, and

decoding the original message by storing a determination result of 0 or 1 in a memory area corresponding to a position of a non-frozen bit based on the information of the frozen bit and the communication channel output.

6. The decoding device according to claim 1 , wherein the processor further executes list decoding for selecting a sequence of a most probable path from among the number (predetermined list size) of survival paths.

7. The decoding device according to claim 1 , wherein the conditional probability is calculated based on a signed difference between a probability to be 0 and a probability to be 1 for each bit.

8. A decoding method executed by a decoding device including a memory and a processor, the method comprising:

receiving, through a communication channel or a storage medium, a code word encoded by a polar code from an original message, from an encoding device;

decoding the original message from the code word based on a conditional probability expressed by a symmetric parameterization and having observation information as a condition, the conditional probability expressed by the symmetric parameterization expressing how much a value of a bit to be decoded deviates from ½ so as to reduce a memory space required to store values of the conditional probability; and

outputting the decoded original message,

wherein the original message is transmitted to the decoding device with error correction or data compression.

9. A non-transitory computer-readable recording medium having computer-readable instructions stored thereon, which when executed, cause a computer to perform a process comprising: receiving, through a communication channel or a storage medium, a code word encoded by a polar code from an original message, from an encoding device;

decoding the original message from the code word based on a conditional probability expressed by a symmetric parameterization and having observation information as a condition, the conditional probability expressed by the symmetric parameterization expressing how much a value of a bit to be decoded deviates from ½ so as to reduce a memory space required to store values of the conditional probability; and

outputting the decoded original message,

wherein the original message is transmitted to the decoding device with error correction or data compression.

Assignments (2)
CHANGE OF NAME Recorded Aug 15, 2025
From: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
To: NTT, INC.
Reel/Frame 072490/0664 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2023
From: MURAMATSU, JUN
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 064033/0352 →
Continuity (1)
Related Publication 20240056102A1 · Feb 15, 2024
References Cited (21)
US 11063614B1 · Chen · 2021 [cited by examiner]
US 11165445B2 · Blankenship · 2021 [cited by examiner]
US 11177834B2 · Chaki · 2021 [cited by examiner]
US 11405055B2 · Arikan · 2022 [cited by examiner]
US 20170077954A1 · Shen · 2017 [cited by examiner]
US 20170155405A1 · Ge · 2017 [cited by examiner]
US 20180351581A1 · Presman · 2018 [cited by examiner]
US 20190052418A1 · Li · 2019 [cited by examiner]
US 20200021309A1 · Xu · 2020 [cited by examiner]
US 20200028524A1 · Huang · 2020 [cited by examiner]
US 20200067638A1 · Zhou · 2020 [cited by examiner]
US 20210399747A1 · Feng · 2021 [cited by examiner]
E. Arikan, “Channel polarization:a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,”, IEEE Trans. Inform. Theory, vol. IT-55, No. 7, pp. 1-23, Jul. 2009. [cited by examiner]
I. Tal, A. Vardy, “List decoding of polar codes,” IEEE Transactions on Information Theory, vol. 61, No. 5, May 2015. [cited by applicant]
E.Arikan, et al. “Source polarization,” Proc. 2010IEEE International Symposium on Information Theory, 2010, pp. 899-903. [cited by applicant]
E. Arikan, “Systematic polar coding,”, IEEE Communications Letters, vol. 15, No. 8, pp. 860-862, Aug. 2011. [cited by applicant]
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, “Time bounds for selection,”, J. Computer and System Sciences, vol. 7, No. 4, pp. 448-461, 1973. [cited by applicant]
R. Mori and T. Tanaka, “Source and channel polarization over finite fields and Reed-Solomon matrices,”, IEEE Trans. Inform. Theory, vol. IT-60, No. 5, pp. 1-17, Feb. 2014. [cited by applicant]
J. Muramatsu, “Successive-cancellation decoding of linear source code,”, Proceedings of the 2019 IEEE Information Theory Workshop, Visby, Sweden, Aug. 25-28, 2019. Extended version available at arXiv: 1903.11787 [cs.IT]… [cited by applicant]
E. S, as,oglu, “Polarization and polar codes,”, Fund. Trends Commun. Inf. Theory, vol. 8, No. 4, pp. 259-381, Oct. 2012. [cited by applicant]
I. Tal and A. Vardy, “How to construct polar codes,”, IEEE Trans. Inform. Theory, vol. IT-59, No. 10, pp. 1-21, Apr. 2013. [cited by applicant]