Log in
Enquire now
‌

US Patent 7123668 Simple detector and method for QPSK symbols

Patent 7123668 was granted and assigned to Agere Systems on October, 2006 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent

Patent attributes

Current Assignee
Agere Systems
Agere Systems
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
7123668
Patent Inventor Names
Lisa Fredrickson0
Date of Patent
October 17, 2006
Patent Application Number
10251777
Date Filed
September 23, 2002
Patent Primary Examiner
‌
Young T. Tse
Patent abstract

A simplified Viterbi detector for maximum likelihood detection of nine-bit QPSK symbols, employing a difference metric and two comparators, instead of using two state metrics and four comparators. The detector is used to process the outputs of synchronously sampled matched filters. A multiplexer is employed to select the difference metric from amongst the input sample, the fed back value of the difference metric itself, or the inverses of either, depending on decision signals output from the comparators, which in turn compare the difference metric with the input sample and it's inverse. The even path history then represents the most likely value of the detected symbol.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 7123668 Simple detector and method for QPSK symbols

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.