Method for performing parallel coding with ordered entropy slices, and associated apparatus
Abstract
A method for performing parallel coding with ordered entropy slices includes: providing a plurality of entropy slices within a picture to a plurality of processing elements, wherein each entropy slice comprises a plurality of blocks; and respectively starting each of the processing elements to perform a Context-based Adaptive Binary Arithmetic Coding (CABAC) processing of a coding procedure for a corresponding entropy slice; wherein CABAC states of the current entropy slice is initialized as the CABAC states of a previous entropy slice after processing D B blocks of the previous entropy slice, D B is a positive integer, and the CABAC processing for the current entropy slice and the CABAC processing for the previous entropy slices are performed in parallel during at least a portion of processing time.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A method for performing parallel coding with ordered entropy slices, the method comprising:
providing a plurality of entropy slices within a picture to a plurality of processing elements, wherein each entropy slice comprises a plurality of blocks; and respectively starting each of the processing elements to perform a Context-based Adaptive Binary Arithmetic Coding (CABAC) processing of a coding procedure for a corresponding entropy slice; wherein CABAC states of the current entropy slice is initialized as the CABAC states of a previous entropy slice after processing D B blocks of the previous entropy slice, D B is a positive integer, and the CABAC processing for the current entropy slice and the CABAC processing for the previous entropy slices are performed in parallel during at least a portion of processing time.
2 . The method of claim 1 , wherein the current entropy slice is positioned below the previous entropy slice in the picture.
3 . The method of claim 1 , wherein the entropy slice has a height of H block(s), H is a positive integer; and D B is obtained according to the following equation:
D B =1+2+ . . . +( H− 1) +H.
4 . The method of claim 1 , wherein the entropy slice has a height of H block(s), H is a positive integer; and D B is obtained according to the following equation:
D B =(1+2+ . . . +( H− 1) +H ) +H.
5 . The method of claim 1 , wherein initializing as the CABAC states of the previous entropy slice after processing D B blocks of the previous entropy slice ensures that each block is processed after an upper block if exists and a left block if exists are processed.
6 . The method of claim 1 , wherein initializing as the CABAC states of the previous entropy slice after processing D B blocks of the previous entropy slice ensures that each block is processed after an upper left block if exists, an upper block if exists, an upper right block if exists, and a left block if exists are processed.
7 . The method of claim 1 , wherein D B is 2 .
8 . An apparatus for performing parallel coding with ordered entropy slices, the apparatus comprising:
a plurality of processing elements arranged to process a plurality of entropy slices within a picture, wherein each entropy slice comprises a plurality of blocks; and a controller arranged to provide the entropy slices to the processing elements; wherein under control of the controller, the processing elements start to perform a Context-based Adaptive Binary Arithmetic Coding (CABAC) processing of a coding procedure for the entropy slices, wherein CABAC states of a current entropy slice is initialized as the CABAC states of a previous entropy slice after processing D B blocks of the previous entropy slice, D B is a positive integer, and the CABAC processing for the current entropy slice and the CABAC processing for the previous entropy slices are performed in parallel during at least a portion of processing time .
9 . The apparatus of claim 8 , wherein the current entropy slice is positioned below the previous entropy slice in the picture.
10 . The apparatus of claim 8 , wherein the entropy slice has a height of H block (s) , H is a positive integer; and D B is obtained according to the following equation:
D B =1+2+ . . . +( H −1) +H.
11 . The apparatus of claim 8 , wherein the entropy slice has a height of H block(s), H is a positive integer; and D B is obtained according to the following equation:
D B =(1+2+ . . . +( H− 1)+ H ) +H.
12 . The apparatus of claim 8 , wherein initializing as the CABAC states of the previous entropy slice after processing D B blocks of the previous entropy slice ensures that each block is processed after an upper block if exists and a left block if exists are processed.
13 . The apparatus of claim 8 , wherein initializing as the CABAC states of the previous entropy slice after processing D B blocks of the previous entropy slice ensures that each block is processed after an upper left block if exists, an upper block if exists, an upper right block if exists, and a left block if exists are processed.
14 . The apparatus of claim 8 , wherein D B is 2.Join the waitlist — get patent alerts
Track US2014056365A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.