Ultrahigh throughput IFFT/FFT modulation and demodulation method
An ultra-high throughput, modulation and demodulation technology, applied in the field of ultra-high throughput IFFT/FFT modulation and demodulation, can solve the problems of long critical path delay, complex power consumption control logic, high power consumption, etc., and achieve area overhead The effect of being small, running frequently, and having a short critical path
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0091] This embodiment provides an ultra-high throughput IFFT / FFT modulation and demodulation method, comprising the following steps:
[0092] Cooley-Tukey FFT process:
[0093] S11. The n-point DFT is defined as:
[0094]
[0095] In the formula, , v is the demodulation input, V is the demodulation output, j is a pure imaginary number, and N represents the length of FFT / IFFT; is the base of the Fourier transform rotation primer; i is the serial number of the time domain signal; k is the serial number of the frequency domain signal;
[0096] S12. For n-point DFT, decompose it into multiple DFT sub-modules, set , introducing the following coefficient substitutions:
[0097]
[0098] S13. After the substitution, use the row-column interleaver to change the order of the output variables, and replace the one-dimensional index with the two-dimensional index:
[0099]
[0100] S14. Bring the coefficient substitution into the original formula, and record get:
[0...
Embodiment 2
[0143] The present embodiment provides a kind of realization method of the FFT / IFFT of incomplete expansion; Provided the realization method of the FFT / IFFT of complete expansion (parallelism is P, every cycle produces a group of conversion results) in embodiment 1, this method The implementation steps include (taking 64-point FFT as an example):
[0144] Determine the factorization of n, 64 = 16 * 4 = 4 * 4 * 4, therefore, the whole module is divided into 3 columns of DFT-4, each column has 16 DFT-4;
[0145] Implement all DFT modules according to the implementation method of DFT-4;
[0146] According to the implementation method of interleaver and complex multiplier, the first two columns of DFT-4 modules are combined into four FFT-16 modules through (4,4) interleaver and complex multiplier.
[0147] When the required throughput is lower than that provided by the fully unrolled FFT / IFFT block, a method is proposed that makes it possible to implement an FFT / IFFT block with a...
Embodiment 3
[0155] When IFFT / FFT is used for modulation and demodulation of a multi-carrier system, the input of IFFT is the expanded conjugate symmetric sequence, and the output is a real sequence; the input of FFT is a real sequence, and the output is a conjugate symmetric sequence.
[0156] For two conjugate symmetric sequences that need to be transformed :
[0157] Preprocessing: Constructing Sequences ;
[0158] Perform IFFT transformation on D to obtain d;
[0159] Post-processing: it is hoped that the Separated from D, since IDFT is a linear transformation, there is ,because Both are real sequences, so the real and imaginary parts of the result can be output separately;
[0160] For real sequence FFT, use the following algorithm to simplify, for two real sequences that need to be transformed :
[0161] Preprocessing: Constructing Sequences ;
[0162] Perform FFT transformation on d to obtain D;
[0163] Post-processing: it is hoped that the Separated from D, the...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



