Recursion formulas for growing memory digital filters
- 1 March 1958
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 4 (1) , 24-30
- https://doi.org/10.1109/tit.1958.1057439
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Fixed memory least squares filters using recursion methodsIEEE Transactions on Information Theory, 1957
- An extension of the minimum mean square prediction theory for sampled input signalsIEEE Transactions on Information Theory, 1956
- Applications of Monte CarloPublished by Office of Scientific and Technical Information (OSTI) ,1954
- XXIV.—The General Form of the Orthogonal Polynomials for Simple Series, with Proofs of their Simple PropertiesProceedings of the Royal Society of Edinburgh, 1931