High-performance architecture for digital transform processing
Pages 1336 - 1349
Abstract
The digital transforms are intensive in multiplication and accumulation operations which have a high computational cost. Advances in computer arithmetic and digital technologies allow simplifying the processing of complex algorithms when they are implemented in modern circuits. New computation techniques can be explored to provide efficient operational methods for implementing algorithms that avoid much of the complex and costly mathematical operations. This work aims to design a high-performance architecture for computing some common digital transforms. The proposed architecture has been compared to other methods. The transform used as example in this work is the discrete cosine transform. The results show that the proposal offers high-performance results comparable or better than best-known methods.
References
[1]
Mora H, Signes-Pont MT, Azorín-López J, Corral Sánchez L (2015) High-speed architecture for direct computation of DCT In: International Conference on systems, control, signal processing and informatics, pp 176---183
[2]
Sungwook Y, Swartziander EE (2001) DCT implementation with distributed arithmetic. IEEE Trans Comput 50(9):985---991.
[3]
Shams AM, Chidanandan A, Pan A, Bayoumi MA (2006) NEDA: a low-power high-performance DCT architecture. IEEE Trans Signal Process 54(3):955---964.
[4]
Sharma VK, Mahapatra KK, Pati UC (2011) An efficient distributed arithmetic based VLSI architecture for DCT. In: International conference on devices and communications, pp 1---5.
[5]
Bernabé G, Hernández R, Acacio ME (2016) Parallel implementations of the 3D fast wavelet transform on a Raspberry Pi 2 cluster. J Supercomput.
[6]
Chen WH, Smith C, Fralick S (1977) A fast computational algorithm for the Discrete Cosine Transform. IEEE Trans Commun 25(9):1004---1009.
[7]
Vetterli M, Kovacevic J (2013) Wavelets and subband coding. CreateSpace Independent Publishing Platform. ISBN: 978-1484886991
[8]
Loeffler C, Lightenberg A, Moschytz GS (1989) Practical fast 1-D DCT algorithms with 11-multiplications. Proc of ICASSP Glagow 2:988---991.
[9]
El Aakif M, Belkouch S, Chabini N, Hassani MM (2011) Low power and fast DCT architecture using multiplier-less method. Faible Tension Faible Consomm.
[10]
Liang J, Tran TD (2001) Fast multiplierless approximations of the DCT with the lifting scheme. IEEE Trans Signal Process 49(12):3032---3044.
[11]
Huang H, Xiao L (2013) CORDIC based fast Radix-2 DCT algorithm. IEEE Signal Process Lett 20(5):483---486.
[12]
Ghodhbani R, Saidani T, Horrigue L et al (2017) An efficient pass-parallel architecture for embedded block coder in JPEG 2000. Real-Time Image Proc.
[13]
Signes MT et al (2009) Improvement of the Discrete Cosine Transform calculation by means of a recursive method. Math Comput Model 50:750---764.
[14]
Xie J, Meher PK, He J (2013) Hardware-efficient realization of prime-length DCT based on distributed arithmetic. IEEE Trans Comput 62(6):1170---1178.
[15]
Coutinho VA et al (2016) A multiplierless pruned DCT-like transformation for image and video compression that requires ten additions only. J Real-Time Image Process 12(2):247---255.
[16]
Revathi KG, Reeja Malar J (2016) Efficient diagonal data mapping for large size 2D DCT/IDCT using single port SRAM based transpose memory. Conf Electr Electron Optim Tech, Int.
[17]
ISO/IEC (1994) Information technology-digital compression and coding of continuous-tone still images-requirements and guidelines. ISO 81: 09-92, 1994
[18]
Mora-Mora H, Mora-Pascual J, Sánchez-Romero JL, García-Chamizo JM (2008) Partial product reduction by using look-up tables for M × N multiplier. Integr VLSI J 41(4):557---571.
[19]
Tanaka Y (2016) Efficient signed-digit-to-canonical-signed-digit recoding circuits. Microelectron J 57:21---25.
[20]
Mora H et al (2017) Mathematical model and implementation of rational processing. J Comput Appl Math 309:575---586.
[21]
Ghasemzadeh M, Mahdavi S, Zokaei A, Hadidi K (2016) A new ultra high speed 5-2 compressor with a new structure. In: International conference on mixed design of integrated circuits and systems, pp 151---154.
[22]
Mora H et al (2010) Mathematical model of stored logic based computation. Math Comput Model 52(7---8):1243---1250.
[23]
IEEE Std. 1180-1990 (1990) IEEE standard specification for the implementation of 8 × 8 inverse cosine transform. Institute of Electrical and Electronics Engineers, International Standard, New York, USA
[24]
Joshi A et al (2017) A comparative performance analysis of various CMOS design techniques for XOR and XNOR circuits. Int J Res Appl Sci Eng.
[25]
Bernardi P, Restifo M, Sánchez E, Sonza Reorda M (2017) On the in-field test of embedded memories. International symposium on on-line testing and robust system design (IOLTS).
Index Terms
- High-performance architecture for digital transform processing
Index terms have been assigned to the content through auto-classification.
Recommendations
Efficient VLSI architecture of 3D discrete transformation
AbstractDiscrete transforms are used in many signal processing applications such as audio compression, image compression, video compression, high efficiency video coding (HEVC), and so on. This paper proposes a generic VLSI architecture for ...
Highlights- This paper proposes an architecture for various (N×N×N)-point discrete transforms.
Fourier Transform Computers Using CORDIC Iterations
The CORDIC iteration is applied to several Fourier transform algorithms. The number of operations is found as a function of transform method and radix representation. Using these representations, several hardware configurations are examined for cost, ...
Fast architecture for decimal digit multiplication
BCD digit multiplication module (BDM) is widely used in BCD arithmetic, especially in Decimal Floating-Point (DFP) units. In this paper, we present a new BCD digit multiplication scheme to accelerate this module. Similar to previous articles, our ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Copyright © 2019 Springer Science+Business Media, LLC, part of Springer Nature.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 March 2019
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025