US5440588A — Method and apparatus for estimating maximum likel…

Claim 1

Independent Claim 259 words

A method for estimating a maximum likelihood sequence in a digital communication receiver, comprising the steps of: sampling received signals at a predetermined sampling frequency; sequentially storing at least N of the received signals sampled for at least N previous sampling times by the sampling step, where N is an integer, for forming an N-dimensional received signal vector for a present sampling time, in a first memory means; storing N-dimensional vectors corresponding to all possible transmission sequence candidates of a prescribed length L, which are pre-calculated according to a prescribed definition for defining the N-dimensional vectors, in a second memory means; calculating an inner product of one of the N-dimensional vectors stored in the second memory means corresponding to each transmission sequence candidate resulting from each one of branches reaching to each state at the present sampling time with the N-dimensional received signal vector for the present sampling time stored in the first memory means to obtain an estimated received signal for said each one of the branches at the present sampling time; and estimating the maximum likelihood sequence as a survivor path for said each state at the present sampling time by selecting one of the branches reaching to said each state which minimizes a path metric defined as a cumulative value of a square of an absolute value of a difference between the estimated received signal for each sampling time up to the present sampling time calculated by the calculating step and an actual received signal for said each sampling time up to the present sampling time.

Claim 2

Independent Claim 259 words

A method for estimating a maximum likelihood sequence in a digital communication receiver, comprising the steps of: sampling received signals at a predetermined sampling frequency; sequentially storing at least N of the received signals sampled for at least N previous sampling times by the sampling step, where N is an integer, for forming an N-dimensional received signal vector for a present sampling time, in a first memory means; storing N-dimensional vectors corresponding to all possible transmission sequence candidates of a prescribed length L, which are pre-calculated according to a prescribed definition for defining the N-dimensional vectors, in a second memory means; calculating an inner product of one of the N-dimensional vectors stored in the second memory means corresponding to each transmission sequence candidate resulting from each one of branches reaching to each state at the present sampling time with the N-dimensional received signal vector for the present sampling time stored in the first memory means to obtain an estimated received signal for said each one of the branches at the present sampling time; and estimating the maximum likelihood sequence as a survivor path for said each state at the present sampling time by selecting one of the branches reaching to said each state which minimizes a path metric defined as a cumulative value of a square of an absolute value of a difference between the estimated received signal for each sampling time up to the present sampling time calculated by the calculating step and an actual received signal for said each sampling time up to the present sampling time.

Claim 3

Dependent Claim 109 words

The method of claim 1, wherein at the storing step, the prescribed definition of the N-dimensional vectors is expressed by: g.sub.m/m' (k)=s.sub.m'.sup.· (k-1) [s.sub.m'.sup.·t (k-1) s.sub.m' (k -1)+δI].sup.-1 s.sub.m (k) where g m/m' (k) is an N-dimensional vector for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k-th sampling time, S m' (k-1) is an N×L transmission signal matrix for the state m' at a (k-1)-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and s m (k) is an L-dimensional transmission signal vector for the state m at the k-th sampling time.

Claim 4

Dependent Claim 119 words

The method of claim 1, wherein at the storing step, the N-dimensional vectors are pre-calculated for a transmission path response for minimizing an evaluation function expressed by: ##EQU21## where E'(k) is the evaluation function at a k-th sampling time, e k+i is given by: e.sub.k+i =s.sup.t (k+i) h(k)-r.sub.k+i s(k+i) is an L-dimensional transmission signal vector at a (k+i)-th sampling time, h(k) is the transmission path response at the k-th sampling time, r k+i is a (1-i)-th element of the N-dimensional received signal vector at the k-th sampling time, δ is a positive infinitesimal constant, S(k) is an N×L transmission signal matrix at the k-th sampling time, and r(k) is the N-dimensional received signal vector at the k-th sampling time.

Claim 5

Dependent Claim 28 words

The method of claim 1, wherein at the sampling step, the sampling frequency is F times a transmission symbol frequency, where F is an integer greater than one.

Claim 6

Dependent Claim 130 words

The method of claim 4, wherein at the storing step, the prescribed definition of the N-dimensional vectors is expressed by: ##EQU22## where g1 m/m' (k") to gF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time.

Claim 7

Dependent Claim 20 words

The method of claim 1, wherein at the storing step, each of the N-dimensional vectors includes a time weight factor.

Claim 8

Dependent Claim 150 words

The method of claim 6, wherein at the storing step, the prescribed definition of the N-dimensional vectors is expressed by: ##EQU23## where g1 m/m' (k") to gF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, F is an integer greater than one, W is the time weight factor given by: ##EQU24## w j ≧0, 0≦j≦N-1, X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time.

Claim 9

Dependent Claim 98 words

The method of claim 1, wherein at the storing step, the N-dimensional vectors are pre-calculated for a transmission path response for minimizing an evaluation function expressed by: ##EQU25## where E"(k) is the evaluation function at a k-th sampling time, w -i is a (-i)-th time weight factor, e k+i is given by: e.sub.k+i =s.sup.t (k+i) h(k)-r.sub.k+i s(k+i) is an L-dimensional transmission signal vector at a (k+i)-th sampling time, h(k) is the transmission path response at the k-th sampling time, r k+i is a (1-i)-th element of the N-dimensional received signal vector, and δ is a positive infinitesimal constant.

Claim 10

Dependent Claim 41 words

The method of claim 1, wherein at the storing step, the N-dimensional vectors are pre-calculated for a transmission path response expressed by: ##EQU26## where h(k) is the transmission path response at a k-th sampling time, and α is a positive constant.

Claim 11

Dependent Claim 163 words

The method of claim 1, wherein at the storing step, the prescribed definition of the N-dimensional vectors is expressed by: ##EQU27## where d1 m/m' (k") to dF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, α is a positive constant, and g1" m/m' (k") to gF" m/m' (k") and f1" m/m' (k") to fF" m/m' (k") are given by: ##EQU28## where X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, and F is an integer greater than one.

Claim 12

Independent Claim 262 words

An apparatus for estimating a maximum likelihood sequence in a digital communication receiver, comprising: sampling means for sampling received signals at a predetermined sampling frequency; first memory means for sequentially storing at least N of the received signals sampled for at least N previous sampling times by the sampling means, where N is an integer, for forming an N-dimensional received signal vector for a present sampling time; second memory means for storing N-dimensional vectors corresponding to all possible transmission sequence candidates of a prescribed length L, which are pre-calculated according to a prescribed definition for defining the N-dimensional vectors; calculation means for calculating an inner product of one of the N-dimensional vectors stored in the second memory means corresponding to each transmission sequence candidate resulting from each one of branches reaching to each state at the present sampling time with the N-dimensional received signal vector for the present sampling time stored in the first memory means to obtain an estimated received signal for said each one of the branches at the present sampling time; and means for estimating the maximum likelihood sequence as a survivor path for said each state at the present sampling time by selecting one of the branches reaching to said each state which minimizes a path metric defined as a cumulative value of a square of an absolute value of a difference between the estimated received signal for each sampling time up to the present sampling time calculated by the calculating means and an actual received signal for said each sampling time up to the present sampling time.

Claim 13

Independent Claim 262 words

An apparatus for estimating a maximum likelihood sequence in a digital communication receiver, comprising: sampling means for sampling received signals at a predetermined sampling frequency; first memory means for sequentially storing at least N of the received signals sampled for at least N previous sampling times by the sampling means, where N is an integer, for forming an N-dimensional received signal vector for a present sampling time; second memory means for storing N-dimensional vectors corresponding to all possible transmission sequence candidates of a prescribed length L, which are pre-calculated according to a prescribed definition for defining the N-dimensional vectors; calculation means for calculating an inner product of one of the N-dimensional vectors stored in the second memory means corresponding to each transmission sequence candidate resulting from each one of branches reaching to each state at the present sampling time with the N-dimensional received signal vector for the present sampling time stored in the first memory means to obtain an estimated received signal for said each one of the branches at the present sampling time; and means for estimating the maximum likelihood sequence as a survivor path for said each state at the present sampling time by selecting one of the branches reaching to said each state which minimizes a path metric defined as a cumulative value of a square of an absolute value of a difference between the estimated received signal for each sampling time up to the present sampling time calculated by the calculating means and an actual received signal for said each sampling time up to the present sampling time.

Claim 14

Dependent Claim 110 words

