@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 = {An Architectural Framework for Parallel Time-Recursive Computation},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {10/1993},
	abstract = {The time-recursive computation model has been proven particularly useful for the real-time evaluation of one and two-dimensional block transforms. Unlike the FFT based architectures, time-recursive ones require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism.

In this paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We specify the properties of the linear operators that can be implemented efficiently in a time-recursive way. Based on these properties, we develop a routine that produces a time-recursive architectural implementation for a given operator. This routine is instructive for the design of a CAD tool that will facilitate the derivation of time-recursive architectures. The design of architectures for the Discrete Cosine Transform and the Modulated Lapped Transform based on this routine is reported.},
	address = {Athens, Greece},
	booktitle = {The 4th Conference on Informatics , organized by the Greek Computer Society},
	pages = {pp. 1-12}
}
@conference {
	title = {Time-Recursive Computation and Real-Time Parallel Architectures, with Application on the Modulated Lapped Transform},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {07/1993},
	abstract = {The time-recursive computation has been proved particularly useful for the real-time evaluation of one and two-dimensional block transforms. Unlike the FFT based ones, time-recursive architectures require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism.

In this paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We specify the properties of the linear operators that can be implemented efficiently in a time-recursive way. Based on these properties, we develop a routine that produces a time-recursive architectural implementation for a given operator. This routine is instructive for the design of a CAD tool that will facilitate the architecture derivation.

Using this background, we design an architecture for the Modulated Lapped Transform (commonly called Modified Discrete Cosine Transform), which has linear cost in operator counts.},
	address = {San Diego, California},
	booktitle = {The 1993 SPIE International Symposium on Optical Science and Engineering},
	pages = {pp. 100-111}
}
@conference {
	title = {Time-Recursive Architectures and Wavelet Transform},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {04/1993},
	abstract = {The time-recursive computation has been proved as a particularly useful tool in real-time data compression and in transform domain adaptive filtering, with applications in the areas of audio, radar, sonar and video. Unlike the FFT based ones, the time-recursive architectures require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism. In this paper, we propose an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We define a shift property of the linear operators and reveal its relation with the time-recursive implementation. We demonstrate the potential of the proposed framework by designing a time-recursive architecture for the Discrete Wavelet Transform.},
	address = {Minneapolis, Minnesota},
	booktitle = {The 1993 International Conference on Acoustics, Speech and Signal Processing},
	pages = {pp. I-445 - I-448}
}
@conference {
	title = {A Bayesian Matching Technique for Detecting Simple Objects in Heavily Noisy Environment},
	author = {Baras, John S., Frantzeskakis, Emmanuel.},
	year = {1991},
	month = {07/1991},
	abstract = {The template matching problem for binary corrupted images with spatially white, binary, symmetric noise is studies. We compare matching based directly on the pixel-value image data as well as data coded by two simple schemes: a modification of the Hadamard~basis and direct coarsening of resolution. Bayesian matching rules based on M-ary~hypothesis are developed. The performance evaluation of these rules is provided,

The paper presents a study of the trade-off between the quantization level and the ability of detecting an object in an image. This trade-off depends on the (external) noise generated at the moment we receive the uncoded image.

The sum-of pixels and the histogram statistics are introduced in order to reduce the computational load inherent in the correlation statistic, with the resulting penalty of a higher probability~of false alarm rate.

In the present work~we demonstrate by examples that it is beneficial for recognition to combine an image coding technique with an algorithm extracting some "basic" information from the image. In other words~coding (for compression) helps recognition. Numerical results illustrate this claim.},
	address = {San Diego, California},
	booktitle = {SPIE 1991 International Symposium on Stochastic and Neural Methods in Signal Processing, Image Processing, and Computer Vision},
	pages = {pp. 341-353}
}
@article {
	title = {Time-Recursive Computation and Real-Time Parallel Architectures:~A Framework},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1995},
	month = {11/1995},
	abstract = {The time-recursive computation has been proven a particularly useful tool in real-time data compression, in transform domain adaptive filtering, and in spectrum analysis. Unlike the FFT-based ones, the time-recursive architectures require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow a high degree of parallelism. In this two-part paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We show that the structure of the realization of a given linear operator is dictated by the decomposition of the latter with respect to proper basis functions. An optimal way for carrying out this decomposition is demonstrated. The parametric forms of the basis functions are identified and their properties pertinent to the architecture design are studied. A library of architectural building modules capable of realizing these functions is developed. An analysis of the implementation complexity for the aforementioned modules is conducted. Based on this framework, the time-recursive architecture of a given linear operator can be derived in a systematic routine way.},
	pages = {pp. 2762-2775},
	volume = {Vol. 43},
	number = {No. 11},
	journal = {IEEE Transactions on Signal Processing}
}
