Wi-Fi Signaling Sub-Segment Decoding Without All-Zero Tail Bits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Wi-Fi standards face inefficiencies in signaling processing due to the requirement of extra all-zero tail bits in existing encoding/decoding schemes, which increase signaling overhead and reduce decoding performance.
Innovation Solution
The proposed method processes signaling sub-segments using OFDMA technology, where the initial state of the encoder and decoder are set to a tail bit sequence that is partially known, eliminating the need for extra all-zero tail bits and allowing for improved decoding performance through Viterbi decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If extra all-zero tail bits are added to the signaling sub-segment, then the encoder can be reset to a known state, but the signaling overhead increases and decoding performance deteriorates
Solution Approach 1:
The patent extracts and removes the unnecessary all-zero tail bits from the signaling sub-segment. By recognizing that the tail bits are redundant when using a specific tail-biting convolutional code scheme, the invention eliminates these extra bits while maintaining the encoder reset functionality through an alternative mechanism using a known reference state sequence.
Solution Approach 2:
The patent changes the parameter of the tail bit sequence from all-zero bits to a specific sequence derived from identifier information (AID, PAID, or BSSID). This parameter change allows the tail bits to carry meaningful information while still serving the function of resetting the decoder state, thereby reducing overhead and improving performance.
2Productivity
If traditional BCC or TBCC encoding schemes are used, then encoding can be performed, but decoding performance is reduced due to unknown initial states requiring extensive path search
Solution Approach 1:
The patent performs preliminary action by pre-determining the initial state of the decoder using a reference state sequence that is derived from known identifier information. This preliminary setup eliminates the need for extensive path searching during decoding, as the decoder starts from a known state rather than having to search through all possible states.
Solution Approach 2:
The patent implements feedback by using the decoded identifier information (AID, PAID, or BSSID) to determine the initial state for subsequent decoding operations. The decoded information feeds back into the decoding process itself, creating a closed-loop system that improves decoding accuracy by utilizing previously decoded information.
Data Source
AI summary
A method is provided, including: receiving a to-be-decoded signaling sub-segment, where the to-be-decoded signaling sub-segment includes one or more to-be-decoded sequences D0; obtaining a local ID sequence N2 with an N-bit length according to ID information stored on a receive end; for each to-be-decoded sequence D0, setting an initial state and a final state of a decoder to a reference state sequence with a T length and obtaining a decoded sequence D1, where at least some bits in the reference state sequence are identical to some bits in the obtained local ID sequence N2, referred to as a specific reference state sequence in short; and performing processing according to a decoding result.