Abstract
A general procedure is developed to implement the fixed delay tree search (FDTS) detector in the multi-dimensional signal space. The procedure systematically finds a required set of hyperplanes that divide the entire space into different decision regions. A Boolean mapping function is also analytically determined which generates a final binary decision from several intermediate binary variables that indicate the position of the observation vector relative to given hyperplanes. The proposed technique is demonstrated on a (1 + D)2 partial response channel driven by the (l,k)-coded input.
| Original language | English |
|---|---|
| Pages (from-to) | 2737-2739 |
| Number of pages | 3 |
| Journal | IEEE Transactions on Magnetics |
| Volume | 33 |
| Issue number | 5 PART 1 |
| DOIs | |
| State | Published - 1997 |