Skip to main content
SpringerLink
Log in

A novel conflict-free parallel memory access scheme for FFT constant geometry architectures

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In this paper, a parallel conflict-free access scheme for a constant geometry architecture which is unlike the previous schemes is proposed. The proposed method only uses one modular addition operation, and does not involve complicated operations, thus reducing the hardware complexity of address generation. Because of the reduction of the combinational logic which is used to generate the access address, the scheme also reduces the time delay and accordingly improves the executable frequency of fast Fourier transform (FFT) processors. In the scheme, we use an arbitrary radix, i.e., radix-r, to implement the scheme. The scheme is not only applicable to radix-r FFT processors with one butterfly unit, but is also suitable for FFT processors with multiple butterfly units. Because the same architecture is used for every stage of the constant geometry, it can enhance the flexibility of the FFT implementation. Finally, we analyze the resource costs and time delay of the proposed method, and the results verify the advantages of the proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cooley J W, Turkey J W. An algorithm for the machine computation of complex Fourier series. Math Comput, 1965, 19: 297–301

    Article  MATH  Google Scholar 

  2. Thompson C D. Fourier transforms in VLSI. IEEE Trans Comput, 1983, 32: 1047–1057

    Article  MATH  Google Scholar 

  3. Wold E H, Despain A M. Pipeline and parallel-pipeline FFT processors for VLSI implementations. IEEE Trans Comput, 1984, 33: 414–426

    Article  MATH  Google Scholar 

  4. Swartzlander E E, Yong W K W, Joseph S J. A radix 4 delay commutator for fast Fourier transform processor implementation. IEEE J Solid-State Circuit, 1984, 19: 702–709

    Article  Google Scholar 

  5. Zapata E L, Arguello F. A VLSI constant geometry architecture for the fast Hartley and Fourier transforms. IEEE Trans Parallel Distrib Syst, 1992, 3: 58–70

    Article  Google Scholar 

  6. Suter B, Stevens K S. A low power, high performance approach for time-frequency time-scale computations. In: Proceedings of the SPIE Society for Optical Engineering, San Diego, 1998. 86–90

  7. Gorman S F, Wills J M. Partial column FFT pipelines. IEEE Trans Circuits Syst II-Analog Digit Signal Prog, 1995, 42: 414–423

    Article  MATH  Google Scholar 

  8. Reisis D, Vlassopoulos N. Conflict-free parallel memory accessing techniques for FFT architectures. IEEE Trans Circuits Syst I-Regul Pap, 2008, 55: 3438–3437

    Article  MathSciNet  Google Scholar 

  9. Ayinala M, Brown M, Parhi K K. Pipelined parallel FFT architectures via folding transformation. IEEE Trans Very Large Scale Integr (VLSI) Syst, 2012, 20: 1068–1081

    Article  Google Scholar 

  10. Johnson L G. Conflict free memory addressing for dedicated FFT hardware. IEEE Trans Circuits Syst II-Analog Digit Signal Prog, 1992, 39: 312–316

    Article  MATH  Google Scholar 

  11. Yu J Y, Li Y. An efficient conflict-free parallel memory access scheme for dual-butterfly constant geometry radix-2 FFT processor. In: Proceedings of the 9th International Conference on Signal Processing, Beijing, 2008. 458–461

    Google Scholar 

  12. Wang C, Han Y P. Twin butterfly high throughout parallel architecture FFT algorithm. In: International Symposium on Information Science and Engineering, Shanghai, 2008. 637–640

    Google Scholar 

  13. Takala J H, Jarvinen T S, Sorokin H T. Conflict-free parallel memory access scheme for FFT processors. In: Proceeding of International Symposium on Circuits and Systems, Bangkok, 2003. Vol. IV: 524–527

    Google Scholar 

  14. Guan X, Fei Y, Lin H. Hierarchical design of an application-specific instruction set processor for high-throughput and scalable FFT processing. IEEE Trans Very Large Scale Integr (VLSI) Syst, 2012, 20: 551–563

    Article  Google Scholar 

  15. Johnson J R, Johnson RW, Rodriguez D. A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures. Circuits Syst Signal Process, 1990, 9: 449–500

    Article  MathSciNet  MATH  Google Scholar 

  16. Lee S B, Kim D B, Park S C. Power-efficient design of memory-based FFT Processor with new addressing scheme. Commun Inf Technol, 2004, 2: 678–681

    Google Scholar 

  17. Ma Y T. An effective memory addressing scheme for FFT processors. IEEE Trans Signal Process, 1999, 47: 907–911

    Article  Google Scholar 

  18. Su J P, Zhang Y X, Tian J H, et al. A novel spaceborne SAR with-swath imaging approach based on Poisson disk-like nonuniform sampling and compressive sensing. Sci China Inf Sci, 2012, 55: 1876–1887

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Radar Research Laboratory, Beijing Institute of Technology, Beijing, 100081, China

    CuiMei Ma, He Chen & Teng Long

  2. The Electronic Engineering Technology Research Center of China Academy of Space Technology, Beijing, 100094, China

    JiYang Yu

Authors
  1. CuiMei Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. He Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. JiYang Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Teng Long
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to He Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, C., Chen, H., Yu, J. et al. A novel conflict-free parallel memory access scheme for FFT constant geometry architectures. Sci. China Inf. Sci. 56, 1–9 (2013). https://doi.org/10.1007/s11432-013-4826-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-013-4826-5

Keywords

Search

Navigation