@conference {
	title = {VLSI Architectures for Orthonormal Wavelets Without Multipliers},
	author = {Frantzeskakis, Emmanuel., Baras, John S.},
	year = {1993},
	month = {11/1993},
	abstract = {The Discrete Wavelet Transform (DWT) is proving to be a highly effective tool in progressive coding of audio and video data. Due to the advances in ISDN network and high definition television (HDTV) technology, a high speed computation of the DWT has become very desirable. Since the algorithmic implementations on programmable DSP chips can not match the high throughput requirements of these applications, the use of Specialized VLSI designs has emerged. The wavelet transform can be implemented by a tree structured digital filter bank. In particular, for an orthogonal wavelet basis this filter bank exhibits the para unitarity property, thus it can be realized by using the Givens rotation as the basic building block. A complete parameterization for this class of Systems is known.

In this paper, we consider the architectural implementation of the DWT that is associated with an Orthonormal wavelet basis. We discuss the trade-offs involved in the use of distributed arithmetic and CORDIC processors for the implementation of the Givens rotation. The resulted circuits are modular, regular and they require only local communication. Furthermore, they involve only adders and ROM lookup tables and no multipliers. Consequently, they are very appropriate for VLSI implementation. The question of the on-line adaptation of the parameters of the circuit is also addressed. This feature is very important in adaptive signal processing applications. Although our discussion is focused on the one dimensional dyadic DWT, Our conclusions are projected to the M-band orthonormal wavelets and the two-dimensional DWT with quincunx subsampling.},
	address = {Pacific Grove, California},
	booktitle = {The 27th Annual Asilomar Conference on Signals, Systems and Computers}
}
@conference {
	title = {Efficient Organization of Large Ship Radar Databases Using Wavelets and Structured Vector Quantization},
	author = {Baras, John S., Wolk, Sheldon I.},
	year = {1993},
	month = {11/1993},
	abstract = {We investigate the problem of efficient representations of large databases of pulsed radar returns froTn naval vessels in order to economize memory and minimize search time. We use synthetic radar returns from ships as the experimental data. The results extend to real ISAR returns. We develop a novel algorithm for organizing the database, which utilizes a ~multiresolution wavelet representation working in synergy with a Tree Structured Vector Quantizer (TSWQ), utilized in its clustering mode. The tree Structure is induced by the multiresolution decomposition of the pulses. The TSVQ design algorithm is of the "greedy" type.~Our experiments todate indicate that the combined algorithm results in orders of magnitude faster data search time, with negligible performance degradation from the full search vector quantization. The combined algorithm provides an efficient indexing scheme (with respect to variations in aspect, elevation and pulse width) for radar data which can facilitate the development of ATR, surveillance and multi-sensor fusion systems.},
	address = {Pacific Grove, California},
	booktitle = {The 27th Annual Asilomar Conference on Signals, Systems and Computers},
	pages = {pp. 491-498}
}
