ULP Decoder Branching for Low-Power BCH Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional BCH decoding is complex and power-intensive, making it inefficient for use in wireless sensor networks, which require ultra-low power consumption and efficient error correction for variable spreading factor ternary on-off keying (VSF-TOOK) systems.
Innovation Solution
A method is implemented in a receiver device to decode spread spectrum coded streams by determining the number of invalid codewords, demapping blocks with a first number of invalid codewords, and computing syndrome components with an update procedure for a second number of invalid codewords, reducing computational complexity and power consumption by eliminating unnecessary steps like Berlekamp-Massey and Chien search procedures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional BCH decoding is used, then error correction capability is provided, but power consumption is high and computational complexity is large
Solution Approach 1:
The decoding process is segmented into two distinct paths: a fast path for handling invalid codewords and a syndrome decoding path for valid codewords. This segmentation allows the system to avoid complex syndrome decoding when simpler validation suffices, thereby reducing power consumption while maintaining error correction capability.
Solution Approach 2:
The patent implements a two-path decoding approach where full syndrome decoding is performed only when necessary (for valid codewords), while invalid codewords are handled by a simpler validation path. This partial application of the full decoding procedure reduces computational complexity and power consumption without sacrificing reliability.
2Reliability
If conventional BCH decoding is used, then error correction is achieved, but device complexity increases
Solution Approach 1:
The decoding logic is divided into separate modules: an invalid codeword validation module that quickly identifies and handles invalid codewords, and a syndrome decoding module that processes only valid codewords. This modular segmentation reduces overall device complexity by avoiding the execution of complex procedures when simpler ones suffice.
Solution Approach 2:
Full syndrome decoding with Berlekamp-Massey and Chien search procedures is applied only to valid codewords, while invalid codewords are processed through a simpler validation path. This selective application of complex algorithms reduces computational complexity without compromising error correction capability.
3Reliability
If full syndrome decoding with Berlekamp-Massey and Chien search procedures is performed, then complete error correction is achieved, but power consumption increases by an order of magnitude
Solution Approach 1:
The decoding process is segmented into a fast validation path for invalid codewords and a full syndrome decoding path for valid codewords. This segmentation ensures that power-intensive operations are performed only when necessary, reducing overall power consumption by an order of magnitude while maintaining complete error correction capability for valid codewords.
Solution Approach 2:
The patent applies full syndrome decoding procedures (Berlekamp-Massey and Chien search) only to valid codewords that require complete error correction, while invalid codewords are handled by a simpler validation mechanism. This partial application of computationally intensive procedures dramatically reduces power consumption without sacrificing correction capability where needed.
Data Source
AI summary
A method includes decoding, by a receiver device, a spread spectrum coded stream of information including a multiple codeword blocks. The decoding includes determining a number of invalid codewords in a particular block of codewords. Based on a first particular number of invalid codewords in the particular block of codewords, the particular block of codewords is demapped, and parity codewords of the particular block of codewords are discarded. Based on a second particular number of invalid codewords in the particular block of codewords, a subset of syndrome components is computed using one or more coding enumerations with an update procedure for the subset of syndrome components, if all of the subset components are zero an erroneous bit is found, otherwise coding enumerations continue, the particular block of codewords is demapped, and parity codewords of the particular block of codewords are discarded.