2013 23rd International Conference Radioelektronika (RADIOELEKTRONIKA) 2013
DOI: 10.1109/radioelek.2013.6530920
|View full text |Cite
|
Sign up to set email alerts
|

Low complexity FBMC transceiver for FPGA implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
13
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 9 publications
0
13
0
Order By: Relevance
“…If the poles are located outside the unit circle, the system is not going to be stable, the results will be divergent. If the poles are located inside the unit circle, then the results will converge to zero [5,9].…”
Section: Theory 31 Recursive Discrete Fourier Transformmentioning
confidence: 99%
See 1 more Smart Citation
“…If the poles are located outside the unit circle, the system is not going to be stable, the results will be divergent. If the poles are located inside the unit circle, then the results will converge to zero [5,9].…”
Section: Theory 31 Recursive Discrete Fourier Transformmentioning
confidence: 99%
“…Despite the FFT being the most commonly used algorithm, some solutions, which employ two kinds of R-DFT, have already been presented for wireless communication applications: one based on the Goertzel algorithm [8] and the other one based on the observer theory [9], which is applied in this paper.…”
mentioning
confidence: 99%
“…A significant complexity reduction can be achieved by using two IFFTs and two PolyPhase (PP) filter structures as shown in [3]. Further reduction can be achieved by applying minor additional signal processing to enable the usage of only a single IFFT [4]. Other design proposals also exist for reducing the complexity of FBMC transmitter such as [5], [6] where the number of operations is reduced but it requires modifications to the existing hardware blocks, e.g.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the paper focuses on the application of the Recursive DFT (R-DFT) for signal processing in digital communication, which is a less known structure for calculating the DFT of a signal sequence in a real-time manner [6], [7]. In contrast with the conventional DFT filter structure [8], which can be unstable due to the quantization errors, this method is robust against stability issues.…”
Section: Introductionmentioning
confidence: 99%
“…For wireless communication, especially for Orthogonal Frequency Division Multiplexing (OFDM), the most frequently used solution for spectral analysis and parameter estimation is the Fast Fourier Transform (FFT). Despite the FFT being the most commonly used algorithm, solutions employing the R-DFT have been proposed for wireless communication [7], [9].…”
Section: Introductionmentioning
confidence: 99%