@article {15047,
	title = {VLSI architectures for multidimensional transforms},
	journal = {Computers, IEEE Transactions on},
	volume = {40},
	year = {1991},
	month = {1991/09//},
	pages = {1053 - 1057},
	abstract = {The authors propose a family of VLSI architectures with area-time tradeoffs for computing (<e1>N</e1> times;<e1>N</e1> times; . . . times;<e1>N</e1>) <e1>d</e1>-dimensional linear separable transforms. For fixed-precision arithmetic with <e1>b</e1> bits, the architectures have an area <e1>A</e1>=<e1>O</e1>(<e1>N</e1><sup>d+2a</sup>) and computation time <e1>T</e1>=<e1>O</e1>(<e1>dN</e1><sup>d/2-a</sup><e1>b </e1>), and achieve the <e1>AT</e1><sup>2</sup> bound of <e1>AT</e1><sup>2</sup>=<e1>O</e1>(<e1>n</e1><sup>2</sup><e1>b</e1> <sup>2</sup>) for constant <e1>d</e1>, where <e1>n</e1>=<e1>N</e1><sup>d </sup> and <e1>O</e1> lt;<e1>a</e1> les;<e1>d</e1>/2},
	keywords = {architecture;, architectures;, arithmetic;, complexity;, computational, Computer, digital, fixed-precision, linear, multidimensional, separable, transforms;, VLSI},
	isbn = {0018-9340},
	doi = {10.1109/12.83648},
	author = {Chakrabarti,C. and JaJa, Joseph F.}
}
