IP Library Granted Patent US 9,596,470
Granted Patent B1
US 9,596,470 · App. 14/048,307 · Granted Mar 14, 2017

Tree-coded video compression with coupled pipelines

Inventors: Leslie D. Kohn (Saratoga, CA); Ellen M. Lee (Saratoga, CA); Peter Verplaetse (Redwood City, CA)
Assignee: Ambarella, Inc.
H04N19/00969
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,596,470
App. No.
14/048,307
Granted
Mar 14, 2017
Kind
B1
Abstract

An apparatus having a circuit and a processor is disclosed. The circuit may be configured to (i) generate a plurality of sets of coefficients by compressing a block in a picture in a video signal at a plurality of different sizes of coding units in a coding tree unit and (ii) generate an output signal by entropy encoding a particular one of the sets of coefficients. Each set of coefficients may be generated in a corresponding one of a plurality of pipelines that operate in parallel. The processor may be configured to select the particular set of coefficients in response to the compressing.

Claims (27)

1. An apparatus comprising:

a circuit configured to (i) generate a plurality of sets of coefficients by compressing a tile in a picture in a video signal at each of a plurality of different sizes of a plurality of coding units in a coding tree unit and (ii) generate an output signal by entropy encoding a particular one of said sets of coefficients, wherein (a) said sets of coefficients are generated at two or more of said different sizes of said coding units in parallel, (b) each of said sets of coefficients is generated in a corresponding one of a plurality of pipelines that operate in parallel, (c) each of said sets of coefficients has a same number of said coefficients and (d) each of said sets of coefficients represents said tile with a different number of said coding units; and

a processor configured to select said particular set of coefficients in response to said compression of said tile.

2. The apparatus according to claim 1 , wherein said circuit is further configured to load a reference picture in parallel from a shared portion of said pipelines into separate ones of said pipelines.

3. The apparatus according to claim 1 , wherein each one of said pipelines compresses said tile at a respective one of said different sizes of said coding units in parallel.

4. The apparatus according to claim 1 , wherein each one of said pipelines finishes said compression of said tile at said different sizes of said coding units at approximately a same time.

5. The apparatus according to claim 1 , wherein (i) a first of said pipelines compresses said tile at said two or more of said different sizes of said coding units in a time multiplexed sequence and (ii) said first pipeline finishes said compression of said tile at said two or more different sizes of said coding units and a second of said pipelines finishes said compression of said tile at another of said different sizes of said coding units at approximately a same time.

6. The apparatus according to claim 1 , where said pipelines have a common stage.

7. The apparatus according to claim 1 , wherein each one of said pipelines interleaves compression of said tile with compression of another tile in said picture.

8. The apparatus according to claim 1 , wherein said output signal is compliant with an International Telecommunication Union-Telecommunications Recommendation H.265.

9. The apparatus according to claim 1 , wherein each of said pipelines has a number of unique stages that is prime with respect to a tree branching factor.

10. A method for tree-coded video compression with coupled pipelines, comprising the steps of:

generating a plurality of sets of coefficients by compressing a tile in a picture in a video signal at each of a plurality of different sizes of a plurality of coding units in a coding tree unit, wherein (i) said sets of coefficients are generated at two or more of said different sizes of said coding units in parallel, (ii) each of said sets of coefficients is generated in a corresponding one of a plurality of said pipelines that operate in parallel, (iii) each of said sets of coefficients has a same number of said coefficients and (iv) each of said sets of coefficients represents said tile with a different number of said coding units;

selecting a particular one of said sets of coefficients in response to said compression of said tile; and

generating an output signal by entropy encoding said particular set of coefficients.

11. The method according to claim 10 , further comprising the step of:

loading a reference picture in parallel from a shared portion of said pipelines into separate ones of said pipelines.

12. The method according to claim 10 , wherein each one of said pipelines compresses said tile at a respective one of said different sizes of said coding units in parallel.

13. The method according to claim 10 , wherein each one of said pipelines finishes said compression of said tile at said different sizes of said coding units at approximately a same time.

14. The method according to claim 10 , wherein (i) a first of said pipelines compresses said tile at said two or more of said different sizes of said coding units in a time multiplexed sequence and (ii) said first pipeline finishes said compression of said tile at said two or more different sizes of said coding units and a second of said pipelines finishes said compression of said tile at another of said different sizes of said coding units at approximately a same time.

15. The method according to claim 10 , where said pipelines have a common stage.

16. The method according to claim 10 , wherein each one of said pipelines interleaves compression of said tile with compression of another tile in said picture.

17. The method according to claim 10 , wherein each of said pipelines has a number of unique stages that is prime with respect to a tree branching factor.

18. An apparatus comprising:

means for generating a plurality of sets of coefficients by compressing a tile in a picture in a video signal at each of a plurality of different sizes of a plurality of coding units in a coding tree unit, wherein (i) said sets of coefficients are generated at two or more of said different sizes of said coding units in parallel, (ii) each of said sets of coefficients is generated in a corresponding one of a plurality of pipelines that operate in parallel, (iii) each of said sets of coefficients has a same number of said coefficients and (iv) each of said sets of coefficients represents said tile with a different number of said coding units;

means for selecting a particular one of said sets of coefficients in response to said compression of said tile; and

means for generating an output signal by entropy encoding said particular set of coefficients.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 5, 2020
From: AMBARELLA, INC.
To: AMBARELLA INTERNATIONAL LP
Reel/Frame 051831/0041 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 8, 2013
From: KOHN, LESLIE D.; LEE, ELLEN M.; VERPLAETSE, PETER
To: AMBARELLA, INC.
Reel/Frame 031363/0042 →
Continuity (1)
Provisional Application 61883402 · Sep 27, 2013