PAC Code Decoding With Dynamic List Viterbi Path Control

The patent applies dynamics by making the list size variable rather than fixed. The list size is dynamically adjusted based on the number of active states in the trellis diagram during decoding. When the number of active states is large, a larger list size is used to maintain more paths; when active states are fewer, a smaller list size is used. This dynamic adaptation resolves the contradiction by allowing the system to maintain both high reliability (through sufficient path tracking) and high productivity (through efficient resource utilization).

The patent changes the parameter of list size from a static value to a variable that adapts to decoding conditions. By modifying the list size parameter based on the number of active states, the system optimizes the balance between error-correction performance and decoding throughput. This parameter change allows the decoder to allocate computational resources efficiently while maintaining accurate path tracking throughout the decoding process.

The patent uses dynamics to adjust the number of paths assigned to each state based on the actual number of active states in the trellis. Instead of uniformly increasing paths for all states (which would increase complexity unnecessarily), the system dynamically determines the appropriate number of paths for each state. This approach maintains high path retention accuracy for states that need it while avoiding unnecessary complexity in states with fewer active transitions.

The patent applies local quality by allowing different numbers of paths to be assigned to different states based on their specific characteristics. States with more active states receive more paths to maintain accuracy, while states with fewer active states receive fewer paths. This localized adaptation resolves the contradiction by optimizing path assignment individually for each state rather than applying a uniform approach system-wide.