[CITATION][C] Optimum and adaptive detector arrays (Ph. D. Thesis abstr.)
L Winkler - IEEE Transactions on Information Theory, 1972 - ieeexplore.ieee.org
L Winkler
IEEE Transactions on Information Theory, 1972•ieeexplore.ieee.orgOur second objective is to use the DFT and FFT algorithms to make time domain
equalization computationally more efficient. We show that the number of computations
needed to set a time domain equalizer can be made proportional to M log, M instead of MZ,
where M is the number of adjustable parameters, by use of FFT algorithms. Savings always
ensue for sufficiently large M and grow rapidly thereafter. The breakeven point is
approximately M= 16. We also derive tight and easily obtainable bounds on the eigenvalues …
equalization computationally more efficient. We show that the number of computations
needed to set a time domain equalizer can be made proportional to M log, M instead of MZ,
where M is the number of adjustable parameters, by use of FFT algorithms. Savings always
ensue for sufficiently large M and grow rapidly thereafter. The breakeven point is
approximately M= 16. We also derive tight and easily obtainable bounds on the eigenvalues …
Our second objective is to use the DFT and FFT algorithms to make time domain equalization computationally more efficient. We show that the number of computations needed to set a time domain equalizer can be made proportional to M log, M instead of MZ, where M is the number of adjustable parameters, by use of FFT algorithms. Savings always ensue for sufficiently large M and grow rapidly thereafter. The breakeven point is approximately M= 16. We also derive tight and easily obtainable bounds on the eigenvalues of the time-domain iteration matrix in terms of DFT coefficients. This allows us to increase the speed of convergence.
ieeexplore.ieee.org
Showing the best result for this search. See all results