Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fastest linearly independent arithmetic transforms and their calculation on systolic array processors

Fastest linearly independent arithmetic transforms and their calculation on systolic array processors

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Circuits, Devices & Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

Fastest linearly independent arithmetic (LIA) transforms have computational costs that are lower than that of the standard arithmetic transform. They also possess fast direct and inverse transforms that enable their efficient calculation using fast transform and make them suitable for systolic array implementation. Calculation of fastest LIA transform spectral coefficients by systolic array processor is described here. New fastest LIA transforms are introduced and various properties that are relevant to the fastest LIA transform spectra calculation are presented. General steps for deriving the linear systolic array structures are listed and examples are given for several previous and new fastest LIA transforms. It is shown that the number of linear systolic array structures required for obtaining the best fastest LIA transform is smaller than the number of all possible fastest LIA transforms. Experimental results for the fastest LIA transforms are also shown and compared with the standard arithmetic transform. The comparison shows that the fastest LIA transforms have smaller numbers of non-zero spectral coefficients for many binary functions.

Inspec keywords: logic testing; logic design; digital arithmetic; systolic arrays; transforms

Other keywords: systolic array processors; fastest linearly independent arithmetic transforms; spectral coefficients; linear systolic array structures; fast transform; fast direct transforms; binary logic circuits; inverse transforms

Subjects: Integral transforms; Integral transforms; Digital arithmetic methods; Digital circuit design, modelling and testing; Logic circuits; Logic design methods

References

    1. 1)
      • S. Rahardja , B.J. Falkowski . Application of linearly independent arithmetic transform in testing of digital circuits. Electon. Lett. , 5 , 363 - 364
    2. 2)
    3. 3)
      • Falkowski, B.J., Rahardja, S.: `Boolean verification with fastest LIA transforms', Proc. 35th IEEE Int. Symp. Circuits Syst., May 2002, Phoenix, AZ, p. 321–324.
    4. 4)
      • A. Al-Rabadi . (2004) Reversible logic synthesis: from fundamentals to quantum computing.
    5. 5)
      • R.S. Stankovic , M.R. Stojic , M.S. Stankovic . (1996) Recent developments in abstract harmonic analysis with applications in signal processing.
    6. 6)
      • S.N. Yanushkevich . (1998) Logic differential calculus in multi-valued logic design.
    7. 7)
      • T.H. Chen . (1992) Fault diagnosis and fault tolerance: systematic approach to special topics.
    8. 8)
      • T. Sasao , M. Fujita . (1996) Representations of discrete functions.
    9. 9)
      • S. Agaian , J. Astola , K. Egiazarian . (1995) Binary polynomial transforms and nonlinear digital filters.
    10. 10)
      • J.T. Astola , R.S. Stankovic . (2006) Fundamentals of switching theory and logic design: a hands on approach.
    11. 11)
      • Falkowski, B.J., Lozano, C.C.: `Properties of fastest LIA transform matrices and their spectra', Proc. 36th IEEE Int. Symp. Circuits Syst., May 2003, Bangkok, Thailand, p. 556–559.
    12. 12)
      • Falkowski, B.J., Lozano, C.C., Rahardja, S.: `Generalized fastest linearly independent arithmetic transforms', Proc. 38th IEEE Int. Symp. Circuits Syst., May 2005, Kobe, Japan, p. 480–483.
    13. 13)
      • V.D. Malyugin . (1997) Paralleled calculation by means of arithmetic polynomials.
    14. 14)
      • R.S. Stankovic , T. Sasao . A discussion on the history of research in arithmetic and Reed-Muller expressions. IEEE Trans. Comput. Aided Des. , 9 , 1177 - 1179
    15. 15)
      • S. Chattopadhyay , S. Roy , P. Chaudhuri . KGPMAP: library based technology mapping technique for antifuse based FPGAs. IEE Proc., Comput. Digit. Tech. , 6 , 361 - 368
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • B.J. Falkowski , C.H. Chang . Properties and methods of calculating generalized arithmetic and adding transforms. IEE Proc., Circuits Devices Syst. , 5 , 249 - 258
    20. 20)
    21. 21)
      • S.L. Hurst . (1992) Custom VLSI microelectronics.
    22. 22)
      • T. Sasao . (1999) Switching theory for logic synthesis.
    23. 23)
    24. 24)
    25. 25)
    26. 26)
      • Y.T. Lai , M. Pedram , S.B.K. Vrudhula . EVBDD-based algorithms for integer linear programming, spectral transformation, and functional decomposition. IEEE Trans. Comput. Aided Des. , 8 , 959 - 975
    27. 27)
      • R.S. Stankovic , J.T. Astola . (2003) Spectral interpretation of decision diagrams.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cds_20060263
Loading

Related content

content/journals/10.1049/iet-cds_20060263
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address