Computational Methods for Real-time Adaptive Multichannel Signal ProcessingCornell University, 1995 - 172 pages |
From inside the book
Results 1-3 of 22
Page
... Furthermore , these operations must be performed in real - time . Often , these factors stretch the computing abilities of conventional signal processors to their limits . In this thesis , we present computational methods for ...
... Furthermore , these operations must be performed in real - time . Often , these factors stretch the computing abilities of conventional signal processors to their limits . In this thesis , we present computational methods for ...
Page 82
... Furthermore , they preserve the signal eigenstructure ; thus they can be used in a broad range of signal processing applications from DOA estimation to beamforming and least squares . Our algorithms combine low computational complexity ...
... Furthermore , they preserve the signal eigenstructure ; thus they can be used in a broad range of signal processing applications from DOA estimation to beamforming and least squares . Our algorithms combine low computational complexity ...
Page 99
... Furthermore , when interprocessor communication is to be used , we favor a few large messages rather that many small ones in order to reduce the cost of startup latency . With this in mind , let us consider the cost of FST : 16 Nr + ...
... Furthermore , when interprocessor communication is to be used , we favor a few large messages rather that many small ones in order to reduce the cost of startup latency . With this in mind , let us consider the cost of FST : 16 Nr + ...
Contents
Introduction | 7 |
Subspace Tracking Mapped onto Parallel Architectures | 9 |
Review of Multisensor Processing and Parallel Mapping | 16 |
Copyright | |
3 other sections not shown
Common terms and phrases
adaptive sensor array bearing estimation Cell Definition column comm comm complexity Computers & Applications Concurrent Computers condition estimator Conference on Hypercube convergence correlation matrix cost functions Dependence Graph DOA estimate dominant subspace double precision eigenvalues execution flops Graph for Stage hardware Householder transformation hypercube Hypercube Concurrent Computers IEEE Transactions Intel iPSC/860 Intel Paragon iWarp linear least squares linear speedup Mapping algorithms Minimax multiprocessors node processor noise subspace Number of Processors O(Nr operations optimization orthonormal parallel parameters performance plane rotations power domain Principal Angles QR factorization Rank Adaptive FST rank increase rank revealing real-time recursive least squares refinement step require resulting RO-FST sensor array processing shown in Figure signal eigenstructure signal flow graph Signal Processing signal subspace simulated annealing singular value decomposition singular values snapshot Speech and Signal subgraph subspace tracking algorithms tasks techniques TQR-SVD Transactions on Acoustics uniform linear array update vector wavefront