Non-Binary Codeword Modulation for Joint Sync and Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems face challenges in asynchronous communications with unknown delays and noise, leading to increased data transmission overhead and receiver complexity due to synchronization headers and separate synchronization and decoding operations, which consume spectral resources and energy.
Innovation Solution
A modified cyclic code shift modulation method that jointly performs synchronization and error correction by associating non-binary error correcting codeword symbols with sequences of chips, using a finite field GF q, and applying phase or amplitude modulation to modulate carriers, allowing for joint demodulation and decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If synchronization headers are introduced into communication frames, then synchronization at the receiver is ensured, but the amount of data to be transmitted increases, consuming spectral resources and energy
Solution Approach 1:
The patent merges synchronization and data transmission by embedding synchronization information within the data payload itself. The receiver can extract synchronization timing from the received signal without requiring separate synchronization headers, thus reducing overall transmission overhead while maintaining reliable synchronization.
Solution Approach 2:
The data payload serves multiple functions simultaneously: it carries both the actual information to be transmitted and the synchronization information needed for timing recovery. This multi-functionality eliminates the need for dedicated synchronization sequences, reducing the quantity of transmitted data.
2Reliability
If synchronization sequences are superimposed on communication frames, then synchronization is achieved, but the energy consumed during transmission increases and receiver complexity increases due to separate synchronization and decoding operations
Solution Approach 1:
The patent combines synchronization detection and data decoding into a unified receiver process. By embedding synchronization information within the data payload and using correlation-based detection, the receiver performs both functions simultaneously, reducing computational complexity and energy consumption compared to separate processing stages.
3Reliability
If traditional error-correcting codes are used in asynchronous communications, then noise robustness is improved, but decoding complexity increases and synchronization overhead is required
Solution Approach 1:
The patent applies error-correcting codes to the entire data payload before transmission, including the embedded synchronization information. This preliminary encoding provides noise robustness for both synchronization and data recovery, while the structured approach to encoding maintains manageable decoding complexity through systematic error correction algorithms.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
This approach reduces data transmission overhead and simplifies decoding processes while maintaining robustness to noise, achieving efficient synchronization and error correction in asynchronous communications.
Implementation Method 1
the first modulation implements a set of q sequences comprising q-1 sequences of q-1 chips, each sequence being obtained by circular shifting of a basic pseudo-random sequence
Implementation Method 2
The second modulation is a phase or amplitude modulation of the carrier
Implementation Method 3
The second modulation is a phase or amplitude modulation of the carrier
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to the transmission and reception of non-binary error-correcting codewords. The transmission method comprises a first modulation (56) that implements a set of q sequences comprising q-1 sequences of q-1 fragments, each sequence being obtained by circular shifting a basic pseudo-random sequence, and a partially invariant sequence, invariant under a predetermined subset of circular shifts. The first modulation (56) further implements an association between each codeword symbol and a sequence from the set of sequences in which, said finite field GFq having a non-zero primitive element, the zero symbol is associated with said partially invariant sequence and a symbol equal to a power j of the primitive element, j being an integer between 0 and q-2, is associated with a pseudo-random sequence determined by j circular shifts of the basic pseudo-random sequence.