Low-complexity FFT structures for OFDM transceivers

Murphy, C.D.

doi:10.1109/tcomm.2002.806525

Cited by 18 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4] the author first presented the idea of pruning useless dataflow in FFTs. Later on, the theoretical aspects of PFFT had been extensively studied in different application contexts [1][2] [4][5][6][7][8][9][10][11]. In [9] the frequency-shift property is used to increase complexity-reduction.…”

Section: Related Workmentioning

confidence: 99%

“…In this paper we focus on output-pruning because it is important for modern wireless baseband [2] [1].…”

Section: Generic Multi-phase Software-pipelined Pfft On Ilp Archmentioning

confidence: 99%

“…However, in many real-life applications this is not the case. Long lists of examples can be found in the references of this paper [1][2] [4][5][6][7][8][9][10][11]. These partial output/input cases are extraordinarily important for the future wireless systems [1], such as the OFDMA (Orthogonal Frequency Division Multiplexing Access) and cognitive radio [2].…”

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, although the research of the PFFT can be traced back to 1971 [4] and the theoretical aspects of the PFFT have been thoroughly studied in the last three decades [1][2] [4][5][6][7][8][9][10][11], there were not many breakthroughs in the implementation. We find very few papers about the PFFT in real-life systems.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Generic Multi-Phase Software-Pipelined Partial-FFT on Instruction-Level-Parallel Architectures and SDR Baseband Applications

Li¹,

Novo²,

Bougard³

et al. 2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

The PFFT (Partial FFT) is an extended FFT where only part of input or output bins are used. By pruning the useless dataflow, the PFFT can potentially achieve a significant speedup in many important applications. Although theoretical aspects of the PFFT have been thoroughly studied in past three decades, efficient implementations were rarely reported. The most important obstacle is the highly irregular dataflow and the associated control flow. In addition, a size-N PFFT has 2 N dataflow possibilities, so that delivering both flexibility and efficiency in the same implementation is very challenging. This paper presents a generic scheme to map the highly irregular dataflow of arbitrary PFFT onto ILP architectures with highly efficient SWP (SoftWare-Pipelining). Constraints and opportunities of algorithms and architecture are carefully analyzed and exploited. We introduce a multi-phase partitioning, bringing heterogeneous control structures and heterogeneous software pipelining schemes to minimize control overheads and to maximize the efficiency of SWP. The proposal has been tested with 10 representative benchmarks extracted from baseband applications. In experiments cycle-counts, instructions, NOPs, L1D/L1P access/miss/hit are thoroughly analyzed. Comparing to full FFTs with efficient SWP, our work reduces 20.5% -87.5% cycle-counts, 11.2% -86.5% instructions, 16.1% -79.4% L1D cache accesses and 19.5% -87.1% L1P cache accesses. To the best of our knowledge, this is the first reported work about the generic software-pipelined PFFT on ILP architectures.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In this paper we focus on output-pruning because it is important for modern wireless baseband [2] [1].…”

Section: Generic Multi-phase Software-pipelined Pfft On Ilp Archmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Generic Multi-Phase Software-Pipelined Partial-FFT on Instruction-Level-Parallel Architectures and SDR Baseband Applications

Li¹,

Novo²,

Bougard³

et al. 2008

2008 Design, Automation and Test in Europe

View full text Add to dashboard Cite

show abstract

“…Most applications entail redundant block transmissions and enable efficient block processes to counteract the adverse channel effects, by inserting guard intervals with cyclic prefix (CP) [4]- [6] or zero padding (ZP) [7] between transmission blocks containing the useful data. Since the block processes can be practically implemented using the fast Fourier transform (FFT) algorithms [8], several applications have adopted a large number of multiplexed subcarriers (sometimes, hundreds) for embodying OFDM so that the above prevailing features are exploited to a large extent.…”

Section: Introductionmentioning

confidence: 99%