Open Access. Powered by Scholars. Published by Universities.®
Electrical and Computer Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
- Publication
Articles 1 - 2 of 2
Full-Text Articles in Electrical and Computer Engineering
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Signal Flow Graph Approach To Efficient Dst I-Iv Algorithms, Sirani M. Perera
Sirani Mututhanthrige Perera
In this paper, fast and efficient discrete sine transformation (DST) algorithms are presented based on the factorization of sparse, scaled orthogonal, rotation, rotation-reflection, and butterfly matrices. These algorithms are completely recursive and solely based on DST I-IV. The presented algorithms have low arithmetic cost compared to the known fast DST algorithms. Furthermore, the language of signal flow graph representation of digital structures is used to describe these efficient and recursive DST algorithms having (nô€€€1) points signal flow graph for DST-I and n points signal flow graphs for DST II-IV.
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Retrospective Data Filter, Richard J. Prengaman, Robert E. Thurber, Joe Phipps, Ronald I. Greenberg, Wai L. Hom, James F. Jaworski, Guy W. Riffle
Ronald Greenberg
In a target detection communication system, apparatus and method for determining the presence of probable targets based on contacts (which can indicate the presence of a target, noise, chatter, or objects not of interest) detected within a predefined position sector or sectors over a specified number of scans. The position of each detected contact, as a contact of interest, is compared with the positions of contacts detected at previous times or scans. Velocity profiles indicate which previous contacts support the likelihood that the contact of interest represents a target having a velocity within a defined band. The likelihood, which can …