AN EFFICIENT REDUCED STATE MAXIMUM LIKELIHOOD SEQUENCE ESTIMATOR

Abstract: A reduced state maximum likelihood sequence estimator allows the use of improved equalization techniques that provides greatly improved performance for channels with severe attenuation and spectral nulls. The reduced state maximum likelihood sequence estimator retains kn states of a total number of K states, kn < K, with each retained state having an associated state metric. (J)(kn) new states are determined based on kn previous states and a most recently received sample, using J transitions, J being a less than L, where L is a size of a symbol alphabet. (J)(kn) new state metrics are determined which are respectively associated with each new state. The new state metrics are compared to a threshold and those states whose metric does not exceed the threshold are retained. The reduced complexity of the MLSE allows for the use of partial response equalizers, e.g., a partial response class V (PRV) equalizer. The number of retained states kn varies according to an adaptive threshold which limits the number of retained states between a lower bound and an upper bound. The threshold may be determined according to the metric of the most likely state of the retained states and a selected one of a plurality of transition metrics associated with the most likely state metric.

Description: AN EFFICIENT REDUCED STATE MAXIMUM LIKELIHOOD SEQUENCE ESTIMATOR Technical Field This invention relates to data communications and in particular to an efficient reduced state maximum likelihood sequence estimator for use in data communication systems Background Art The received signal in a digital communication system includes noise and distortion caused at least in part by intersysmbol interference (ISI) One such digital communication system employs modems, which use digital modulation techniques to modulate and demodulate binary data over analog band-limited communications channels, e.g , telephone lines Modems typically conform to international standards to ensure interoperability with modems from other manufacturers One such standard is the V 34 specification described in ITU-T Recommendation V 34, A Modem Operating at Data Signalling Rates of up to 28 800 bits/sfor Use on the General Switched Telephone Network and on Leased Point-to-Potnt 2-Wιre Telephone-Type Circuits, dated September, 1994 (previously CCITT Recommendation V.34). Another such standard is the V.90 specification descπbed m ITU-T Recommendation V 90, A Digital Modem and Analogue Modem Pair For Use on the Public Switched Telephone Network (PSTN) At Data Signalling Rates of Up To 56 000 bits/s Downstream and Up To 33 600 bits/s Upstream, dated September, 1998 Maximum Likelihood Sequence Estimators (MLSE) are widely used in data communications such as modem communications for decoding data passed through the channels with intersymbol interference (ISI) and for decodmg convolutionally encoded data. The Viterbi algorithm (VA) is quite often used to implement MLSE. A brief description of the Viterbi algorithm, which is well known in the art, is provided to facilitate an understandmg of the present invention Assume that a sequence of symbols x = {x,}, I e]-∞;co[, x, e A = {ai, a 2 , ... a } is transmitted through a channel with impulse response h={h,}, such that h, ≠ 0 only when 0<h,<=M, where M-l is the number of history terms contained in the channel The signal received at the other end of the channel m the absence of noise is defined as y = x*h, where "*" denotes a convolution. If the noise η is added to the signal in the channel, then the signal at the other end of the channel contains that noise and is defined as z = y + η The receiver must reconstruct the transmitted sequence of symbols x, based on the received sequence z At the time nT the following can be used to reconstruct the most recently sent symbol x n Λ n = (y n - (x n ,h, + + x n M+i h M -i))/h 0 (1) From the equation (1) it can be seen that besides the received signal y n , value x„ depends on the vector {x n i,. .x n M+1 } of M-l previously decoded symbols That vector will be further referred to herein as a state With each new decoded symbol, the state of the decoder changes to reflect the new value of the vector {x n . .....X n - M+ i} That is, if at a time nT the state was {x n -ι,. x n - M+ ι} then at a time (n+l)T the new state will be {x n , x n M + 2 } and so forth That change will be further referred herein as a state transition The history of state transitions represents a state trajectory Since each symbol x„ belongs to a finite alphabet A of size L, there can only be K=L M ' unique states All states comprise a state set S = {s,, s 2 , s κ }, where each element s k is a vector of M-l elements that belong to alphabet A such that s k ≠ s„, for k ≠ m Since the noiseless channel output y n is not available to the receiver, the value of x π cannot be determined with absolute certainty, and instead an estimate is used x n = (z„ - (x n ,h,+ + x n M+ i h M ι))/h o (2) The Euclidean distance, t nl , from the alphabet element a to the estimate x n , is defined as t nl = (x n -a]) 2 , which provides the measure of likelihood that the transmitted symbol x n equals a ! at the time nT In a simple receiver, the alphabet element with the minimum Euclidean distance is selected and x n is assumed to be equal to that alphabet element However if x n is not determined correctly (e g due to noise), that incorrect value will cause incorrect state transition causing future symbols to be decoded incorrectly affecting in turn future state transitions and so on That condition is called "error propagation " To avoid the "error propagation" problem, all possible decoder states and all possible state transitions must be examined A state metric D n = {d„i, d n2 , , d n } defines the measure of likelihood, such that each element d πk defines the measure of likelihood of state s k at a time nT which is directly related to the Euclidean distance of the elements of the symbol vector corresponding to state s k The relationship of the state metric D and state set S is shown m Fig 1 in which set S is shown to consist of four states Si through s 4 In the example shown 111 Fig 1 A e (0,1), L=2 and M=3 Each state s, through s has an associated state metric dl through d 4 in D 1 For each state s k of a set S calculate a symbol estimate x nk , based on received symbol z„ according to equation (2) above 2 For each state s k of a set S consider L transitions from that state, and for each transition combmation (k,l) calculate a combined metric d k | = d k + t k ι, where t k ι is an Euclidean distance of the alphabet element al from the symbol estimate 3 For each state s of a set S consider L transitions to that state, selecting the one with the minimum combined metric d calculated during step 2 and assign its value to the state metric d k 4 Find the state with the minimum metric d k stormg a transition that led to that state as a candidate optimal trajectory 5 The first four steps are repeated for each value of n, 1 e , for each received symbol The optimal trajectory for the state with the smallest metric is considered the optimal path (most likely sequence) at a given time As it can be seen from the above description, the computational complexity of the Viterbi algorithm is proportional to L M . For high speed communication systems over band limited channels the value of L is large, thus making the Viterbi algorithm complexity potentially prohibitive even for channels with relatively short impulse response. One use of the Viterbi algorithm, as stated above, is in modem data transmission. Such transmission is always affected by linear rntersymbol interference (ISI) and by noise. Those two impairments are typically countered by equalization, a technique which minimizes ISI and noise at periodic instances at which decisions are taken. The ultimate goal of the equalizer is to minimize a combined effect of ISI and noise and thus reduce the probability of mcorrect decisions. Traditionally, dial up modem designers used Linear Equalizers (LE) to do the job. The performance of LE is quite satisfactory when the combmation of the channel impulse response and the equalizer can form a Nyquιst-1 pulse to satisfy the distortionless (zero ISI) criterion. To achieve that goal, the bandwidth of the channel has to be wider than the symbol rate employed by the modem The new generation of modems conforming to the V.90 recommendation no longer satisfy this criterion The impulse response of a PCM codec is designed to achieve satisfactory transmission of voice signals, and its bandwidth is always more narrow than the 8000 Hz symbol rate used by a modem conforming to the V.90 standard. The spectral nulls at DC and 4000Hz generate infinite noise enhancements when LE is employed. To reduce such noise enhancements, more advanced equalization techniques should be used. Those are decision feedback equalizers (DFE) and partial response equalizers (PRE). Although usually treated separately, LE and PRE are just special cases of DFE. DFE includes two portions: the forward equalizer (FE) and the feedback equalizer (FBE). Both the FE and the FBE can be implemented as linear FIR filters, where the input samples serve as an input to the FE and the previously decoded symbols serve as mput to the FBE The output of both the FE and the FBE are added together and the result is used as the basis for decision for determining the transmitted signal. DFE allows some ISI to remain at the output of FE to be then canceled by FBE. It has been shown that DFE can be the optimum receiver with no decision delay When used in conjunction with Viterbi detector (VD), DFE becomes a powerful tool in battling ISI even for channels with spectral nulls. However the implementation of a Viterbi detector grows considerably more complex with the number of levels used by the transmission symbols and by the number of taps in the FBE. The computational complexity of a Viterbi detector is proportional to L M where M is the number of FBE taps and L is the size of the transmitted symbols alphabet Partial response equalizers (PRE), being a special case of DFE are used to reduce the computational complexity of the Viterbi detector by forcing the FE to leave uncanceled only a controlled amount of ISI, thus requirmg only a small number of FBE taps to cancel it The combination of channel impulse response and FE of PRE form a response, called Partial Response (PR), which contains only a few, usually integer- valued coefficients, thus allowing controlled levels of ISI from a small number of symbols to be present at the instances of decision making A Viterbi detector is then employed to remove that ISI and make the most probable decision The choice of partial response depends heavily on the transrmssion channel When spectral characteristics of the partial response match those of a channel, the FE has an easier task and noise enhancement is limited For a channel with spectral nulls, it is highly desirable to use a partial response havmg spectral nulls at the same positions to avoid infinite noise enhancement A pulse code modulation (PCM) channel has two spectral nulls one around DC, another around 4000 Hz, thus confining the choice of the partial response for PCM modem to those with the same spectral nulls Class IV Partial Response (PRIV) often called modified duobmary, has long been used for the channels with similar characteristics and is well known in the art The PRIV FE output contains the difference of two symbols spaced by two symbol intervals y„ = n - n 2 Since ISI from only one symbol is present, the number of states of the Viterbi detector equals L - the size of the symbol alphabet For data rates achievable by a V 90 compliant modem, L <= 128 Although implementation of 128-state Viterbi decoder is not trivial, Set Partitioning, a well-known technique in the art, can be used to reduce the number of Viterbi detector states to a more manageable number However, when the channel has severe attenuation at a wider range of frequencies adjacent to DC and 4000Hz, the noise enhancement by a class IV partial response equalizer becomes intolerable Therefore, it would be desirable to utilize a partial response equalizer that does not exhibit intolerable noise enhancement and to have the performance of a Viterbi decoder with manageable complexity DISCLOSURE OF THE INVENTION Accordingly the invention provides a reduced state maximum likelihood sequence estimator that causes only a slight degradation of performance relative to an implementation of a full state Viterbi decoder That allows the use of improved equalization techniques that greatly improve performance for channels with severe attenuation and spectral nulls In one embodiment of the invention, a method is provided for implementing a reduced state maximum likelihood sequence estimator in a communications system to decode a received signal The method includes retaming k n states of a total number of K states, k n < K, each retained state havmg an associated state metric (J)(k n ) new states are determined based on k„ previous states and a most recently received symbol, using J transitions, J being a less than L, where L is a size of a symbol alphabet (J)(k n ) new state metrics are determined which are respectively associated with each new state The new state metrics are compared to a threshold and those states whose metric does not exceed the threshold are retamed In another embodiment, the invention provides a modem that includes a partial response class V (PRV) equalizer coupled in its receive path In still another embodiment of the invention a modem includes a reduced state maximum likelihood sequence estimator (MLSE) in its receive path That MLSE may be coupled to a partial response equalizer The reduced state maximum likelihood sequence estimator retains a varying number of reduced states The number of retained states may be limited by use of an adaptive threshold that limits the number of retained states between a lower bound and an upper bound The threshold may be determined accordmg to a metric of a most likely state of the retained states and a selected one of a plurality of associated transition metrics BRIEF DESCRIPTION OF DRAWINGS The present mvention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencmg the accompanying drawings, wherein the use of the same reference symbols in different drawings indicates similar or identical items Fig 1 illustrates the state vector and state metric utilized in Viterbi decoding Fig 2 illustrates an exemplary modem incorporating an embodiment of the present invention Fig 3 is a flow chart illustrating how reduced states and reduced transitions are utilized m an embodiment of the present mvention Fig 4 is a flow chart illustrating the method of determining the threshold accordmg to one embodiment of the mvention MODE(S) FOR CARRYING OUT THE INVENTION The current invention provides an approach which addresses the issue of computational complexity of the Viterbi algorithm by offering an efficient approach which, while bemg suboptrmal, causes only a slight degradation of performance relative to an implementation of a full state Viterbi decoder That allows the use of improved equalization techniques As discussed above, when the channel has severe attenuation at a wider range of frequencies adjacent to DC and 4000Hz, the noise enhancement caused by the use of a PRIV equalizer becomes intolerable One approach to battle this noise enhancement is to use Partial Response class V (PRV) equalizer PRV FE output contains the second difference of symbols spaced by two symbol intervals, and can be expressed as The PRV equalizer has double nulls at DC and 4000Hz and thus produces much less noise enhancement for channels with high attenuation at band edges PRV equalizers were never considered practical for multilevel signals such as those received m modems conformmg to the V 90 standard, because of the huge number of states required by Viterbi decoding For example, a straightforward Viterbi implementation for a data rate of 56Kbιts/sec having 128 symbols, requires 16,384 states Such an implementation requires a significant amount of memory to store the states as well as having high computational complexity because of the large number of states Computational complexity of such Viterbi decoding is enormous even when set partitioning is employed Plam decision driven FBE cannot be used because of stability considerations. Even a single decision error will cause a subsequent chain reaction without any chance for recovery. The efficient reduced state MLSE disclosed herein allows the use a wide variety of partial response equalizers with performance close to that achieved by a full state Viterbi decoder without the enormous computational load required by a full state Viterbi decoder. Another aspect of equalizer implementation is the tap spacing. T-spaced equalizers use the signal sampled at the symbol rate. Fractionally spaced equalizers (FSE) operate on a signal sampled at a rate higher than the symbol rate and require eventual down sampling. It is known that T-spaced equalizers depend heavily on coded sample clock phase, and that there is at least one value of the phase in the symbol interval T for which the combined channel response and equalizer response have spectral nulls at half symbol rate. To avoid that undesirable effect, modem designers traditionally employed FSE in spite of its higher computational complexity. However since PRV equalizers actually require spectral null at half symbol rate, the advantage of FSE becomes non-existent. Therefore a T-spaced equalizer is a logical choice for a V.90 modem. Use of a T-spaced equalizer also allows the use of 8KHz sample rate for the A/D converter. A block diagram of an exemplary V.90 modem employing an embodiment of a reduced state maximum likelihood sequence estimator and a class V partial response equalizer according to the present invention is shown in Fig. 2. A brief description of the modem shown in Fig. 2 will provide the appropriate context for better understanding the embodiments of the invention described herein. A detailed discussion of the operation of the exemplary modem is not provided as modem operation in conformance with, e.g., the V.90 recommendation, is known the art. In one embodiment, the MLSE and partial response equalizer shown in Fig. 2 are implemented in software which may be stored on computer readable media which can be executed on a general purpose processor. Those of skill in the art will appreciate that the teachings herein may also be applied to a variety of modem implementations such as those using a digital signal processors and/or stand alone processors. The block diagram of the modem shown in Fig. 2 includes transmitter 201 and receiver 203. The transmitter data module 205 supplies bits to the encoder 207. The transmitter module 205 either generates those bits locally in the case of training or fetches them from the external data source in the case of data mode. It then scrambles the bits as required and passes the data to the encoder 207. Encoder 207 converts the input bit stream from data module 205 into a sequence of symbols which are then provided to modulator 209. Modulator 209 performs appropriate sampling and filtering operations and provides its output to shaping and preemphasis filter 211 that provides square-root-of raised cosine shaping as well as preemphasis filtering specified by the V.90 recommendation. That output is provided to the digital to analog converter 213. The receiver portion of the modem 203 receives the output from the transmitter (prior to the D/A) into receiver front end 215. Receiver front end also receives the signal 216 from the channel. The front end 215 performs such operations as analog to digital conversion on the received signal, various filtering and echo- canceling operations and provides its output to the demodulator 217. The demodulator 217 includes partial response class V equalizer 219 as described further herein. The demodulator 217 also includes the second stage near end echo canceller 220, which cancels the echo at the output of the equalizer and is intended to track slow variations of the echo signal The output of the partial response equalizer is provided to the decoder 221 and more specifically to the reduced state maximum likelihood sequence estimator 223, as described further herein. Note that the noise signal at the output of PRV equalizer is strongly colored due to the nature of the partial response used. A noise- whitenmg filter 222 is required to achieve optimal performance of the MLSE The noise-whitening filter is designed as an error predictor. It is trained during the reception of TRN signal during training phase and then used in conjunction with the MLSE to minimize the error probability. The symbols decoded by MLSE 223 are then split into sign and amplitude components and passed respectively to the spectral de-shaper 225 and modulus decoder 227 Both of those modules extract the data payload from the symbols that is later converted to a bit stream by data assembler 229. Receive data module 231 descrambles this bit stream and passes it to the application program. While a V.90 modem has been described, it should be understood that other modems and other communication devices may advantageously use the invention described herein. Referring still to the block diagram shown in Fig. 2, the partial response equalizer 219 provides its output, (y„ = x n - 2 x„ 2 + x n - 4 ), to the reduced state MLSE 223. Because it is a reduced state estimator, at any given time, nT, the reduced state MLSE described herein retains only a reduced number of states k n . Note that k n can vary, having a lower bound and an upper bound such that k t <= k n <= k 2 . A further simplification as compared to the full state Viterbi detector is that only a reduced number of transitions, J, are analyzed, J < L, L being the size of the alphabet. The advantages of the reduced state approach described herein are readily apparent when compared with a full state Viterbi decoder implementation. For example, for a full Viterbi decoder, 16,384 states can be required for a modem conformmg to the V 90 recommendation (alphabet of 128). In comparison, m one embodiment of the mvention described herein, the reduced number of states may be only 12. Further, only two transitions (J=2) from those retained states are analyzed rather than L transitions (L bemg the size of the alphabet, e.g. 128). The parameters ki and k 2 are parameters of the reduced state MLSE which can be selected to adaptively control tradeoff between performance and computational complexity. In addition J can also be adjusted to increase and/or reduce the complexity. Referring to Fig 3, the flowchart illustrates generally an embodiment of the reduced state estimator The parameters k h k 2 , k n and J are initialized Some or all of the parameters may be implemented as programmable or may be fixed Exemplary values are- ki = 8, k 2 = 16, k π =12 and J = 2. In 303, a noisy estimate of the received signal is determined for each of the retained states. Next, the MLSE determines the closest J alphabet elements to the noisy estimate m 305 In 307, the MLSE, using the J alphabet elements, determines the (J)(k„) new states. Thus, if there are 12 states in k n , and J = 2, then 24 new states will be generated The transition metric associated with each alphabet element is added to the state metric for each of the retained states to determine a state metric associated with each of the new states Finally, if the number of new states is outside the range of k, and k 2 , then the number of new states is adjusted accordmgly If the number of new states is greater than k 2 , the new states must be reduced down to the desired number of retained states Otherwise, the number of retained states will grow, quickly causing the computational complexity to be burdensome Therefore, if (J)(k n ) (the number of new states) > k 2 , the MLSE discards those states with the largest metrics such that k, <= the number of the remainmg states <= k 2 In that way, the number of retained states is manageable One approach to select the appropriate ones of the new states to retain is to sort the temporary state metrics in ascending order, and then select the first k n new states to become the retamed states However sorting is an expensive operation with complexity of the order (k n 2 ) If kj and k 2 are large, sorting may become the dominant operation of the overall algorithm An alternative to sorting is to determine an empirically based threshold "t " The metrics of the new states are compared to the threshold Those new states whose metric is below the threshold are retained One way to calculate the threshold "t" is as follows t = ((k l + k 2 )/(2Jk„))(l/Jk n )∑d jn+ , That formula is designed to provide a threshold that is adaptive according to the number of retamed states Assume that k, = 8, k 2 = 16, J=2 and the target k n is 12 If the number of new states (J)(k n ) is exactly twice the target of 12, l e the number of retamed states is exactly the target, then the first term of the equation above provides (1/2) That term is used to adjust the average metric of the new states determined by (l/Jk n )∑d jπ+ ι If the number of retained states is exactly the target of 12, then (1/2) of the average metric is selected as the target Note that the average is used to provide an estimate of the median If the number of retamed states is less than the target k„, the next threshold adjusts to be somewhat higher than 1/2 of the average metric Alternatively, if the number of retained states is greater than the target, then the next threshold adjusts to be below (1/2) of the average metric In that way, the threshold continually adapts to the actual number of retamed states and fluctuates around the target K n A new threshold is typically determined for every new received symbol All states are selected as retamed states whose metric is less than threshold (t) This threshold approach has a complexity of the order (k„) and is much more efficient for large ki, k 2 It however does not guarantee that the resulting number of states selected from the new states are m the range [ki k 2 ] In case the number of states selected from the new states are not m the range of [k ! k 2 ], the threshold has to be adjusted and selection repeated If the threshold needs adjusting, it can be adjusted up or down, as needed by a fixed percentage, e g , 25% or some other percentage appropriate to the particular implementation Thus, if there are too few retamed states, (< k,), (t) can be adjusted up 25% and similarly, if there are too many retained states (> k 2 ), (t) can be adjusted down The wider the range [kj k 2 ] the smaller the chance that repeat selection would be required In simulation results for the cases where k 2 = 2kj repeat selection of the threshold is only required in about 10% of iterations Other empirical approaches for determining the threshold t are also possible For example, another approach is illustrated in Fig 4 Most of the operations illustrated in Fig 4 are performed as part of the reduced state approach described herein and do not have to be repeated for determination of the threshold In 401, the most likely state of the retained states is selected according to its state metric That is, of the retamed states, the most likely state is that having the lowest metric which is the output of the MLSE Then, using the noisy estimate x n of the received signal z n , the elements of the alphabet closest to x n are selected and their transition metrics determined Those elements will have metrics associated with them based on the Euclidean distance from the noisy estimate x n In 407, the transition metric is selected For the case of J=2, the transition metric selected is the second best transition metric That provides a threshold for the next estimate Then m 407, the threshold is determined as the sum of the previous best state metric and one of the transition metrics The second best metric is chosen to provide a threshold that is high enough to generate a sufficient number of retained states If the threshold is set too low or too high, such that fewer than ki or greater than k 2 states would be retained, the threshold may be adjusted up or down accordmgly Note that if J is other than two, a metric other than second best may be chosen This approach provides an adaptive threshold based on one of the retained states (the best retamed state in the embodiment descπbed) The reduced state MLSE described herein may be used advantageously with a partial response class V equalizer, as illustrated, e g , in Fig 2 to provide improved performance over channels with severe attenuation and spectral nulls The combmation of the MLSE and a PRV equalizer is described as follows For each of k n retained values, S jn , j = 1, 2, k„, of state vector S n , and received noisy signal z n , the MLSE calculates a noisy estimate of sent signal x jn In the equation above, M is the memory of the channel m symbol intervals and z n is the noisy output of the equalizer For use with the PRV equalizer, m order to determine an estimate of the sent signal, the MLSE has to subtract out the second difference of symbols spaced by two symbol intervals as previously described (- 2x n + x n 4 ) Therefore in the equation above, h = -2 for ι=2 and h = 1 for I = 4 Because M=5, four history terms have to be stored for each retained state Only two of the history terms are used durmg any particular generation of the noisy estimate A noisy estunate is generated for each of the retamed states usmg the stored history values and the output of the PRV The next operation of the MLSE is to determine J elements from alphabet A for each estimate x jn , such that the Euclidean distance from these elements to x jn is the smallest Assuming J is two, the two alphabet elements closest to each noisy estimate, x jn , are selected If the noisy estimate is below the lowest alphabet element or above the largest element, the first or last two alphabet elements are chosen, respectively Finally, the MLSE calculates (J)(k n ) temporary new states for state vector S n+] , and state metric D n+1 , having a metric associated with each of the states in state vector S n ι Thus, contmuing with the assumption that k„ = 8 and J=2, 16 new states will be calculated In addition, 16 state metrics are determined that are associated with the new states The new state metrics are based on the prior state metric and the transition metric associated with the J transitions selected The transition metrics, as is known in the art, are determined accordmg to the Euclidean distance between the J alphabet points and the noisy estimate Each new state is generated using the elements (alphabet values) from the previous state, by deletmg the oldest element and inserting as the newest element, the alphabet element representing the received value that transitioned the previous state m S n to the current state in S n+ ι As described previously, various threshold techniques may be employed to reduce the new states to the appropriate number If necessary, the threshold may be increased or decreased to increase or reduce, respectively, the number of retained states As with the rest of the MLSE and the PRV equalizer descπbed here , the operation of determining and adjusting the threshold may be implemented m software instructions operating on a digital signal processor and/or a general purpose processor. The description of the invention set forth herem is illustrative, and is not mtended to limit the scope of the invention as set forth in the following claims For mstance while the reduced state MLSE described herein was described in association with a partial response class V equalizer, the reduced state MLSE descπbed herein may be employed wherever Viterbi decodmg has been used, for example in decodmg convolutionally encoded data or in conjunction with different classes of partial response equalizers Additionally, while the communication device described was a modem complymg with the V.90 standard, other telecommunication devices may also benefit from the invention described herein and the mvention should not be considered as bemg limited to a particular type of communication device or to a particular modem implementation Variations and modifications of the embodiments disclosed herem, may be made based on the description set forth herem, without departmg from the scope and spirit of the invention as set forth in the folio wmg claims

Claims: WHAT IS CLAIMED IS: 1 A modem compnsmg a reduced state maximum likelihood sequence estimator (MLSE) in a receive path of the modem 2 The modem as recited in claim 1 further compnsmg a partial response equalizer operatively coupled to provide a partial response to the reduced state maximum likelihood sequence estimator 3 The method as recited m 2 wherein the partial response equalizer is a class V partial response equalizer 4 The modem as recited m claim 3, wherem the partial response equalizer is a T-spaced equalizer 5 The modem as recited m any of claims 1 through 4, wherein the reduced state maximum likelihood sequence estimator further mamtams storage encodmg a plurality k n of retained states, each of the retamed states havmg an associated state metric, k n being less than a total number of possible states, a set of (J)(k„) new states, determmed accordmg to J transitions, J being a less than a size of a symbol alphabet, and an associated set of new state metrics, and a threshold for comparison to the new state metrics 6 The modem as recited m claim 5 wherein the threshold is adaptive 7 The modem as recited m claim 5 wherein a number of retained states, k n , is variable 8 The modem as recited m claim 5 wherem the MLSE, receivmg the output z n , of the partial response equalizer, calculates a noisy estimate of a sent symbol, for each of the retained states 9 The modem as recited m claim 8 wherem the noisy estimate x jn of the sent signal is determined accordmg to M-l X j n — Z„ - / j x n , n, 1=1 wherein M- 1 is the number of stored history terms and h = -2 for ι=2 and h = 1 for I = 4 10 The modem as recited m claim 5 wherem the size of the alphabet of possible values of a sent symbol is > 32 11 A method of operating a modem comprising generating a most likely estimate of a transmitted symbol received by the modem using a reduced state maximum likelihood sequence estimator 12 The method as recited in claim 11 wherem using the reduced state maximum likelihood sequence estimator further comprises retaining k n states of a total number of K states, k n < K, each retained state havmg an associated state metric, determining (J)(k n ) new states based on k n previous states and a most recently received sample, using J transitions, J being a less than L, where L is a size of a symbol alphabet, determining (J)(k n ) new state metrics respectively associated with each new state, performing a comparison of the new state metrics to a threshold, and retaining those new states whose metric does not exceed the threshold 13 The method as recited in claim 12 wherein the threshold is adaptively determmed 14 The method as recited in claim 12 wherem the number of retained states k n , varies between a lower bound, k,, and an upper bound, k 2 , such that k, < k„ < k 2 15 The method as recited in claim 14 wherein the threshold is adjusted if the number of retained states is less than kj or if the number of retained states is greater than k 2 16 The method as recited in claim 12 wherem the threshold is fixed 17 The method as recited in claim 13 wherem the threshold is determined according to an average of the metrics of the new states and the number of retained states k n 18 The method as recited in claim 17 wherein the threshold (t) is determined accordmg to t = ((k, + k 2 )/(2Jk n ))(l/Jk n ) rd.„ + i, where ∑d. n+ ι is the sum of the metrics of the new states and wherem ki + k 2 are the lower and higher bound, respectively, of k n 19 The method as recited in claim 13 wherein determining the threshold comprises determining a most likely one of the retamed states according to its associated metric, determine the J transitions from the most likely retained state and associated J transition metrics, determining the threshold to be the metric associated with the most likely retained state added to a selected transition metric associated with one of the J transitions 20 The method as recited in claim 19 wherem the selected transition metric is not the lowest of the J transition metrics 21 The method as recited m claim any of claims 11 through 20 further comprising providing a partial response from a partial response equalizer coupled m a receive path of the modem to the reduced state maximum likelihood sequence estimator 22 The method as recited in 21 wherem the partial response equalizer is a class V partial response equalizer 23 A computer program product, encoded by or transmitted in at least one computer readable medium selected from the set of a disk, tape, or other magnetic, optical or electronic storage medium and a network, wirelme, wireless or other communications medium, the computer program product implementing a reduced state maximum likelihood sequence estimator for a transmitted symbol and executable on a computer to retain k n states of a total number of K states, k„ < K, each retained state havmg an associated state metric, determine (J)(k n ) new states based on k n previous states and a most recently received sample, usmg J transitions, J bemg a less than L, where L is a size of a symbol alphabet, determine (J)(k n ) new state metrics associated respectively with each new state, perform a comparison of the new state metrics to a threshold, and keep as new retained states those states whose metric does not exceed the threshold

Inventors: GONIKBERG MARK, GONIKBERG, MARK
Applicants: ALTOCOM INC, GONIKBERG MARK, ALTOCOM, INC., GONIKBERG, MARK
Application year: 2000
Main classification: H04L27
IPC codes: H03D1, H03M13, H04L25, H04L27