On computing the 2-D modulated lapped transform in real-time [and VLSI implementation]

Frantzekakis, E.; Karathanasis, H.C.

doi:10.1109/vlsisp.1993.404470

Cited by 4 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Based on these properties, one can develop a time-recursive architectural implementation for a given operator in a routine way. See, for example, [12], [13]. Here, we briefly interpret the results presented in [12] regarding the modulated lapped transform (MLT) [24], [26], oftentimes referred in the data coding community as modified DCT (MDCT) [17].…”

Section: Introductionmentioning

confidence: 88%

“…An alternative approach to the problem of designing the IIR architecture is based on the defining equation of X,(t) (3) and the difference equation property of the kernel group introduced in Subsection III-F. In more concrete terms, we can compute the 2 transform of a kernel function fp(n) based on the difference equation (13) and then calculate the transfer function of the system specified by (3). The following lemmas describe how we can obtain the desired transfer function if we are specified the difference equation parameters.…”

Section: Iir Architecture Bused On Difference Equation Properlymentioning

confidence: 99%

“…Finally, as a direct consequence of Lemma 4.5 we have the following corollary. 1) The Mth-order difference equation (13).…”

Section: Iir Architecture Bused On Difference Equation Properlymentioning

confidence: 99%

“…Thus far, we have discussed the procedure for computing the transfer function that is associated to a given kernel group. We have shown how this transfer function is determined from two different starting points: the matrix difference equation (2) and the scalar difference equation (13). In the sequel, we will consider the implementation of the associated mapping operator, which is the goal of our construction.…”

Section: E Iir Architecture Design For Mapping Operatorsmentioning

confidence: 99%

See 3 more Smart Citations

Time-recursive computation and real-time parallel architectures: a framework

Frantzeskakis

Baras

Liu

1995

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

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 clonsider 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 implementatioin complexity for the aforementioned modules is conducted. Based on this framework, the time-recursive architecture of a given h e a r operator can be derived in a systematic routine way. Since 1991, he has been the Director of the Center for Satellite and Hybrid Communication Networks, a NASA Center for the Commercial Development of Space, which he co-founded. He has numerous publications in control and communication systems, and is the co-editor of Recent Progress in Stochastic Calculus (Spnnger-Verlag, 1990). His current research interests include stochastic systems and signal processing and understandmg with emphasis on speech and image signals, real-time architectures, symbolic computation, intelligent control systems, robust nonlinear control, dxtributed parameter systems, hybnd communication network simulahon and management.

show abstract

Section: Introductionmentioning

confidence: 88%

Section: Iir Architecture Bused On Difference Equation Properlymentioning

confidence: 99%

“…Finally, as a direct consequence of Lemma 4.5 we have the following corollary. 1) The Mth-order difference equation (13).…”

Section: Iir Architecture Bused On Difference Equation Properlymentioning

confidence: 99%

Section: E Iir Architecture Design For Mapping Operatorsmentioning

confidence: 99%

See 2 more Smart Citations

Time-recursive computation and real-time parallel architectures: a framework

Frantzeskakis

Baras

Liu

1995

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…In summary, the computational complexity of the proposed 2-D MDCT algorithm is given by The time-recursive algorithm presented in [47] belonging to the recursive algorithm, is not efficient in terms of arithmetic complexity, but its regressive structure provides an efficient scheme for the parallel VLSI implementation [9]. For this reason, we compare only our algorithms with the traditional row-column method whose computational complexity is given by…”

Section: ) Mn/2-m-n Additions For (45)-(48)mentioning

confidence: 99%