1 |
J. Moon and L. R. Carley, 'Efficient sequence detection for intersymbol interference channels with run-length constraints," IEEE Trans. Commun., vol. 42, no. 9, pp. 2654-2660, Sept. 1994.
DOI
ScienceOn
|
2 |
A. M. Patel, "A new digital signal processing channel for data storage products," IEEE Trans. Magn., vol. 27, no. 6, pp. 4579-4584, Nov. 1991.
DOI
ScienceOn
|
3 |
J. G. Kenny and L. R. Carley, "Geometric representation of the tree-search detector," Proc. ICC, June 1992, pp. 115-119.
|
4 |
B. Brickner and J. Moon, "Architectures for the implementation of a fixed delay tree search detector," IEEE Trans. Magn., vol. 33, no. 2, March 1997.
|
5 |
F. Aurenhammer, "Voronoi diagrams - A survey of a fundamental geometric data structure," ACM Computing Surveys, vol. 23, no. 3, pp. 345-405, Sept. 1983.
DOI
|
6 |
R. W. Wood, "New detector for 1,k codes equalized to class II partial response," IEEE Trans. Magn.}, vol. MAG-25, pp. 4075-4077, Sept. 1989.
|
7 |
G. Forney, Jr., "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Info. Theory, vol. 18, no. 3, pp. 363-378, May. 1972.
DOI
|