IP Library Granted Patent US 12,531,577
Granted Patent B2
US 12,531,577 · App. 18/734,882 · Granted Jan 20, 2026

Error correction decoding device

Inventor: Takafumi Fujimori (Tokyo, JP)
Assignee: MITSUBISHI ELECTRIC CORPORATION
H03M13/3723H03M13/1108H03M13/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,531,577
App. No.
18/734,882
Granted
Jan 20, 2026
Kind
B2
Abstract

A decoding device includes a likelihood initialization unit performing initialization process on a storage element for likelihood information used in likelihood calculation of iterative decoding process; a first likelihood calculation unit executing M separate likelihood calculations corresponding to steps 1 to M where M is an integer of 2 or more in likelihood calculation; a second likelihood calculation unit executing M separate likelihood calculations corresponding to steps M+1 to 2M in likelihood calculation of the iterative decoding process; a hard decision unit making hard decision on a likelihood calculation result and generating a decoded bit sequence; a frozen bit removing unit removing a frozen bit and a bit sequence based on a code length of the bit sequence to be decoded from the decoded bit sequence and generating a decoded information bit sequence; and a control unit controlling likelihood calculation of the iterative decoding process.

Claims (24)

1 . A decoding device comprising:

processing circuitry configured to:

perform an initialization process on a storage element for likelihood information to be used in likelihood calculation of an iterative decoding process on a basis of likelihood information to be input and a code length of a bit sequence to be decoded;

execute M separate first likelihood calculations corresponding to step 1 to step M where M is an integer of 2 or more, in likelihood calculation of the iterative decoding process;

execute M separate second likelihood calculations corresponding to step M+1 to step 2M in likelihood calculation of the iterative decoding process;

make a hard decision on a result of likelihood calculation and to generate a decoded bit sequence;

remove a frozen bit and a bit sequence based on the code length of the bit sequence to be decoded from the decoded bit sequence and to generate a decoded information bit sequence; and

control likelihood calculation of the iterative decoding process on a basis of the code length of the bit sequence to be decoded, wherein

each of the first likelihood calculations and the second likelihood calculations includes one or more steps,

the processing circuitry is configured to perform the one or more steps of each of the first likelihood calculations and the second likelihood calculations iteratively,

Mt is a positive integer less than or equal to the M, and

the processing circuitry is further configured to perform an initial likelihood calculation process for executing M-Mt separate likelihood calculations corresponding to step 1 to step M−Mt, and an iterative decoding process for iteratively executing Mt separate likelihood calculations corresponding to step M−Mt+1 to step M.

2 . A decoding device comprising:

processing circuitry configured to:

perform an initialization process on a storage element for likelihood information to be used in likelihood calculation of an iterative decoding process on a basis of likelihood information to be input and a code length of a bit sequence to be decoded;

execute M separate first likelihood calculations corresponding to step 1 to step M where M is an integer of 2 or more, in likelihood calculation of the iterative decoding process;

execute M separate second likelihood calculations corresponding to step M+1 to step 2M in likelihood calculation of the iterative decoding process;

make a hard decision on a result of likelihood calculation and to generate a decoded bit sequence;

remove a frozen bit and a bit sequence based on the code length of the bit sequence to be decoded from the decoded bit sequence and to generate a decoded information bit sequence; and

control likelihood calculation of the iterative decoding process on a basis of the code length of the bit sequence to be decoded, wherein

each of the first likelihood calculations and the second likelihood calculations includes one or more steps,

the processing circuitry is configured to perform the one or more steps of each of the first likelihood calculations and the second likelihood calculations iteratively,

Mt is a positive integer less than or equal to the M, and

the processing circuitry is further configured to perform an iterative decoding process for iteratively executing Mt separate likelihood calculations corresponding to step M+1 to step M+Mt, and a terminal likelihood calculation process for executing M−Mt separate likelihood calculations corresponding to step M+Mt+1 to step 2M.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 6, 2024
From: FUJIMORI, TAKAFUMI
To: MITSUBISHI ELECTRIC CORPORATION
Reel/Frame 067649/0604 →
Continuity (2)
Continuation PCTJP2022002404 · Jan 24, 2022
Related Publication 20240333314A1 · Oct 3, 2024
References Cited (22)
US 8621316B2 · Miyata · 2013 [cited by examiner]
US 9742440B2 · El-Khamy · 2017 [cited by examiner]
US 10312946B2 · Wang · 2019 [cited by examiner]
US 10374754B2 · Shen · 2019 [cited by examiner]
US 10998922B2 · Koike-Akino · 2021 [cited by examiner]
US 11695507B2 · Zhang · 2023 [cited by examiner]
US 20150010103A1 · Murakami · 2015 [cited by examiner]
US 20190296776A1 · Xu et al. · 2019 [cited by applicant]
US 20190393897A1 · Gresset · 2019 [cited by applicant]
US 20200092048A1 · Hong et al. · 2020 [cited by applicant]
US 20220200634A1 · Xu et al. · 2022 [cited by applicant]
EP 3376672B1 · 2019 [cited by applicant]
JP 2019527978A · 2019 [cited by applicant]
JP 2019534651A · 2019 [cited by applicant]
WO WO2021220441A1 · 2021 [cited by applicant]
Arikan, “Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels”, IEEE Transactions on Information Theory, vol. 55, No. 7, Jul. 2009, pp. 3051-3073. [cited by applicant]
Feng et al., “Efficient-Memory and Low-Latency BP Decoding Algorithm for Polar Codes”, IEEE Communications Letters, vol. 24, No. 6, Jun. 2020, pp. 1236-1239. [cited by applicant]
International Search Report (PCT/ISA/210) issued in PCT/JP2022/002404, dated Apr. 5, 2022. [cited by applicant]
Koike-Akino et al., “Protograph-Based Design for QC Polar Codes”, IEEE International symposium on Information Theory, 2021, pp. 593-598. [cited by applicant]
Xu et al., “XJ-BP Express Journey Belief Propagation Decoding for Polar Codes”, IEEE Global Communications Conference, 2015, 6 pages. [cited by applicant]
Extended European Search Report for European Application No. 22921939.9, dated Jan. 14, 2025. [cited by applicant]
Qiao et al., “A scalable ASIP for BP Polar decoding with multiple code lengths,” MATEC Web of Conferences, vol. 232, 2018, pp. 1-7. [cited by applicant]