@article {15004,
	title = {Optimal Systolic Designs for the Computation of the Discrete Hartley and the Discrete Cosine Transforms},
	year = {1988},
	month = {1988///},
	institution = {Institute for Systems Research, University of Maryland, College Park},
	abstract = {In this paper, we propose new algorithms for computing the Discrete Hartley and the Discrete Cosine Transform. The algorithms are based on iterative applications of the modified small n algorithms of DFT. The one dimensional transforms are mapped into two dimensions first and then implemented on two dimensional systolic arrays. Pipelined bit serial architectures operating on left to right LSB to MSB binary arithmetic is the basis of the hardware design. Different hardware schemes for implementing these transforms are studied. We show that our schemes achieve a substantial speed-up over existing schemes.},
	keywords = {*ALGORITHMS, *BINARY ARITHMETIC, Computer architecture, DCT(DISCRETE COSINE TRANSFORM), DISCRETE FOURIER TRANSFORMS, ITERATIONS, NUMERICAL MATHEMATICS, TWO DIMENSIONAL},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA452389},
	author = {Chakrabarti,Chaitali and JaJa, Joseph F.}
}
