Cascaded viterbi bitstream generator

US9385837B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9385837-B2
Application numberUS-201314380880-A
CountryUS
Kind codeB2
Filing dateJan 18, 2013
Priority dateJan 18, 2013
Publication dateJul 5, 2016
Grant dateJul 5, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A bitstream generator includes at least first and second bitstream generator stages connected in a cascaded arrangement. The first bitstream generator stage includes a first adder which receives an input signal and generates a first error signal indicative of a difference between the input signal and a first bitstream candidate representing a closest approximation to the input signal among multiple bitstream candidates generated by the first bitstream generator stage. The second bitstream generator stage includes a second adder which receives the first error signal and generates a second error signal indicative of a difference between the first error signal and a second bitstream candidate representing a closest approximation to the input signal among multiple bitstream candidates generated by the second bitstream generator stage. A third adder in the bitstream generator receives the first and second bitstream candidates and generates an output signal more closely approximating the input signal.

First claim

Opening claim text (preview).

What is claimed is: 1. A bitstream generator, comprising: at least first and second bitstream generator stages connected in a cascaded arrangement, the first bitstream generator stage including a first adder adapted to receive an input signal supplied to the bitstream generator and operative to generate a first error signal indicative of a difference between the input signal and a first bitstream candidate that represents a closest approximation to the input signal among a plurality of bitstream candidates generated by the first bitstream generator stage, the second bitstream generator stage including a second adder adapted to receive the first error signal generated by the first adder and operative to generate a second error signal indicative of a difference between the first error signal and a second bitstream candidate that represents a closest approximation to the first error signal among a plurality of bitstream candidates generated by the second bitstream generator stage; and a third adder adapted to receive first and second output signals generated by the first and second bitstream generator stages, respectively, and operative to generate a global output signal of the bitstream generator that more closely approximates the input signal compared to the first output signal generated by the first bitstream generator stage, wherein the bitstream generator comprises a combination of software and hardware. 2. The bitstream generator of claim 1 , wherein the first bitstream generator stage further comprises a loop filter having an input adapted to receive the first error signal and operative to generate a filtered error signal. 3. The bitstream generator of claim 2 , wherein the first bitstream generator stage further comprises a sorter coupled with an output of the loop filter, the sorter being operative to arrange the plurality of bitstream candidates generated by the first bitstream generator stage as a function of a magnitude of error and to select a bitstream candidate having a minimum error value among the plurality of bitstream candidates generated by the first bitstream generator stage. 4. The bitstream generator of claim 1 , wherein the first bitstream generator stage further comprises a Viterbi decoder operative to generate the plurality of bitstream candidates generated by the first bitstream generator stage, to store at least a subset of the plurality of bitstream candidates generated by the first bitstream generator stage, and to select, from the plurality of bitstream candidates generated by the first bitstream generator stage, the first bitstream candidate having a magnitude of error which is lower than other bitstream candidates generated by the first bitstream generator stage. 5. The bitstream generator of claim 3 , wherein the second bitstream generator stage further comprises a loop filter having an input adapted to receive the second error signal and operative to generate a filtered error signal. 6. The bitstream generator of claim 5 , wherein the second bitstream generator stage further comprises a sorter coupled with an output of the loop filter, the sorter being operative to arrange the plurality of bitstream candidates generated by the second bitstream generator stage as a function of a magnitude of error and to select a bitstream candidate having a minimum error value among the plurality of bitstream candidates generated by the second bitstream generator stage. 7. The bitstream generator of claim 5 , wherein a transfer function of the loop filter in the second bitstream generator stage is configured so as to substantially cancel noise-shaped truncation error generated by the first bitstream generator stage. 8. The bitstream generator of claim 1 , wherein the second bitstream generator stage further comprises a Viterbi decoder operative to generate the plurality of bitstream candidates generated by the second bitstream generator stage, to store at least a subset of the plurality of bitstream candidates generated by the second bitstream generator stage, and to select, from the plurality of bitstream candidates generated by the second bitstream generator stage, the second bitstream candidate having a magnitude of error which is lower than other bitstream candidates generated by the second bitstream generator stage. 9. The bitstream generator of claim 1 , further comprising a third bitstream generator stage, the third bitstream generator stage including a fourth adder adapted to receive the second error signal generated by the second adder and operative to generate a third error signal indicative of a difference between the second error signal and a third bitstream candidate that represents a closest approximation to an input signal supplied to the third bitstream generator stage among a plurality of bitstream candidates generated by the third bitstream generator stage. 10. The bitstream generator of claim 9 , wherein the third bitstream generator stage further comprises: a loop filter having an input adapted to receive the third error signal and operative to generate a filtered error signal; and a sorter coupled with an output of the loop filter, the sorter being operative to arrange the plurality of bitstream candidates generated by the third bitstream generator stage as a function of a magnitude of error and to select a bitstream candidate having a minimum error value among the plurality of bitstream candidates generated by the third bitstream generator stage. 11. The bitstream generator of claim 9 , wherein the third bitstream generator stage further comprises a Viterbi decoder operative to generate the plurality of bitstream candidates generated by the third bitstream generator stage, to store at least a subset of the plurality of bitstream candidates generated by the third bitstream generator stage, and to select, from the plurality of bitstream candidates generated by the third bitstream generator stage, the third bitstream candidate having a magnitude of error which is lower than other bitstream candidates generated by the third bitstream generator stage. 12. The bitstream generator of claim 1 , wherein each of the first and second bitstream generator stages comprises a single-loop Viterbi bitstream generator. 13. The bitstream generator of claim 1 , wherein the second bitstream generator stage is configured such that noise-shaped truncation error generated by the first bitstream generator stage is cancelled. 14. The bitstream generator of claim 1 , wherein the second bitstream generator stage is configured such that noise-shaped truncation error generated by the first bitstream generator stage is at least reduced. 15. The bitstream generator of claim 1 , wherein at least a portion of the bitstream generator is fabricated in at least one integrated circuit. 16. An electronic system, comprising: an integrated circuit including at least one bitstream generator, the at least one bitstream generator comprising: at least first and second bitstream generator stages connected in a cascaded arrangement, the first bitstream generator stage including a first adder adapted to receive an input signal supplied to the bitstream generator and operative to generate a first error signal indicative of a difference between the input signal and a first bitstream candidate that represents a closest approximation to the input signal among a plurality of bitstream candidates generated by the first bitstream generator stage, the second bitstream generator stage including a second adder adapted to receive the first error signal generated by the first adder and operative to generate a second error signal indicati

Assignees

Inventors

Classifications

  • using convolutional codes, e.g. unit memory codes · CPC title

  • using the Viterbi algorithm or Viterbi processors · CPC title

  • Complex mathematical operations {(function generation by table look-up G06F1/03; evaluation of elementary functions by calculation G06F7/544)} · CPC title

  • H03M7/3022Primary

    having multiple quantisers arranged in cascaded loops, each of the second and further loops processing the quantisation error of the loop preceding it, i.e. multiple stage noise shaping [MASH] type · CPC title

  • H04L1/0059Primary

    Convolutional codes · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9385837B2 cover?
A bitstream generator includes at least first and second bitstream generator stages connected in a cascaded arrangement. The first bitstream generator stage includes a first adder which receives an input signal and generates a first error signal indicative of a difference between the input signal and a first bitstream candidate representing a closest approximation to the input signal among mult…
Who is the assignee on this patent?
Lsi Corp, Avago Technologies General Ip
What technology area does this patent fall under?
Primary CPC classification H03M7/3022. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Jul 05 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).