The apparatus of claim 11, wherein the second memory means stores the N-dimensional vectors defined by the prescribed definition expressed by: g.sub.m/m' (k)=s.sub.m'.sup.· (k-1) [s.sub.m'.sup.·t (k-1) s.sub.m' ( k-1)+δI].sup.-1 s.sub.m (k) where g m/m' (k) is an N-dimensional vector for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k-th sampling time, s m' (k-1) is an N×L transmission signal matrix for the state m' at a (k-1)-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and s m (k) is an L-dimensional transmission signal vector for the state m at the k-th sampling time.

Claim 15

Dependent Claim 121 words

The apparatus of claim 11, wherein the second memory means stores the N-dimensional vectors which are pre-calculated for a transmission path response for minimizing an evaluation function expressed by: ##EQU29## where E'(k) is the evaluation function at a k-th sampling time, e k+i is given by: e.sub.k+i =s.sup.t (k+i) h(k)-r.sub.k+i s(k+i) is an L-dimensional transmission signal vector at a (k+i)-th sampling time, h(k) is the transmission path response at the k-th sampling time, r k+i is a (1-i)-th element of the N-dimensional received signal vector at the k-th sampling time, δ is a positive infinitesimal constant, S(k) is an N×L transmission signal matrix at the k-th sampling time, and r(k) is the N-dimensional received signal vector at the k-th sampling time.

Claim 16

Dependent Claim 29 words

The apparatus of claim 11, wherein the sampling means uses the sampling frequency which is F times a transmission symbol frequency, where F is an integer greater than one.

Claim 17

Dependent Claim 131 words

The apparatus of claim 14, wherein the second memory means stores the N-dimensional vectors defined by the prescribed definition expressed by: ##EQU30## where g1 m/m' (k") to gF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time.

Claim 18

Dependent Claim 22 words

The apparatus of claim 11, wherein each of the N-dimensional vectors stored in the second memory means includes a time weight factor.

Claim 19

Dependent Claim 151 words

The apparatus of claim 16, wherein the second memory means stores the N-dimensional vectors defined by the prescribed definition expressed by: ##EQU31## where g1 m/m' (k") to gF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, F is an integer greater than one, W is the time weight factor given by: ##EQU32## w j ≧0, 0≦j≦N-1, X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, and x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time.

Claim 20

Dependent Claim 100 words

The apparatus of claim 11, wherein the second memory means stores the N-dimensional vectors which are pre-calculated for a transmission path response for minimizing an evaluation function expressed by: ##EQU33## where E"(k) is the evaluation function at a k-th sampling time, w -i is a (-i)-th time weight factor, e k+i is given by: e.sub.k+i =s.sup.t (k+i) h(k)-r.sub.k+i s(k+i) is an L-dimensional transmission signal vector at a (k+i)-th sampling time, h(k) is the transmission path response at the k-th sampling time, r k+i is a (1-i)-th element of the N-dimensional received signal vector, and δ is a positive infinitesimal constant.

Claim 21

Dependent Claim 43 words

The apparatus of claim 11, wherein the second memory means stores the N-dimensional vectors which are pre-calculated for a transmission path response expressed by: ##EQU34## where h(k) is the transmission path response at a k-th sampling time, and α is a positive constant.

Claim 22

Dependent Claim 164 words

The apparatus of claim 11, wherein the second memory means stores the N-dimensional vectors defined by the prescribed definition expressed by: ##EQU35## where d1 m/m' (k") to dF m/m' (k") are the N-dimensional vectors for a transmission sequence candidate resulting from a branch from a state m' to a state m at a k"-th sampling time, α is a positive constant and g1" m/m' (k") to gF" m/m' (k") and f1" m/m' (k") to fF" m/m' (k") are given by: ##EQU36## where X m/m' (k") is an ideal received signal matrix for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, δ is a positive infinitesimal constant, I is an L-dimensional unit matrix, x m/m' (k") is an ideal received signal vector for the transmission sequence candidate resulting from the branch from the state m' to the state m at the k"-th sampling time, and F is an integer greater than one.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1998-08-07	1999-02-06	1999-08-08	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2002-08-07	2003-02-06	2003-08-08	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2006-08-07	2007-02-06	2007-08-08	$7700.00	Window Closed / Lapsed

Method and apparatus for estimating maximum likelihood sequence in digital communication receiver with reduced real time calculations

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag