Non-Binary Codeword Modulation for Joint Sync and Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems face challenges in synchronizing data transmission over channels with unknown delays and noise, especially in massive IoT communication, where increased data transmission leads to higher spectral resource and power consumption.
Innovation Solution
A method for transmitting non-binary error correcting code words using a modified cyclic code-shift keying (CCSK) modulation, which includes a first spread spectrum modulation and a second phase or amplitude modulation, allowing for joint synchronization and error correcting decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If synchronization headers are introduced into communication frames, then synchronization is ensured at the receiver level, but the amount of data to be transmitted increases, consuming more spectral resources and power
Solution Approach 1:
The patent merges synchronization and data transmission by superimposing synchronization sequences onto communication frames using spread spectrum modulation. This allows both functions to be performed simultaneously without requiring separate header structures, thereby maintaining synchronization capability while reducing overall data transmission requirements.
Solution Approach 2:
The synchronization sequences serve multiple functions: they provide synchronization information, enable signal detection, and support spread spectrum modulation for robustness. This multi-functionality eliminates the need for dedicated synchronization headers, reducing the total data volume while maintaining reliable synchronization.
2Productivity
If synchronization sequences are superimposed on communication frames, then spectral efficiency is improved, but the energy consumed during transmission increases
Solution Approach 1:
The patent employs spread spectrum modulation techniques that spread the synchronization sequence energy across a wider frequency band. This parameter change in signal representation allows efficient spectral utilization while the processing gain from spread spectrum helps maintain energy efficiency despite the superposition approach.
3Reliability
If separate operations of synchronization and decoding are implemented at the receiver, then each operation can be optimized independently, but the complexity of the receivers increases
Solution Approach 1:
The patent combines synchronization and decoding operations into a unified receiver process. The spread spectrum correlation operation simultaneously performs synchronization detection and signal recovery, eliminating the need for separate processing stages and reducing overall receiver complexity while maintaining decoding accuracy.
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 the amount of data needed for transmission, conserves spectral resources and power, and simplifies the decoding process while maintaining robustness against noise and unknown delays.
Implementation Method 1
a first spread spectrum modulation associating a sequence of chips with each p-bit code word symbol
Implementation Method 2
a second modulation for modulating at least one carrier with the sequences associated with the code words, by phase or amplitude modulation
Implementation Method 3
a second modulation for modulating at least one carrier with the sequences associated with the code words, by phase or amplitude modulation
Data Source
AI summary
The invention relates to the transmission and reception of non-binary error correcting code words. The transmission method includes a first modulation (56) which 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, and a partially invariant sequence, invariant to a predetermined subset of circular shifts. The first modulation (56) further implements an association between each code word symbol and a sequence of the set of sequences wherein said finite field GFq has a non-zero primitive element, the symbol zero being associated with said partially invariant sequence and a symbol equal to a power j of the primitive element, j being an integer comprised between 0 and q−2, being associated with a pseudo-random sequence determined by j circular shifts of the basic pseudo-random sequence.