Pulse or digital communications – Receivers – Particular pulse demodulator or detector
Reexamination Certificate
1998-08-14
2002-01-15
Chin, Stephen (Department: 2634)
Pulse or digital communications
Receivers
Particular pulse demodulator or detector
C375S262000, C375S265000, C375S267000, C714S789000
Reexamination Certificate
active
06339624
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates generally to digital communication systems and more particularly to a technique for providing enhanced performance.
The discussion that follows assumes an understanding of digital communication principles as known to those of skill in that art. A good general reference in the digital communication field is John G. Proakis, Digital Communications, (McGraw-Hill 1995), herein incorporated by reference.
Conventional Viterbi Algorithm
The Viterbi algorithm accepts as input a sequence of received symbols and determines the maximum likelihood sequence of transmitted symbols. The Viterbi algorithm is applied to decode convolutional coding or trellis coding applied at the transmitter end or to remove the effects of a partial response channel. The algorithm is perhaps best understood by reference to a so-called trellis diagram. A trellis diagram is a time-indexed state diagram. At each trellis stage, n, there are two or more states. Transitions between states at a trellis stage, n, and states at a trellis stage n+1 denote transmitted symbols. A path through the trellis consists of a number of successive transitions and denotes a sequence of symbols. The number of states at each stage and the correspondence between transitions and symbols are particular to the relevant trellis code, convolutional code, or partial response channel characteristics. The Viterbi algorithm uses received symbol information to identify a particular path through the trellis and thus determine the maximum likelihood sequence of transmitted symbols.
Computation of the maximum likelihood sequence proceeds on a stage-by-stage basis. Possible paths are eliminated once it becomes clear they cannot be the maximum likelihood path. Given received symbol information, the likelihood of a particular branch being taken is evaluated according to a measure known as the branch metric. For each state, the Viterbi algorithm computes the branch metrics for the surviving paths leading to that state. The branch metric will typically consist of the previously accumulated branch metric for the path plus the branch metric for the transition taken to the new state. Based on the accumulated branch metrics for all the paths leading to the state, the Viterbi algorithm selects a best path to the state and eliminates the other states. Only one path survives to each stage, permitting identification of the maximum likelihood transmitted symbol sequence.
FIG. 2
depicts the prior art operation of a Viterbi decoding algorithm assuming channel phase is known. Consider an AWGN channel model,
r
n
=e
i&THgr;
As
n
+W
n
, n= . . . 0,1,2, . . . , (1)
where &THgr; is channel phase; below we consider two cases where channel phase is known and where it is completely unknown. The transmitted symbol s
n
is an MPSK symbol, where s
k
=e
j&phgr;k
, and &phgr;
k
is a uniformly distributed random phase taking values in {0,2&pgr;/M, . . . 2&pgr;(M−1)/M}. The received sample is r
n
, and w
n
is an independent sample of zero mean white complex Gaussian noise of variance &sgr;
2
.
The mathematics of a conventional Viterbi decoding algorithm for a convolutional code, assuming channel phase &THgr; is known will now be described. To simplify the description, assume the convolutional code has two branches into and out of each state.
FIG. 2
depicts a state diagram wherein two states, u and v, at stage n−1, which both have a single branch into state w at stage n. Associated with state u is the previously determined winning path into state u, denoted by s
u,0
,s
u,1
, . . . s
u,n−1
, and a path metric m
u
. Associated with state v is the previously determined winning path into state v, denoted by s
v,0
,s
v,1
, . . . s
v,n−1
, and a path metric m
z
. Let s
u,n
be the symbol on the branch from state u to state w, and let s
v,n
be the symbol on the branch from state v to state w. Let s
0
,s
1
, . . . s
n−
s
n
be the first n actual transmitted symbols, and let r
0
,r
1
, . . . r
n−1
,r
n
be the corresponding received samples. The following discussion explains how to update state w at stage n, by finding the winning branch into state w, the winning path into state w, and the winning path metric for state w. The conventional Viterbi algorithm proceeds in four steps:
(1) Form two branch metrics
Re[r
n
s
u,n
*(s
j&THgr;
)*], (2)
and
Re[r
n
s
v,n
*(s
j&THgr;
)*]. (3)
(2) Use branch metric (2) to form a candidate path metric for the top path,
m
u=Re[r
n
s
u,n
*(e
j&THgr;
)*], (4)
and use branch metric (3) to form a candidate path metric for the bottom path,
m
v
+Re[r
n
s
v,n
*(e
j&THgr;
)*]. (5)
(3) Compare (4) and (5) and select a winner, say (4).
(4) Update state w at stage n. The winning path into state w at stage n is s
w,0
,s
w,1
, . . . s
w,n−
, s
w,n
where
(s
w,0
,s
w,1
, . . .s
w,n−1
, s
w,n
)=(s
u,0
,s
u,1
, . . . s
u,n−1
, s
u,n
).
The winning path metric is
m
w
=m
u
+Re[r
n
s
u,n
*(e
j&THgr;
)*].
Non-coherent Viterbi Decoding Algorithm Operation
FIG. 3
depicts the prior art operation of a Viterbi decoding algorithm using multiple symbol noncoherent detection. Non-coherent Viterbi decoding is described in [9] A. N. D'Andrea, U. Mengali, and G. M. Vitetta, “Approximate ML decoding of coded PSK with no explicit carrier phase reference,”
IEEE Transactions on Communications
, Vol. 42, no. 2/3/4, February/March/April 1994, pp. 1033-1039, incorporated herein by reference. This approach can be used without an explicit phase reference, and so assume that &THgr; in (1) is uniformly distributed on (−&pgr;,&pgr;)
FIG. 3
is the same as
FIG. 2
except that each state has a path history variable associated with it; thus states u and v at stage n−1 have the path history variables W
u,n−1
and W
v,n−1
, associated with them, respectively, where W
u,n−1
and W
v,n−1
are defmed by
W
u
,
n
-
1
=
∑
k
=
0
n
-
1
α
n
-
1
-
k
r
k
s
u
,
k
*
and
W
v
,
n
-
1
=
∑
k
=
0
n
-
1
α
n
-
1
-
k
r
k
s
v
,
k
*
,
and &agr; is a real number in the range 0≦&agr;≦1. For a particular state x, x &egr;{u, v}, the path history variable is a function of the winning path into state x, s
x,0
, s
x,1
, . . .s
x,n−1
, and the channel sample history r
0
, r
1
, . . . r
n−1
, r
n
; the path history variable for a particular path acts as a remodulated phase reference for that path and takes the place of the coherent phase reference term (e
J&THgr;
)*in steps (1)-(4) above.
The discussion will now turn to how to find the winning branch into state w at stage n, the winning path into state w, the winning path metric for state w, and the path history variable for state w at stage n, W
w,n
. The modified Viterbi algorithm proceeds in four steps:
(1a) Form two branch metrics
Re[r
n
s
u,n
*W*
u,n−1
], (6)
and
Re[r
n
s
v,n
*W
v,n−1
*] (7)
(2a) Use branch metric (6) to form a candidate path metric for the top path,
m
u
+Re[r
n
s
u,n
*W
u,n−1
*], (8)
and use branch metric (7) to form a candidate path metric for the bottom path,
m
v
+Re[r
n
s
v,n
*W
vn−1
*]. (9)
(3a) Compare (8) and (9) and select a winner, say (8).
(4a) Update state w at stage n. The winning path into state w at stage n is s
w,0
,s
w,1
, . . . s
w,n−1
,s
w,n
where
(s
w,0
,s
w,1
, . . . s
w,n−1
, s
w,n
)=(s
u,0
,s
u,1
, . . .s
u,n−1
, s
u,n
).
The winning path metric is
m
w
=m
u
+Re[r
n
s
u,n
*W
u,n−
*].
The winning path history variable is
Note that steps (1a)-(4a) are very similar to steps (1)-(4), with the path history variable taking the place of the coherent phase reference term (e
j&THgr;
)*.
Steps (1a)-(4a), illustrate one particular way of implementing trellis decod
Chin Stephen
Liu Shuwang
Stanford Telecommunications, Inc.
Townsend and Townsend / and Crew LLP
LandOfFree
Trellis decoding with multiple symbol noncoherent detection... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Trellis decoding with multiple symbol noncoherent detection..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trellis decoding with multiple symbol noncoherent detection... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2860369