Over-sized DFT for Repeated Preamble Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems face increased complexity and computational overhead when detecting multiple orthogonal frequency-division multiplexing (OFDM) or discrete multi-tone (DMT) signal preambles, especially when they are repeated multiple times without cyclic prefixes, using traditional time-domain or frequency-domain correlation methods.
Innovation Solution
The use of over-sized discrete Fourier transforms (DFT) or fast Fourier transforms (FFT) to detect repeated preamble symbols, calculating the sum of energies for subcarriers and non-subcarriers, and comparing these sums against a threshold to determine the presence of preamble symbols, thereby reducing detection complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional time-domain or frequency-domain correlation methods are used to detect multiple repeated OFDM or DMT preamble symbols, then detection accuracy is maintained, but device complexity and computational overhead increase significantly
Solution Approach 1:
The patent extracts only the essential detection function by using energy detection of DFT coefficients rather than full correlation processing. Instead of computing complex correlation between received signal and preamble templates, the system extracts only the energy information from DFT coefficients that correspond to expected preamble frequencies, dramatically simplifying the detection mechanism while maintaining reliability
Solution Approach 2:
The patent changes the detection parameter from complex correlation values to simple energy magnitudes of DFT coefficients. By transforming the detection metric from phase-sensitive correlation to magnitude-based energy detection, the system reduces computational requirements while preserving detection capability for repeated preamble symbols
2Reliability
If traditional correlation methods are used for preamble detection, then reliable detection is achieved, but energy consumption increases
Solution Approach 1:
The patent employs computationally inexpensive energy detection operations that can be performed rapidly and discarded, replacing expensive long-running correlation processes. Each detection point requires only a simple magnitude calculation rather than extended correlation computation, enabling efficient energy usage while maintaining detection reliability
3Adaptability or versatility
If multiple repeated preamble symbols are detected using conventional methods, then symbol repetition is handled, but processing time and computational load increase
Solution Approach 1:
The patent merges the detection of multiple repeated preamble symbols into a single unified energy detection process. Instead of performing separate correlation operations for each repetition, the system combines energy measurements from all repetitions by summing the squared magnitudes of DFT coefficients, achieving efficient handling of multiple symbols simultaneously
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
A technique for detecting symbols includes performing an over-sized discrete Fourier transform (DFT) operation on a received signal that includes at least two repeated symbols (704). A sum of energies for subcarriers of one or more possible symbols are determined based on the DFT operation (706). A sum of energies for non-subcarriers of the one or more possible symbols is determined based on the DFT operation (708). Finally, a determination (710) is made as to whether one or more of the one or more possible symbols is detected based on the sum of signal characteristics for the subcarriers and sum of signal characteristics for the non-subcarriers.