US4823346AExpiredUtility

Maximum likelihood decoder

Assignee: HITACHI LTDPriority: Apr 16, 1986Filed: Apr 16, 1987Granted: Apr 18, 1989
Est. expiryApr 16, 2006(expired)· nominal 20-yr term from priority
H03M 13/25H04L 27/3438H03M 13/41
86
PatentIndex Score
48
Cited by
7
References
4
Claims

Abstract

A maximum likelihood decoder for decoding a code from a signal transmitted through quadrature amplitude modulation of a code including a convolutional code can decode at high speed and high accuracy with a simple hardware configuration. In the maximum likelihood decoding of the convolutional code, the metric processing is not carried out for all of the possible paths and states but a smaller number of path(s) (metric(s)) and state(s) (metric(s)) are selected in a descending order to determine survival paths.

Claims

exact text as granted — not AI-modified
We claim: 
     
       1. A maximum likelihood decoder comprising: a path metric decision circuit for determining path metric of (an) input signal(s) against (a) reference signal(s);   selection circuits for selecting n out of M (n<M) path metric determined by said path metric decision circuit in a descending order;   first memories for storing m state metric selected in a descending order from M (m<M) state of metric before one symbol interval;   first means for receiving the output of said selection circuits and the output of said first memories to determine a combination of states and paths to be operated;   second means for adding, comparing and selecting against the m states and n paths determined by said first means;   normalization means for normalizing the output of said second means and selecting the m state metric(s) at current time and storing the selected state metric(s) into said first memories;   a path memory for storing paths connected to the current state metric(s) determined by said second means as survival paths; and   a path tracing circuit for estimating a decoder output based on the survival paths stored in said path memory.   
     
     
       2. A maximum likelihood decoder according to claim 1 wherein said M, m and n meet; 0≦m<M,   1≦n<M, and   m+n≧2.   
     
     
       3. A maximum likelihood decoder according to claim 2 wherein M=8, and n=m=1, or m=0 and n=2. 
     
     
       4. A maximum likelihood decoder according to claim 1, further comprising: a domain decision circuit for receiving a signal produced by convolutionally coding only lower j bits out of k-bit information sequence (k≧2) into l (l>j) bits with non-converting i higher (i=k-j) bits to produce an (i+l)-bit convolutional code, and quadrature amplitude-modulating the convolutional code according to signal point mapping or constellation, dividing the two dimensional area of the signal point mapping into small domains, determining a small domain to which the received signal point belongs and supplying the received signal point and said domain to said path metric decision circuit; and   higher i bit decoding means for decoding the i bits based on the information on the domain to which the received point belongs produced by said domain decision circuit.

Join the waitlist — get patent alerts

Track US4823346A — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.