Skip to main content
SpringerLink
Log in

Efficient Implementation of 2-D FCT with Reduced Memory Access for Programmable DSPs

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

In this paper, we present a novel memory access reduction scheme (MARS) for two-dimension fast cosine transform (2-D FCT). It targets programmable DSPs with high memory-access latency. It reduces the number of memory accesses by: 1) reducing the number of weighting factors and 2) combining butterflies in vector-radix 2-D FCT pruning diagram from two stages to one stage with an efficient structure. Hardware platform based on general purpose processor is used to verify the effectiveness of the proposed method for vector-radix 2-D FCT pruning implementation. Experimental results validate the benefits of the proposed method with reduced memory access, less clock cycle and fewer memory space compared with the conventional implementation.

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

Figure 1
Figure 2
Figure 3

Similar content being viewed by others

References

  1. Ahmed, N., et al. (1974). Discrete cosine transfom. IEEE Transactions on Computers, C-23, 90–93.

    Article  Google Scholar 

  2. Pennebaker, W., & Mitchell, J. (1993). JPEG still image data compression standard. Boston: Kluwer Academic Publishers.

    Google Scholar 

  3. Mitchell, J. (1997). MPEG video compression standard. Boston: Kluwer Academic Publishers.

    Book  Google Scholar 

  4. Oizumi, M. (2006). Preprocessing method for DCT-based image-compression. IEEE Transactions on Consumer Electronics, 52, 1021–1026.

    Article  Google Scholar 

  5. Wang, C., et al. (2003). A DCT-based MPEG-2 transparent scrambling algorithm. IEEE Transactions on Consumer Electronics, 49, 1208–1213.

    Article  Google Scholar 

  6. Rao, K., & Yip, P. (1990). Discrete cosine transform: algorithms, advantages, applications vol. 4. London: Academic.

    Book  Google Scholar 

  7. M. Wezelenburg, "General radix 2 DCT and DST algorithms," in Proceedings of the International Conference on ECCTD'97, Budapest, Hungary, 1997, pp. 789–794.

  8. Chan, Y.-H., & Siu, W.-C. (1993). Mixed-radix discrete cosine transform. IEEE Transactions on Signal Processing, 41, 3157–3161.

    Article  Google Scholar 

  9. Tatsaki, A., et al. (1995). Prime-factor DCT algorithms. IEEE Transactions on Signal Processing, 43, 772–776.

    Article  Google Scholar 

  10. Wu, Z., et al. (2009). An improved scaled DCT architecture. IEEE Transactions on Consumer Electronics, 55, 685–689.

    Article  Google Scholar 

  11. W. Yuan, et al., "Matrix Factorization for Fast DCT Algorithms," in 2006 I.E. International Conference on Acoustics, Speech and Signal Processing, 2006, pp. 948–951.

  12. Hsu, H., & Liu, C. (2008). Fast radix-q and mixed-radix algorithms for type-IV DCT, IEEE Signal Processing Letters, 15, 910–913.

    Article  Google Scholar 

  13. Park, J., & Roy, K. (2008). A low complexity reconfigurable DCT Architecture to trade off image quality for power consumption. Journal of Signal Processing Systems, 53, 399–410.

    Article  Google Scholar 

  14. A. Prasoon and K. Rajan, "4× 4 2-D DCT for H. 264/AVC," in International Conference on Advances in Computing, Communication and Control (ICAC3), 2009, pp. 573–577.

  15. Makhoul, J. (1980). A fast cosine transform in one and two dimensions. IEEE Transactions on Acoustics, Speech and Signal Processing, 28, 27–34.

    Article  MATH  Google Scholar 

  16. Chan, S., & Ho, K. (1991). A new two-dimensional fast cosine transform algorithm. IEEE Transactions on Signal Processing, 39, 481–485.

    Article  MATH  Google Scholar 

  17. Feig, E., & Winograd, S. (1992). On the multiplicative complexity of discrete cosine transforms. IEEE Transactions on Information Theory, 38, 1387–1391.

    Article  MATH  MathSciNet  Google Scholar 

  18. Christopoulos, C., et al. (1995). The vector-radix fast cosine transform: Pruning and complexity analysis. Signal Processing, 43, 197–205.

    Article  MATH  Google Scholar 

  19. S. An and C. Wang, "A recursive algorithm for 2-D DCT," in International Symposium on Signal, Systems and Electronics, 2007, pp. 335–338.

  20. M. Tian, et al., "A new fast algorithm for 8× 8 2-D DCT and its VLSI implementation," in IEEE International Workshop on VLSI Design and Video Technology, 2005, pp. 179–182.

  21. Ramaswamy, S. V., & Miller, G. D. (1993). Multiprocessor DSP architectures that implement the FCT based JPEG still picture image compression algorithm with arithmetic coding. IEEE Transactions on Consumer Electronics, 39, 1–5.

    Article  Google Scholar 

  22. X. Liu, "Memory access reduction method for efficient implementation of fast cosine transform Pruning on DSP," in Acoustics Speech and Signal Processing (ICASSP), 2010 I.E. International Conference on, 2010, pp. 1490–1493.

  23. Skodras, A. N., & Constantinides, A. G. (1991). Efficient input-reordering algorithms for fast DCT. Electronics Letters, 27, 1973–1975.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Anhui Normal University, Wuhu, China

    Xiangyang Liu

  2. Mobile and Wireless Group, Broadcom Corporation, Matawan, NJ, USA

    Hua Bao

Authors
  1. Xiangyang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hua Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hua Bao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, X., Bao, H. Efficient Implementation of 2-D FCT with Reduced Memory Access for Programmable DSPs. J Sign Process Syst 80, 153–161 (2015). https://doi.org/10.1007/s11265-013-0851-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-013-0851-2

Keywords

Search

Navigation