公开(公告)号：JP2001267936A

公开(公告)日：2001-09-28

申请号：JP2001033290

申请日：2001-02-09

Applicant: MOTOROLA INC

Inventor： CLASSON BRIAN K ,  TERRY M SCHAFFNER ,  VIPURU A DESAI

IPC: G06F11/10 ,  H03M13/23 ,  H03M13/41

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.

公开(公告)号：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

IPC: G06F11/10 ,  H03M13/23 ,  H03M13/41 ,  H03M13/45

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.