Log in
Enquire now
‌

US Patent 8000967 Low-complexity code excited linear prediction encoding

OverviewStructured DataIssuesContributors

Contents

Patent abstractTimelineTable: Further ResourcesReferences
Is a
Patent
Patent

Patent attributes

Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
8000967
Date of Patent
August 16, 2011
Patent Application Number
11074928
Date Filed
March 9, 2005
Patent Primary Examiner
‌
Jakieda R Jackson
Patent abstract

Information about excitation signals of a first signal encoded by CELP is used to derive a limited set of candidate excitation signals for a second correlated second signal. Preferably, pulse locations of the excitation signals of the first encoded signal are used for determining the set of candidate excitation signals. More preferably, the pulse locations of the set of candidate excitation signals are positioned in the vicinity of the pulse locations of the excitation signals of the first encoded signal. The first and second signals may be multi-channel signals of a common speech or audio signal. However, the first and second signals may also be identical, whereby the coding of the second signal can be utilized for re-encoding at a lower bit rate.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 8000967 Low-complexity code excited linear prediction encoding

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.