article · 1997
Asynchronous transpose-matrix architectures
Cited by 1Abstract and details only
Abstract
The matrix transposition operation is a necessary step in several image/video compression and decompression algorithms, in particular the discrete cosine transform (DCT) and its inverse (IDCT), and some distributed arithmetic applications. These algorithms have to be performed at high data-rates, and with a minimum of power dissipation for portable applications. The authors describe how the clocked solution is usually implemented, and present two new asynchronous architectures that perform matrix transposition. These architectures, one based on two phase signaling, one based on four phase signaling, have better characteristics than the clocked solution in terms of latency and power, at no cost in area or throughput. They discuss the characteristics of these three architectures and evaluate the relative advantages of each one.
Cite this paper
Tierno, J., & Kudva, P. (1997). Asynchronous transpose-matrix architectures. https://doi.org/10.1109/iccd.1997.628904
Tierno, J., and Prabhakar Kudva. “Asynchronous transpose-matrix architectures.” 1997, pp. 423–28, https://doi.org/10.1109/iccd.1997.628904.
Tierno, J., and Prabhakar Kudva. 1997. “Asynchronous transpose-matrix architectures.” https://doi.org/10.1109/iccd.1997.628904.
Tierno, J. and Kudva, P. (1997) ‘Asynchronous transpose-matrix architectures’. Available at: https://doi.org/10.1109/iccd.1997.628904.
@article{tierno1997asynchronous,
title = {{Asynchronous transpose-matrix architectures}},
author = {Tierno, J. and Kudva, Prabhakar},
pages = {423--428},
year = {1997},
doi = {10.1109/iccd.1997.628904}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.