Log in
Enquire now
‌

US Patent 7340671 Decoding low density parity codes

Patent 7340671 was granted and assigned to Regents of the University of California on March, 2008 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent

Patent attributes

Current Assignee
Regents of the University of California
Regents of the University of California
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
7340671
Patent Inventor Names
Christopher R. Jones0
John D. Villasenor0
Date of Patent
March 4, 2008
Patent Application Number
10961132
Date Filed
October 8, 2004
Patent Primary Examiner
‌
Shelly Chase
Patent abstract

The present invention includes a technique for updating messages that originate at the constraint nodes of bi-partite graphs in Low Density Parity Check codes. The technique computes only two outgoing magnitudes at each constraint node and exhibits no measurable performance loss as compared to exact belief propagation which computes a unique magnitude for each departing edge from a given constraint node. The technique eliminates the need for memory based table look-up in the constraint node processing and has been implemented, in one embodiment, using only shift, add, and comparison operations.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 7340671 Decoding low density parity codes

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.