-
公开(公告)号：JP2001267936A
公开(公告)日：2001-09-28
申请号：JP2001033290
申请日：2001-02-09
Applicant: MOTOROLA INC
Inventor： CLASSON BRIAN K , TERRY M SCHAFFNER , VIPURU A DESAI
Abstract: PROBLEM TO BE SOLVED: To provide a soft decision output decoder for convolution coding that decodes a signal expressed in a grating with a block length N divided into windows with a length of L. SOLUTION: The decoding of a signal expressed in a grating with a block length N divided into windows having a length of L includes a step (206) where forward recursions from a point P1 before the first window to the first window are forwardly decoded and a step where reverse recursions from a point P2 after the last window to the last window are reversely decoded so as to define a known state for the first and the last window. The decoding also includes a step (208) where the signal expressed in the window from the known state in the last window until the start point of the window reversely by suing the reverse recursions to decide a reverse recursion state metric set, a step (210) where the the first window until the last point of the window forwardly by using the forward recursions to decide a forward recursion state metric set, and a step (212) a soft output in each state of the window and a branch metric in each state are calculated by using the forward and reverse recursion state metrics to provide an output of a soft output with respect to each state.
-
公开(公告)号：JPH11234144A
公开(公告)日：1999-08-27
申请号：JP21189098
申请日：1998-07-09
Applicant: MOTOROLA INC
Inventor： THEODORE A TROST , TERRY M SCHAFFNER
Abstract: PROBLEM TO BE SOLVED: To efficiently generate a re-encoding history data bit by convolution- encoding each data bit of a data clock to a branch word for transmission, fixing the required number of re-encoding history data bits based on the position of the decoded branch word and selecting the combination of the data bits for a previously decoded data bit sequence. SOLUTION: A most likely decoder 100 receives and decodes a matrix 102 interleaved with plural branch words. Each time of decoding one of the branch words, a composite data but is shifted into a sequence to generate a history data bit sequence as data 107. A re-encoding history data bit generator 101 selects the combination of data bits at a prescribed position within the history data bit sequence with respect to the position of a decoded data but finally shifted into the sequence, re-encodes the selected combination and outputs it as the re-encoding history data bit.
-
公开(公告)号：JP2001267937A
公开(公告)日：2001-09-28
申请号：JP2001033291
申请日：2001-02-09
Applicant: MOTOROLA INC
Inventor： CLASSON BRIAN K , TERRY M SCHAFFNER , VIPURU A DESAI , JAMES C BAKER , DANIEL M FRIEND
Abstract: PROBLEM TO BE SOLVED: To provide a soft decision output decoder for convolution coding that decodes a signal expressed in a grating with a block length N divided into windows with a length of L. SOLUTION: The decoding of a signal expressed in a grating with a block length N divided into windows having a length of L includes a step (206) where reverse recursions from a point P after the last window to the last window are reversely decoded and a point is selected for the point P at a distance sufficiently apart from the last window so that the reverse recursions decides a known state metric at the last window. The decoding also includes a step (208) where the signal is expressed in the window from the known state in the last window until the start point of the window reversely by using the reverse recursions to decide a reverse recursion state metric set to be stored, a step where a known state in the first window is decoded until the last point of the window forwardly by using the forward recursions, and a step (212) where a soft output in each stage of the forward recursions is calculated by using the reverse recursion state metric to be stored and a branch metric in each stage to provide the soft output of each stage.
-
-
Search Results
3
records
(took 0.021 seconds)
