Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
10/29/09 - USPTO Class 714 |  12 views | #20090271686 | Prev - Next | About this Page  714 rss/xml feed  monitor keywords

Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding

USPTO Application #: 20090271686
Title: Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding
Abstract: Received communication signals may be decoded according to a combined turbo-RS (Reed-Solomon) decoding technique. The turbo decoding is based on information produced by the RS decoding. (end of abstract)



Agent: Qualcomm Incorporated - San Diego, CA, US
Inventors: Jing Jiang, Jing Jiang, Fuyun Ling, Fuyun Ling, Thomas Sun, Thomas Sun, Tao Tian, Tao Tian, Raghuraman Krishnamoorthi, Raghuraman Krishnamoorthi, Kent Walker, Kent Walker
USPTO Applicaton #: 20090271686 - Class: 714784 (USPTO)

Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20090271686, Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords RELATED APPLICATIONS

This application claims the benefit of priority from U.S. Provisional Patent Application Ser. No. 61/048,483, filed Apr. 28, 2008 and entitled “Interactive Soft Input Decoding of Outer Block Codes and Inner Codes In Concatenated Systems,” which is fully incorporated herein by reference for all purposes.

BACKGROUND

1. Field

The present disclosure relates generally to communications and, more particularly, to coding/decoding schemes for use in communications.

2. Background

The documents listed below are incorporated herein by reference:

    • [1] S. Lin and D. J. Costello, “Error Control Coding: Fundamentals and Applications”, 1st ed. Prentice Hall, 1983.
    • [2] G. D. Forney, “Generalized minimum distance decoding,” IEEE Trans. Information Theory, vol. 12, pp. 125-131, April 1996.
    • [3] D. Chase, “Class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Information Theory, vol. 18, pp. 170-182, January 1972.
    • [4] M. P. C. Fossorier and S. Lin, “Soft-decision decoding of linear block codes based on ordered statistics,” IEEE Trans. Information Theory, vol. 41, pp. 1379-1396, September 1995.
    • [5] R. Koetter and A. Vardy, “Algebraic soft-decision decoding of Reed-Solomon codes,” IEEE Transactions on Information Theory, vol. 49, pp. 2809-2825, November 2003.
    • [6] A. Vardy and Y. Be\'ery, “Bit-level soft-decision decoding of Reed-Solomon codes,” IEEE Trans. Communications, vol. 39, pp. 440-444, March 1991.
    • [7] J. Jiang and K. R. Narayanan, “Iterative soft-input-soft-output decoding of Reed-Solomon codes by adapting the parity check matrix,” IEEE Trans. Information Theory, vol. 52, no. 8, pp. 3746-3756, August 2006.
    • [8] J. Jiang, “Advanced Channel Coding Techniques Using Bit-level Soft Information,” Ph.D dissertation, Dept. of ECE, Texas A&M University.
    • [9] Jason Bellorado, Aleksandar Kavcic, Li Ping, “Soft-Input, Iterative, Reed-Solomon Decoding using Redundant Parity-Check Equations”, Invited paper, IEEE Inform. Theory Workshop (ITW), Lake Tahoe, Calif., USA, Sep. 2-6, 2007
    • [10] T. J. Richardson, A. Shokrollahi, and R. Urbanke, “Design of capacity-approaching low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, February 2001.
    • [11] D. J. C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, March 1999.


    • Continue reading about Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding...
      Full patent description for Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding

      Brief Patent Description - Full Patent Description - Patent Application Claims

      Click on the above for other options relating to this Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding patent application.
      ###
      monitor keywords

      How KEYWORD MONITOR works... a FREE service from FreshPatents
      1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
      3. Each week you receive an email with patent applications related to your keywords.  
      Start now! - Receive info on patent apps like Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding or other areas of interest.
      ###


      Previous Patent Application:
      Communication signal decoding with iterative cooperation between inner and outer codes
      Next Patent Application:
      Transmitting/receiving system and method of processing data in the transmitting/receiving system
      Industry Class:
      Error detection/correction and fault detection/recovery

      ###

      FreshPatents.com Support
      Thank you for viewing the Communication signal decoding with iterative cooperation between turbo and reed-solomon decoding patent info.
      IP-related news and info


      Results in 2.15651 seconds


      Other interesting Feshpatents.com categories:
      Canon USA , Celera Genomics , Cephalon, Inc. , Cingular Wireless , Clorox , Colgate-Palmolive , Corning , Cymer , paws
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO