Method for parallelly processing at least two binary values and corresponding arithmetic coding system
Method for parallelly processing at least two binary values and corresponding arithmetic coding system
 CN 101,414,830 A
 Filed: 04/22/2008
 Published: 04/22/2009
 Est. Priority Date: 10/16/2007
 Status: Active Application
First Claim
1. the method for a parallelly processing at least two binary values, it is used in the electronic installation, and the binary value string is carried out arithmetic coding, and said method comprises:
 Utilize present scope to calculate the scope of first binary value in the abovementioned binary value string;
When abovementioned first binary value is most possible symbol, utilize abovementioned present scope while forward direction to estimate a plurality of possible scope and the floor value of second binary value in the abovementioned binary value string;
AndWhen the scope of abovementioned first binary value calculates, utilize scope that aforementioned calculation goes out from abovementioned a plurality of possible scopes and floor value, to select the range of results of abovementioned second binary value.
Chinese PRB Reexamination
Abstract
A method for performing parallel processing of at least two bins in an arithmetic coded bin stream includes: utilizing a current range to calculate a range for a first bin in the bin stream; simultaneously utilizing the current range to forward predict a plurality of possible ranges and low values for a second bin in the bin stream when the first bin is an MPS; when the range for the first bin is calculated, utilizing the calculated range to select a resultant range from the plurality of possible ranges and low values for the second bin. The invention increases the number of the two bins through coding at least two bins in parallel, thereby increasing system output.
17 Claims

1. the method for a parallelly processing at least two binary values, it is used in the electronic installation, and the binary value string is carried out arithmetic coding, and said method comprises:

Utilize present scope to calculate the scope of first binary value in the abovementioned binary value string; When abovementioned first binary value is most possible symbol, utilize abovementioned present scope while forward direction to estimate a plurality of possible scope and the floor value of second binary value in the abovementioned binary value string;
AndWhen the scope of abovementioned first binary value calculates, utilize scope that aforementioned calculation goes out from abovementioned a plurality of possible scopes and floor value, to select the range of results of abovementioned second binary value.


2. the method for parallelly processing at least two binary values as claimed in claim 1, it is characterized in that the abovementioned scope of first binary value that aforementioned calculation goes out of utilizing selects the step of the The above results scope of abovementioned second binary value more to comprise from abovementioned a plurality of possible scopes:
Utilize the value of the highest significant position of The above results scope to come the optionally The above results scope of abovementioned second binary value of renormalization.

3. the method for parallelly processing at least two binary values as claimed in claim 1, it is characterized in that, abovementioned utilize abovementioned present scope simultaneously forward direction estimate that the abovementioned a plurality of possible scope of abovementioned second binary value and the step of floor value more comprise in a plurality of abovementioned binary value strings:
Utilize the value of the highest significant position of each abovementioned a plurality of possible scope to come optionally each possible scope of renormalization.

4. the method for parallelly processing at least two binary values as claimed in claim 1 is characterized in that, abovementioned arithmetic coding is to be applied in one H.264 in the system.

5. the method for parallelly processing at least two binary values as claimed in claim 1 is characterized in that, the abovementioned step of utilizing abovementioned present scope to calculate the abovementioned scope of abovementioned first binary value in the abovementioned binary value string more comprises:

Utilize present floor value and abovementioned present scope to calculate the floor value of abovementioned first binary value;
AndAbovementioned utilize abovementioned present scope simultaneously forward direction estimate the abovementioned a plurality of possible scope of second binary value in the abovementioned binary value string and the step of floor value more comprises; Utilize abovementioned present floor value and abovementioned present scope to come forward direction to estimate abovementioned a plurality of possible floor value of abovementioned second binary value simultaneously.


6. the method for parallelly processing at least two binary values as claimed in claim 1 is characterized in that, when the highest significant position of abovementioned scope was 0, the abovementioned scope of abovementioned first binary value was by renormalization.

7. the method for parallelly processing at least two binary values as claimed in claim 1 is characterized in that, when abovementioned first binary value is least may symbol the time, the scope of abovementioned second binary value and floor value can directly be calculated.

8. the method for parallelly processing at least two binary values as claimed in claim 1 is characterized in that, when abovementioned first binary value is least may symbol the time, said method more comprises:

Determine the needed displacement figure place of scope of abovementioned first binary value of renormalization;
AndUtilize abovementioned definite displacement figure place to determine the abovementioned scope and the abovementioned floor value of abovementioned second binary value.


9. an arithmetic coding system is used at least two binary values of parallel coding in the binary value string, and abovementioned arithmetic coding system comprises:

The first binary value coding engine is used for receiving present scope and utilizes abovementioned present scope to calculate the scope of abovementioned binary value string first binary value;
AndThe second binary value coding engine, coupled in parallel is in the abovementioned first binary value coding engine, be used for when abovementioned first binary value is most possible symbol, utilize abovementioned present scope simultaneously forward direction estimate a plurality of possible scope of second binary value of abovementioned binary value string, and the one or two scope of advancing value of utilizing that the abovementioned first binary value engine calculates, select the range of results and the floor value of abovementioned second binary value.


10. arithmetic coding system as claimed in claim 9 is characterized in that, the abovementioned second binary value coding engine comprises:

Coding schedule is used for receiving abovementioned present scope and utilizes abovementioned present scope to come forward direction to estimate each abovementioned a plurality of possible scope of abovementioned second binary value of abovementioned binary value string;
And abovementioned arithmetic coding system more comprises;The the one 8 to 1 multiplexer, be coupled to abovementioned first binary value coding engine and the abovementioned second binary value coding engine, be used for receiving the scope that abovementioned a plurality of possible scope and the aforementioned calculation that receives abovementioned first binary value from the abovementioned first binary value coding engine go out, and the scope of utilizing the aforementioned calculation of abovementioned first binary value to go out is selected the The above results scope of abovementioned second binary value from the abovementioned second binary value coding engine.


11. arithmetic coding system as claimed in claim 10 is characterized in that, abovementioned a plurality of possible scopes before being input to abovementioned the one 8 to 1 multiplexer by renormalization optionally.

12. arithmetic coding system as claimed in claim 10 is characterized in that, the abovementioned first binary value coding engine receives present floor value and utilizes abovementioned present scope and abovementioned present floor value is calculated the floor value of abovementioned first binary value;
 And when abovementioned first binary value is most possible symbol, the abovementioned second binary value coding engine utilize abovementioned present scope and abovementioned present floor value simultaneously forward direction estimate abovementioned a plurality of possible floor value of abovementioned second binary value, and the value range that utilizes the aforementioned calculation of abovementioned first binary value to go out is selected the floor value as a result of abovementioned second binary value.

13. arithmetic coding system as claimed in claim 12 is characterized in that, abovementioned second binary value more comprises:
The the 28 to 1 multiplexer, be coupled to abovementioned first binary value coding engine and the abovementioned second binary value coding engine, be used for the floor value that goes out from the aforementioned calculation that the abovementioned second binary value coding engine receives abovementioned a plurality of floor value and receives abovementioned first binary value from the abovementioned first binary value coding engine, and utilize the scope that calculates of abovementioned first binary value to select the The above results floor value of second binary value.

14. arithmetic coding system as claimed in claim 9 is characterized in that, abovementioned coded system is to be applied in one H.264 in the system.

15. arithmetic coding system as claimed in claim 9 is characterized in that, the abovementioned first binary value coding engine more comprises:
 the renormalization module, come the optionally scope of abovementioned first binary value of renormalization in order to highest significant position according to abovementioned scope.

16. arithmetic coding system as claimed in claim 9 is characterized in that, when abovementioned first binary value is least may symbol the time, the abovementioned second binary value coding engine directly is abovementioned second binary value computer capacity and the floor value.

17. arithmetic coding system as claimed in claim 9, it is characterized in that, the abovementioned first binary value coding engine more comprises least possibility symbol displacement table, in order to determining the figure place of the required displacement of the abovementioned first binary value renormalization, and abovementioned definite displacement figure place is inputed to the abovementioned second binary value coding engine.
Specification(s)