Polar Code Rate-Matching With Parity Bits for Low-Latency Decoding

The patent changes the fundamental parameter of rate-matching from repetition-based to puncturing/shortening-based approach. By modifying how the code rate is adjusted (using puncturing to remove redundant bits or shortening to truncate the code), the system achieves error correction performance improvement without incurring the high decoding complexity associated with repetition-based methods. This parameter change allows the decoder to process codes more efficiently while maintaining reliability.

The patent applies preliminary action by pre-determining the optimal puncturing or shortening pattern based on channel conditions and code rate requirements. The encoder proactively selects which bits to puncture or how much to shorten the code before transmission, based on predetermined criteria. This preliminary configuration ensures that the decoder receives pre-optimized code structures that maintain error-correcting performance while minimizing decoding complexity, avoiding the need for complex adaptive adjustments during decoding.

The patent segments the polar code encoding process by dividing the mother code into multiple segments or blocks. Instead of encoding the entire message as one large polar code with extended mother code size, the system divides it into smaller code blocks that can be encoded and decoded independently or in parallel. This segmentation maintains the error-correcting benefits of polar codes while reducing the computational burden and latency associated with processing extremely long codes, as each segment can be processed more quickly.