The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 20, 2011

Filed:

May. 04, 2007
Applicants:

Maria Laprade, Palm Bay, FL (US);

Matthew C. Cobb, W. Melbourne, FL (US);

Timothy F. Dyson, Melbourne, FL (US);

Inventors:

Maria Laprade, Palm Bay, FL (US);

Matthew C. Cobb, W. Melbourne, FL (US);

Timothy F. Dyson, Melbourne, FL (US);

Assignee:

Harris Corporation, Melbourne, FL (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
H03M 13/00 (2006.01); H03M 13/03 (2006.01);
U.S. Cl.
CPC ...
Abstract

A Serially Concatenated Convolutional Code (SCCC) decoding system includes an outer decoder module (), permutation module (), and data store (). The outer decoder module is configured to generate a first sequence of soft-decision bits x[n] for n=0, 1, 2, . . . , N−1. The permutation module is configured to permute the first sequence of soft-decision bits x[n] to generate a second sequence of soft-decision bits y[n]. The first sequence of soft-decision bits x[n] is generated by the outer decoder module in accordance with a mapping v[n]. The second sequence of soft-decision bits y[n] is generated for communication to an inner decoder module (). The data store contains a mapping v[n]. The mapping v[n] satisfies a mathematical equation v[k+m·(N/M)] modulo (N/M)=v[k] modulo (N/M) for m=0, . . . , M−1 and k=0, . . . , (N/M−1). (NM) is an integer.


Find Patent Forward Citations

Loading…