Detection for digital communication receivers
First Claim
Patent Images
1. A method of sequence detection of a communication channel with a symbol alphabet having A symbols and a channel function f(z), comprising:
- receiving an input symbol in a kth time step, the input symbol being one of a sequence of input symbols;
calculating an array of branch metrics for the input symbol, each branch metric in the array of branch metrics being a measure of the difference between the input symbol and an array of predicted input symbols;
calculating a state metric for each of the A symbols in the symbol alphabet for the kth time step, the state metric being dependent on the state metric for the (k-1)th time step and the array of branch metrics;
determining a comparison result for each of the A symbols in the symbol alphabet in response to the state metric for each of the A symbols in the symbol alphabet and storing the comparison result for each of the A symbols for the kth time step in a traceback memory;
if the kth time step is a traceback time step, tracing back and outputting a best sequence of symbols based on the comparison results stored in the traceback memory.
2 Assignments
0 Petitions
Accused Products
Abstract
A new detection system that improves the detection signal-to-noise (SNR) ratio of a digital communication system suffering from intersymbol interference is described. The detection system utilizes the sample power contained in the intersymbol interference created by the dispersive nature of the communication channel. Significant SNR advantages over more commonly used decision-feedback equalizers (DFE) and linear equalizers are realized.
-
Citations
28 Claims
-
1. A method of sequence detection of a communication channel with a symbol alphabet having A symbols and a channel function f(z), comprising:
- receiving an input symbol in a kth time step, the input symbol being one of a sequence of input symbols;
calculating an array of branch metrics for the input symbol, each branch metric in the array of branch metrics being a measure of the difference between the input symbol and an array of predicted input symbols; calculating a state metric for each of the A symbols in the symbol alphabet for the kth time step, the state metric being dependent on the state metric for the (k-1)th time step and the array of branch metrics; determining a comparison result for each of the A symbols in the symbol alphabet in response to the state metric for each of the A symbols in the symbol alphabet and storing the comparison result for each of the A symbols for the kth time step in a traceback memory; if the kth time step is a traceback time step, tracing back and outputting a best sequence of symbols based on the comparison results stored in the traceback memory. - View Dependent Claims (2, 3, 4, 5, 6, 7)
- receiving an input symbol in a kth time step, the input symbol being one of a sequence of input symbols;
-
8. A sequence detector for a communication channel with a symbol alphabet having A symbols and a channel function f(z), comprising:
-
a branch metric generator, the branch metric generator calculating an array of branch metrics in response to an input symbol received in a kth time step and the channel function f(z); an add-compare-select circuit coupled to the branch metric generator to receive the array of branch metrics, the add-compare-select circuit calculating a set of state metrics for the kth step and a set of comparison results for the kth time step in response to the set of state metrics for the (k-1)th time step and the array of branch metrics; a starting state determiner coupled to the add-compare-select circuit to receive the set of state metrics and calculating a starting traceback state in response to the set of state metrics; a traceback circuit coupled to the add-compare-select circuit to receive the set of comparison results for the kth step and coupled to the starting state determiner to receive the starting traceback state, the traceback circuit storing the comparison results for the (k-M)th time step through the kth time step, M being a traceback depth, and predicting a best sequence of symbols for the (k-M)th time step through the (k-M+L)th time step, L being less than M, every Lth time step; and a last-in-first-out buffer coupled to the traceback circuit to receive the best sequence of symbols for the (k-M)th time step through the (k-M+L)th time step and output the best sequence of symbols in proper temporal sequence. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A detector, comprising:
-
a branch metric generator which computes a branch metric array having a branch metric for each of an array of state transitions and which receives the ACS decision for final states of the detector at a previous time cycle and computation of the branch metric array depends on the ACS decision for final states of the detector at a previous time cycle; an add-compare-select circuit coupled to the branch metric generator which determines a state metric for each state of the detector and an ACS decision for each final state of the detector; a traceback circuit coupled to the add-compare-select circuit; and a starting state determiner coupled between the add-compare select circuit and the traceback circuit.
-
-
21. A detector, comprising:
-
a branch metric generator which computes a branch metric array having a branch metric for each of an array of state transitions; an add-compare-select circuit coupled to the branch metric generator which determines a state metric for each state of the detector and an ACS decision for each final state of the detector; a traceback circuit coupled to the add-compare-select circuit which stores the ACS decisions and on designated time cycles traces a sequence of states back from a starting state determined by the starting state determiner to determine an output sequence of symbols; and a starting state determiner coupled between the add-compare select circuit and the traceback circuit. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28)
-
Specification