Packet Markov superposition coding method by taking binary BCH code as component code, and decoding method
A technology of BCH code and superposition coding, which is applied in the direction of using block code for error correction/detection, cyclic code, and linear code for error correction/detection, etc., which can solve the problem of binary BCH code with high complexity and unsuitable for practical systems, etc. question
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0045] This specific embodiment uses the windowed decoding method, and compares it with the Chase-II soft-in and soft-out decoding method to illustrate the effectiveness of the binary BCH code soft-in and soft-out decoding method proposed by the present invention. details as follows:
[0046] Use BCH [31,16] as the component code of the block Markov superposition coding method, configuration B=160. In the window decoding method, the decoding window size is set to be (d+1)nBbits, where d=3m, using the Chase-II soft-in and soft-out decoding method and the soft-in soft of the binary BCH code proposed by the present invention respectively The decoding method (configure the maximum number of tests T = 256) is used to carry out the Monte Carlo simulation experiment of the additive Gaussian white noise channel based on binary phase shift keying. Depend on figure 2 , it can be seen that compared with the Chase-II soft-in and soft-out decoding method, the soft-in and soft-out decodi...
Embodiment 2
[0048] This specific implementation mode uses a two-stage decoding method to provide a coding and decoding scheme that meets the performance requirements of the forward error correction coding of the optical communication system. details as follows:
[0049] designed at a bit error rate of 10 -15 Provide a packet Markov superposition coding method that can achieve a net coding gain of 11dB and meet the requirements of optical communication systems. It uses a two-stage decoding method for decoding, and performs Monte Card based on the additive Gaussian white noise channel of binary phase shift keying. Luo simulation experiment and performance analysis. Wherein, the first stage of the two-stage decoding uses a windowed decoding method with a limited sliding window length (the decoding window size is (d+1)nBbits, where d=m). Using BCH[127,106] as component code, configuration B=50. Using the soft-in and soft-out decoding method of the binary BCH code proposed by the present in...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com