LDPC Decoder Minimum Search Using Flattened One-Hot Comparison

The patent transforms the comparison problem from a sequential one-dimensional process into a parallel multi-dimensional operation by converting input values into one-hot vectors. This allows simultaneous comparison across multiple dimensions (bits) using vector operations, dramatically increasing computation speed while maintaining implementation feasibility through standardized vector processing units.

The patent creates multiple copies of comparison logic in the form of one-hot vector representations. Instead of comparing values sequentially, it generates parallel comparison paths where each bit position is compared simultaneously across all input values, achieving speedup through spatial replication of the comparison function.

The patent merges multiple comparison operations into a single unified vector operation. By representing all input values as one-hot vectors and performing bitwise OR operations followed by priority decoding, it combines what would require multiple separate comparator stages into one integrated processing unit, reducing device complexity while maintaining high computation speed.

The patent replaces the mechanical tree-structured comparator network with a more efficient vector-based computational model. Instead of physically arranging comparators in a tree hierarchy, it uses mathematical vector operations (one-hot encoding, bitwise OR, priority decoding) that can be implemented with simpler, more scalable hardware logic.

The patent performs preliminary transformation of input values into one-hot vectors before comparison. This preprocessing step encodes all necessary comparison information in a format that enables parallel processing, so that when the actual comparison is performed, all values are evaluated simultaneously in a single operation rather than through iterative steps.

The patent maintains continuous useful action by performing comparison operations in parallel without idle iterations. The one-hot vector approach ensures that every input value is actively compared in each processing cycle, eliminating the sequential waiting periods inherent in iterative methods while maintaining complete comparison coverage.