Codeword Synchronization Using Candidate Bit Boundary Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing codeword synchronization methods for linear block codes in communication systems require additional data insertion, leading to redundant information and reduced synchronization performance.
Innovation Solution
A self-synchronization method that determines a candidate bit in a data sequence and verifies its position as a synchronization point without adding extra data, using characteristic values of test data blocks to confirm synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If an alignment marker sequence is inserted at intervals to enable codeword synchronization, then synchronization can be achieved, but additional redundant data is added to the data stream
Solution Approach 1:
The patent applies self-service by enabling the data stream itself to provide synchronization information through existing codeword structures. The receiver autonomously identifies codeword boundaries by analyzing syndrome patterns and error correction outcomes without requiring external alignment markers, making the system self-synchronizing while eliminating redundant synchronization data.
Solution Approach 2:
The patent extracts synchronization capability from separate alignment marker sequences and integrates it into the existing codeword structure. By utilizing the inherent error detection and correction mechanisms of linear block codes, the synchronization function is extracted from redundant AM sequences and embedded within the data-carrying codewords themselves.
2Measurement precision
If alignment marker sequences are used for synchronization, then codeword boundaries can be identified, but synchronization performance is reduced due to redundant information
Solution Approach 1:
The patent merges the synchronization function with the error detection and correction function of linear block codes. By combining codeword boundary identification with the existing syndrome calculation and error correction process, the system achieves both functions simultaneously using the same data structures and processing mechanisms, eliminating the need for separate alignment marker sequences.
Solution Approach 2:
The patent makes the linear block code structure universal by enabling it to serve multiple functions: data transmission, error detection, error correction, and synchronization. The same codeword structure and syndrome calculation process that provide error protection also provide precise codeword boundary identification, making the system multi-functional without requiring separate mechanisms for each function.
Data Source
AI summary
A codeword synchronization method includes determining a candidate in a plurality of bits of a data sequence received by a receive end, and determining a synchronization position based on the candidate bit, where the synchronization position indicates a start position of a codeword in the data sequence.