Abstract
This paper considers the detection of data from a parallel multi-track magnetic recording medium in the presence of severe adjacent track interference. In this case, the complexity of a full maximum likelihood detector is prohibitive even for modest numbers of rows. Hence, a reduced complexity detector based on the use of a tree search algorithm (such as the M-algorithm) with a time varying trellis model of the channel is proposed. The complexity of the detector is related to the parameter M, and it is shown that modest values of M can result in good performance yet should be feasible to implement.
Original language | English |
---|---|
Pages | 2445-2449 |
Number of pages | 5 |
Publication status | Published - 2004 |
Event | GLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States Duration: 29 Nov 2004 → 3 Dec 2004 |
Conference
Conference | GLOBECOM'04 - IEEE Global Telecommunications Conference |
---|---|
Country/Territory | United States |
City | Dallas, TX |
Period | 29/11/04 → 3/12/04 |
Keywords
- Magnetic Recording
- Multidimensional Signal Detection
- Partial Response Signaling
- Viterbi Detection