Block Code Decoding Using XOR Masks for Fewer Correlations

The patent pre-calculates and stores the Hamming distances between all pairs of codewords before the actual decoding process. This preliminary action creates a distance lookup table that allows the decoder to quickly identify candidate codewords within the minimum Hamming distance without performing full correlation operations during decoding, thus resolving the contradiction between code length and decoding efficiency

The patent segments the decoding process into two stages: first identifying candidate codewords using the pre-computed Hamming distance table, and then performing correlation operations only on these limited candidates. This segmentation reduces the number of correlation operations from exponential to linear with respect to code length, maintaining decoding efficiency even as block code length increases

The patent applies local quality by focusing computational resources only on the locally relevant subset of codewords that fall within the minimum Hamming distance from the received signal. Instead of uniformly processing all codewords, the method identifies and processes only those codewords that have a non-zero probability of being the transmitted codeword, thus maintaining reliability while reducing computational load

The patent performs partial action by conducting correlation operations only on the subset of candidate codewords identified through Hamming distance filtering, rather than performing exhaustive correlation operations on all predetermined codewords. This partial processing approach maintains sufficient decoding accuracy by focusing on the most likely candidates while significantly reducing the overall computational burden