Map algorithm-based turbo decoding method and apparatus, and computer storage medium
AssigneeSanechips Technology Co., Ltd.
InventorsXi Wang, Ning Qiu, Nanshan Cao
Life of this patent
Estimating the term…
Abstract
An MAP algorithm-based Turbo decoding method and apparatus. The method includes: iteratively estimating an information symbol by using an MAP algorithm, acquiring an α and β window boundary values of each sliding window by means of window boundary value inheritance, acquiring an α block boundary value and β block boundary value of each sub-block by means of block boundary value inheritance, and recursively calculating posterior probability Log Likelihood Ratio (LLR) values of a whole window and a whole block according to the α boundary values and the β boundary values (101); and performing decoding decision according to the LLR values (102).
Claims12
A Maximum A Posteriori (MAP) algorithm-based Turbo decoding method, an information symbol being sequentially divided into a plurality of sub-blocks, each sub-block comprising a plurality of sliding windows, the method comprising:
- iteratively estimating an information symbol by using an MAP algorithm, acquiring α and β boundary values for each sliding window and each sub-block by means of window boundary value inheritance and block boundary value inheritance, and recursively calculating posterior probability Log Likelihood Ratio (LLR) values of a whole window and a whole block according to the α and β boundary values;
- and
- performing decoding decision according to the LLR values,
- wherein acquiring an α boundary value for a sliding window by means of window boundary value inheritance and block boundary value inheritance comprises:
- taking an α boundary value, acquired in a previous iteration, as an initial value of α in a present iteration, forwardly reading input data of the whole window of the sliding windows, and calculating an α value of the whole window;
- and
- acquiring a β boundary value for a sliding window by means of window boundary value inheritance and block boundary value inheritance comprises:
- taking a β boundary value, acquired in the previous iteration, as an initial value of β in the present iteration, reversely reading the input data of the whole window of the sliding windows, and calculating a β value of the whole window,
- and wherein in order to calculate β values, write and read addresses of a RAM for storing the input data range from 0 to K−1 and range from K−1 to 0 respectively, where K is a data length of a window.
A Maximum A Posteriori (MAP) algorithm-based Turbo decoder, comprising:
- a processor;
- and
- a memory, having stored therein instructions that, when executed by a processor, causes the processor to perform an MAP algorithm-based Turbo decoding method, the method comprising:
- iteratively estimating an information symbol by using an MAP algorithm, acquiring α and β boundary values for each sliding window and each sub-block by means of window boundary value inheritance and block boundary value inheritance, and recursively calculating posterior probability Log Likelihood Ratio (LLR) values of a whole window and a whole block according to the α and β boundary values;
- and
- performing decoding decision according to the LLR values,
- wherein acquiring α and β boundary values for each sliding window and each sub-block by means of window boundary value inheritance and block boundary value inheritance comprises:
- taking an α boundary value, acquired in a previous iteration, as an initial value of α in a present iteration, forwardly reading input data of the whole window of the sliding windows, and calculating an α value of the whole window;
- and taking a β boundary value, acquired in the previous iteration, as an initial value of β in the present iteration, reversely reading the input data of the whole window of the sliding windows, and calculating a β value of the whole window, and
- wherein in order to calculate β values, write and read addresses of a RAM for storing the input data range from 0 to K−1 and range from K−1 to 0 respectively, where K is a data length of a window.
A non-transitory computer storage medium, storing computer executable instructions for executing a Maximum A Posteriori (MAP) algorithm-based Turbo decoding method, an information symbol being sequentially divided into a plurality of sub-blocks, each sub-block comprising a plurality of sliding windows, the method comprising:
- iteratively estimating an information symbol by using an MAP algorithm, acquiring α and β boundary values for each sliding window and each sub-block by means of window boundary value inheritance and block boundary value inheritance, and recursively calculating posterior probability Log Likelihood Ratio (LLR) values of a whole window and a whole block according to the α and β boundary values;
- and
- performing decoding decision according to the LLR values,
- wherein acquiring an α boundary value for a sliding window by means of window boundary value inheritance and block boundary value inheritance comprises:
- taking an α boundary value, acquired in a previous iteration, as an initial value of α in a present iteration, forwardly reading input data of the whole window of the sliding windows, and calculating an α value of the whole window;
- and
- acquiring a β boundary value for a sliding window by means of window boundary value inheritance and block boundary value inheritance comprises:
- taking a β boundary value, acquired in the previous iteration, as an initial value of β in the present iteration, reversely reading the input data of the whole window of the sliding windows, and calculating a β value of the whole window, and
- wherein in order to calculate β values, write and read addresses of a RAM for storing the input data range from 0 to K−1 and range from K−1 to 0 respectively, where K is a data length of a window.
Dependencies are inferred from the claim text.