A multiplication-free solution for linear minimum mean-square estimation and equalization using the branch-and-bound principle
暂无分享,去创建一个
[1] Clifford Hildreth,et al. A quadratic programming procedure , 1957 .
[2] William K. Pratt,et al. Generalized Wiener Filtering Computation Techniques , 1972, IEEE Transactions on Computers.
[3] Ali Habibi,et al. Fast Suboptimal Wiener Filtering of Markov Sequences , 1977, IEEE Transactions on Computers.
[4] Saleem A. Kassam,et al. Robust Wiener filters , 1977 .
[5] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[6] Donald W. Tufts,et al. Intersymbol interference and error probability , 1966, IEEE Trans. Inf. Theory.
[7] Kung Yao,et al. Applications of Reproducing Kernel Hilbert Spaces-Bandlimited Signal Models , 1967, Inf. Control..
[8] L. G. Mitten. Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..
[9] Egon Balas,et al. Letter to the Editor - A Note on the Branch-and-Bound Principle , 1968, Oper. Res..
[10] Joel Max,et al. Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.
[11] G. David Forney,et al. Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference , 1972, IEEE Trans. Inf. Theory.
[12] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .
[13] S. Winograd. On the number of multiplications necessary to compute certain functions , 1970 .
[14] A. Jain,et al. A Fast Karhunen-Loeve Transform for a Class of Random Processes , 1976, IEEE Trans. Commun..