Research on TPC Decoding Algorithm Based on Probability Calculation and FPGA Design
DOI:
Author:
Affiliation:

1.School of Optoelectronic Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China; 2. Engineering College, Shantou University, Shantou 515021,China

Clc Number:

TN918.3

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The common decoding algorithm for TPC codes (Turbo Product Code) is the Pyndiah-Chase-II algorithm, but the Pyndiah-Chase-II algorithm involves a large number of sorting operations, complex branching structures and storage scheduling in the process of searching for the least reliable input bit positions and shortest Euclidean distance code words making it very unfavorable for integrated circuit hardware implementation. In order to solve these problems, proposing a TPC decoding algorithm based on probabilistic computation, the algorithm includes information input layer, random bit stream generation layer, BCH hard judgment layer, BCH&CRC check layer, and output layer, and the sub-code of TPC code adopts BCH code, program design of decoding algorithm and simulation of decoding performance and decoding delay by MATLAB software. The simulation results show that the decoding algorithm can achieve the same decoding performance as the traditional Pyndiah-Chase-II algorithm, and it only needs two iterations on average to achieve correct decoding, which can effectively reduce the decoding delay. Finally, the FPGA-based hardware design is completed. The BCH hard judgment layer is implemented by the lookup table method, and the logic structure of other layers is simple and all are gate-level operations, so it can significantly reduce the hardware overhead and power consumption, and is easy to implement with integrated circuits.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: August 05,2024
  • Published: