IP Library Granted Patent US 9,484,951
Granted Patent B2
US 9,484,951 · App. 14/541,794 · Granted Nov 1, 2016

Encoder that optimizes bit allocation for information sub-parts

Inventors: James P. Ashley (Naperville, IL); Udar Mittal (Hoffman Estates, IL)
Assignee: GOOGLE TECHNOLOGY HOLDINGS LLC
H03M7/4006H03M7/3082
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,484,951
App. No.
14/541,794
Granted
Nov 1, 2016
Kind
B2
Abstract

A digital information encoder including a divider configured to divide a block of information into a plurality of sub-parts, an initial bit allocator configured to perform an initial allocation of bits to a K TH sub-part of said plurality of sub-parts, a processor configured to compute an estimated number of bits for encoding said K TH sub-part, and a bit allocation adjuster configured to obtain an adjusted bit allocation for said K TH sub-part by adjusting said initial allocation of bits to said K TH sub-part based, at least in part, on said estimated number of bits, wherein the encoder encodes said K TH sub-part using said adjusted bit allocation for said K TH sub-part.

Claims (55)

1. A computer-implemented method comprising:

dividing a block of information into a plurality of sub-parts;

performing an initial allocation of bits to a K TH sub-part of the plurality of sub-parts; and

obtaining an adjusted bit allocation for the K TH sub-part.

2. The method of claim 1 , comprising:

encoding the K TH sub-part using the adjusted bit allocation for the K TH sub-part.

3. The method of claim 1 , wherein obtaining the adjusted bit allocation for the K TH sub-part is base at least in part on a bit requirement corresponding to a feasible integer parameter.

4. The method of claim 3 , comprising:

determining a feasible integer parameter of a combinatorial coding scheme; and

determining a bit requirement corresponding to the feasible integer parameter of the combinatorial coding scheme,

wherein the initial allocation is adjusted further based on the bit requirement to the feasible integer parameter of the combinatorial coding scheme.

5. The method of claim 1 , comprising:

computing an estimated number of bits for encoding the K TH sub-part,

wherein obtaining an adjusted bit allocation for the K TH sub-part based at least in part on the estimated number of bits.

6. The method of claim 1 , comprising:

determining a priority ordering for the plurality of sub-parts; and

performing, according to the priority ordering for each plurality of sub-parts, the initial allocation of bits to the K TH sub-part of the plurality of sub-parts.

7. The method of claim 6 , wherein the priority ordering for the plurality of sub-parts is based on an amount of information in each sub-part.

8. A system comprising:

one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:

dividing a block of information into a plurality of sub-parts;

performing an initial allocation of bits to a K TH sub-part of the plurality of sub-parts; and

obtaining an adjusted bit allocation for the K TH sub-part.

9. The system of claim 8 , wherein the operations further comprise:

encoding the K TH sub-part using the adjusted bit allocation for the K TH sub-part.

10. The system of claim 8 , wherein obtaining the adjusted bit allocation for the K TH sub-part is base at least in part on a bit requirement corresponding to a feasible integer parameter.

11. The system of claim 10 , wherein the operations further comprise:

determining a feasible integer parameter of a combinatorial coding scheme; and

determining a bit requirement corresponding to the feasible integer parameter of the combinatorial coding scheme,

wherein the initial allocation is adjusted further based on the bit requirement to the feasible integer parameter of the combinatorial coding scheme.

12. The system of claim 8 , wherein the operations further comprise:

computing an estimated number of bits for encoding the K TH sub-part,

wherein obtaining an adjusted bit allocation for the K TH sub-part based at least in part on the estimated number of bits.

13. The system of claim 8 , wherein the operations further comprise:

determining a priority ordering for the plurality of sub-parts; and

performing, according to the priority ordering for each plurality of sub-parts, the initial allocation of bits to the K TH sub-part of the plurality of sub-parts.

14. The system of claim 13 , wherein the priority ordering for the plurality of sub-parts is based on an amount of information in each sub-part.

15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:

dividing a block of information into a plurality of sub-parts;

performing an initial allocation of bits to a K TH sub-part of the plurality of sub-parts; and

obtaining an adjusted bit allocation for the K TH sub-part.

16. The medium of claim 15 , wherein the operations further comprise:

encoding the K TH sub-part using the adjusted bit allocation for the K TH sub-part.

17. The medium of claim 15 , wherein obtaining the adjusted bit allocation for the K TH sub-part is base at least in part on a bit requirement corresponding to a feasible integer parameter.

18. The medium of claim 17 , wherein the operations further comprise:

determining a feasible integer parameter of a combinatorial coding scheme; and

determining a bit requirement corresponding to the feasible integer parameter of the combinatorial coding scheme,

wherein the initial allocation is adjusted further based on the bit requirement to the feasible integer parameter of the combinatorial coding scheme.

19. The medium of claim 15 , wherein the operations further comprise:

computing an estimated number of bits for encoding the K TH sub-part,

wherein obtaining an adjusted bit allocation for the K TH sub-part based at least in part on the estimated number of bits.

20. The medium of claim 15 , wherein the operations further comprise:

determining a priority ordering for the plurality of sub-parts; and

performing, according to the priority ordering for each plurality of sub-parts, the initial allocation of bits to the K TH sub-part of the plurality of sub-parts.

21. The medium of claim 20 , wherein the priority ordering for the plurality of sub-parts is based on an amount of information in each sub-part.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2015
From: ASHLEY, JAMES P.; MITTAL, UDAR
To: MOTOROLA, INC.
Reel/Frame 034721/0280 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2015
From: MOTOROLA, INC.
To: MOTOROLA MOBILITY, INC.
Reel/Frame 034722/0001 →
CHANGE OF NAME Recorded Jan 15, 2015
From: MOTOROLA MOBILITY, INC.
To: MOTOROLA MOBILITY LLC
Reel/Frame 034767/0750 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 15, 2015
From: MOTOROLA MOBILITY LLC
To: GOOGLE TECHNOLOGY HOLDINGS LLC
Reel/Frame 034770/0001 →
Continuity (3)
Continuation 13481608 · May 25, 2012
Continuation 12607439 · Oct 28, 2009
Related Publication 20150109152A1 · Apr 23, 2015