Skip to main content

Complexity-constrained LS estimation for sparse systems

Publication ,  Conference
Kocic, M; Brady, D
Published in: IEEE International Symposium on Information Theory - Proceedings
December 1, 1994

The Sparse RLS (SRLS) algorithm, suitable for large-order sparse channels, chooses to update a subset of taps which will minimize the computational complexity of the algorithm given the constraint of maximum allowable increases in Mean Squared Error (MSE). The ability to predict the increase in MSE due to decision to neglect some of the taps is essential for its implementation. To illustrate the principles behind the algorithm, an example is presented by way of an experimental transmission of known data through an unknown shallow-water acoustic channel.

Duke Scholars

Published In

IEEE International Symposium on Information Theory - Proceedings

Publication Date

December 1, 1994
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Kocic, M., & Brady, D. (1994). Complexity-constrained LS estimation for sparse systems. In IEEE International Symposium on Information Theory - Proceedings.
Kocic, M., and D. Brady. “Complexity-constrained LS estimation for sparse systems.” In IEEE International Symposium on Information Theory - Proceedings, 1994.
Kocic M, Brady D. Complexity-constrained LS estimation for sparse systems. In: IEEE International Symposium on Information Theory - Proceedings. 1994.
Kocic, M., and D. Brady. “Complexity-constrained LS estimation for sparse systems.” IEEE International Symposium on Information Theory - Proceedings, 1994.
Kocic M, Brady D. Complexity-constrained LS estimation for sparse systems. IEEE International Symposium on Information Theory - Proceedings. 1994.

Published In

IEEE International Symposium on Information Theory - Proceedings

Publication Date

December 1, 1994