Browse > Article

Signal Space Detection for High Data Rate Channels  

Jeon , Taehyun (Seoul National University of Technology)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.42, no.10, 2005 , pp. 25-30 More about this Journal
Abstract
This paper generalizes the concept of the signal space detection to construct a fixed delay tree search (FDTS) detector which estimates a block of n channel symbols at a time. This technique is applicable to high speed implementation. Two approaches are discussed both of which are based on efficient signal space partitioning. In the first approach, symbol detection is performed based on a multi-class partitioning of the signal space. This approach is a generalization of binary symbol detection based on a two-class pattern classification. In the second approach, binary signal detection is combined with a look-ahead technique, resulting in a highly parallel detector architecture.
Keywords
Fixed selav tree search; signal detection; multi-class partitioning; intersymbol interference;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Avis and B. K. Bhattacharya, 'Algorithm for computing d-dimensional Voronoi diagrams and their duals,' Advances in Computing Research, vol. 1, pp. 159-180, Greenwich, Conn.: JAI press, 1983
2 B. Brickner and J. Moon, 'Low complexity signal space detection for MTR coded channels,' IEEE Trans. Magn., vol. 33, no. 1, pp. , Jan. 1998   DOI   ScienceOn
3 N. K. Bose and A. K Garga, 'Neural network design using Voronoi diagrams,' IEEE Trans. Neural Networks}, vol. 4, no. 5, pp. 778-787, Sept. 1993   DOI   ScienceOn
4 B. Brickner and J. Moon, 'A high dimensional signal space implementation of FDTS/DF,' IEEE Trans. Magn, vol. 32, no. 5, pp. 3941-3943, Sept. 1996   DOI   ScienceOn
5 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