The Decoding Algorithm Of TPC And Realization

During the development of channel encoding, The code Researchers are always finding a kind of code which has near-optimum performance, low bit error rate and low decoding complexity. Berrou advanced Turbo codes in 1993. The Turbo codes have the near-optimum performance and low bit error rate, so it gets the wide care. But the Turbo codes also have shortcuts such as high decoding complexity, and long decoding latency. On the base of Turbo codes, 1994 .Pyndiah suggested the Turbo Product Codes. The Turbo Product Codes remain the merits from Turbo codes, and because of its linear codes, the decoding structure is simpler than Turbo codes.These years, Tpc has benn used in many communication fields,and will take place of convolutional code.First ,The paper surrounds The theory of endoding and decoding, describes related basis knowledge,and for the application now, runs back over the past. Scend,from the structure of Tpc,discussed the building means , interleaving ways ,the choice and the performance of subcodes. Third, study probability decoding of Tpc, iterative decoding algorithm and Chase algorithm. Finally ,The algorithm has been realized ,and the result reached our requirement.The paper has been described the realization way of hard ware. For the non-standard signal in the working. Designed the chart of the whole module and the function of the module. Finding synchronous code and phase fuzzy have been settled . At the conclusion of this thesis are a summary of the accomplished work and my outlook of the successive research.