Patents by Inventor Maria Laprade

Maria Laprade has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8024636
    Abstract: A Serially Concatenated Convolutional Code (SCCC) decoding system includes an outer decoder module (208), permutation module (104), and data store (114). 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 (204). 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.
    Type: Grant
    Filed: May 4, 2007
    Date of Patent: September 20, 2011
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Patent number: 7991082
    Abstract: A method is provided for performing a MAP probability decoding of a sequence R(n) including N bits of encoded data. The method includes the steps of: (a) generating a sequence rn of sot-values by processing the sequence R(n); (b) performing a forward recursion by computing alpha values ?S,SG utilizing the soft-decision values; (c) performing a backward recursion by computing beta values ?S,SG utilizing the soft-decision values; and (d) performing an extrinsic computation by computing probability values p?k. The alpha values ?S,SG are relative log-likelihoods of an encoding process arriving at various states. The beta values ?S,SG are relative log-likelihoods of the encoding process arriving at various states. The probability values p?k represent a set of probabilities indicating that each data bit of an input sequence dK had a value equal to zero or one. The sequence R(n) represents an encoded form of the input sequence dK.
    Type: Grant
    Filed: October 31, 2007
    Date of Patent: August 2, 2011
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Patent number: 7904784
    Abstract: A serial concatenated convolutional code (SCCC) decoder is provided. The SCCC decoder includes an input buffer memory one or more processing loop modules, and an output buffer memory. Each processing loop module includes a permutation module, inner decoding engines, a depermutation module, and outer decoding engines. The depermutation module includes a concatenating device and two or more depermutation buffer memories. The concatenating device is configured for writing a codeword segment containing a plurality of soft-decision bits to each of the depermutation buffer memories in a single write operation. The permutation module also includes a concatenating device and two or more permutation buffer memories. The concatenating device is configured for writing a codeword segment containing a plurality of soft-decision bits to each of the depermutation buffer memories in a single write operation.
    Type: Grant
    Filed: March 14, 2007
    Date of Patent: March 8, 2011
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Patent number: 7870458
    Abstract: A decoding system (100) is provided. The decoding system is comprised of two or more serial concatenated convolutional code (SCCC) decoders (1021-102N) operating in parallel. The SCCC decoders are configured to concurrently decode codeblocks which have been encoded using a convolutational code. The decoding system is also comprised of a single common address generator (108) and data store (114). The address generator is responsive to requests for data needed by two or more of the SCCC decoders for permutation and depermutation. The data store is comprised of two or more memory blocks (1161-116K). The SCCC decoders concurrently generate requests for two or more different data types. Selected ones of the different data types are exclusively stored in different ones of the memory blocks. Selected ones of the different data types are comprised of data which is requested at the same time by a particular one of the SCCC decoders.
    Type: Grant
    Filed: March 14, 2007
    Date of Patent: January 11, 2011
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Patent number: 7770087
    Abstract: A serial concatenated convolutional code (SCCC) decoder is provided. The SCCC decoder is comprised of an input buffer memory (102), one or more processing loop modules (120), and an output buffer memory (112). Each processing loop module is comprised of a permutation module (110), an inner decoder module (104), a depermutation module (106), and an outer decoder module (108). The inner decoder module is subdivided into two (2) or more inner decoding engines (2021-202N) configured for concurrently performing a decoding operation based on an inner convolutional code. The outer decoder module is subdivided into two (2) or more outer decoding engines (4021-402N) configured for concurrently performing a decoding operation based on an outer convolutional code. The inner convolutional code and the outer convolutional code are designed in accordance with a maximum aposteriori probability based decoding algorithm.
    Type: Grant
    Filed: January 19, 2007
    Date of Patent: August 3, 2010
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Publication number: 20100031122
    Abstract: An SCCC decoding system is provided. The system is comprised of an outer decoder module (208), permutation module (104), and data store (114). 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 (204). 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), (N/M) is an integer.
    Type: Application
    Filed: May 4, 2007
    Publication date: February 4, 2010
    Applicant: HARRIS CORPORATION
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Publication number: 20090110125
    Abstract: A method is provided for performing a MAP probability decoding of a sequence R(n) including N bits of encoded data. The method includes the steps of: (a) generating a sequence rn of sot-values by processing the sequence R(n); (b) performing a forward recursion by computing alpha values ?S,SG utilizing the soft-decision values; (c) performing a backward recursion by computing beta values ?S,SG utilizing the soft-decision values; and (d) performing an extrinsic computation by computing probability values p?k. The alpha values ?S,SG are relative log-likelihoods of an encoding process arriving at various states. The beta values ?S,SG are relative log-likelihoods of the encoding process arriving at various states. The probability values p?k represent a set of probabilities indicating that each data bit of an input sequence dK had a value equal to zero or one. The sequence R(n) represents an encoded form of the input sequence dK.
    Type: Application
    Filed: October 31, 2007
    Publication date: April 30, 2009
    Applicant: HARRIS CORPORATION
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Publication number: 20080229171
    Abstract: A serial concatenated convolutional code (SCCC) decoder is provided. The SCCC decoder is comprised of an input buffer memory (102), one or more processing loop modules (120), and an output buffer memory (112). Each processing loop module is comprised of a permutation module (110), inner decoding engines (2021-202N); a depermutation module (106), and outer decoding engines (4021-402N). The depermutation module is comprised of a concatenating device (304) and two or more depermutation buffer memories (3061-306N). The concatenating device is configured for writing a codeword segment containing a plurality of soft-decision bits to each of the depermutation buffer memories in a single write operation. The permutation module is also comprised of a concatenating device (504) and two or more permutation buffer memories (5061-506N). The concatenating device is configured for writing a codeword segment containing a plurality of soft-decision bits to each of the depermutation buffer memories in a single write operation.
    Type: Application
    Filed: March 14, 2007
    Publication date: September 18, 2008
    Applicant: HARRIS CORPORATION
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Publication number: 20080229170
    Abstract: A decoding system (100) is provided. The decoding system is comprised of two or more serial concatenated convolution code (SCCC) decoders (1021-102N) operating in parallel. The SCCC decoders are configured to concurrently decode codebocks which have been encoded using a convolutional code. The decoding system is also comprised of a single common address generator (108) and data store (114). The address generator is responsive to requests for data needed by two or more of the SCCC decoders for permutation and depermutation. The data store is comprised of two or more memory blocks (1161-116K). The SCCC decoders concurrently generate requests for two or more different data types. Selected ones of the different data types are exclusively stored in different ones of the memory blocks. Selected ones of the different data types are comprised of data which is requested at the same time by a particular one of the SCCC decoders.
    Type: Application
    Filed: March 14, 2007
    Publication date: September 18, 2008
    Applicant: HARRIS CORPORATION
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Publication number: 20080177895
    Abstract: A serial concatenated convolutional code (SCCC) decoder is provided. The SCCC decoder is comprised of an input buffer memory (102), one or more processing loop modules (120), and an output buffer memory (112). Each processing loop module is comprised of a permutation module (110), an inner decoder module (104), a depermutation module (106), and an outer decoder module (108), The inner decoder module is subdivided into two (2) or more inner decoding engines (2021-202N) configured for concurrently performing a decoding operation based on an inner convolutional code. The outer decoder module is subdivided into two (2) or more outer decoding engines (4021-402n) configured for concurrently performing a decoding operation based on an outer convolutional code. The inner convolutional code and the outer convolutional code are designed in accordance with a maximum aposteriori probability based decoding algorithm.
    Type: Application
    Filed: January 19, 2007
    Publication date: July 24, 2008
    Applicant: HARRIS CORPORATION
    Inventors: Maria Laprade, Matthew C. Cobb, Timothy F. Dyson
  • Patent number: 5193179
    Abstract: An activity monitor for monitoring activity on a bus connecting a plurality of processors, monitors the bus to determine the bus master and other bus activities. In response thereto, predetermined memory locations are enabled to count events on the bus or calculate time spans for various bus activities.
    Type: Grant
    Filed: March 5, 1991
    Date of Patent: March 9, 1993
    Assignee: Harris Corporation
    Inventors: Maria Laprade, Thomas L. Sterling