0 which is data dependent on t 0 0 and t 0 1 thus t 0 2 and t 1 0 can now be deblocked at time t 3 t 0 3 and t 1 1 can be deblocked continuing this logic will provide the reference deblocking time for each tile in the frame for example at t 8 five tiles t 0 8 t 1 6 t 2 4 t 3 2 and t 4 0 can be deblocked in parallel for a frame of any size the reference deblocking time for the first row is sequential this means that the reference deblocking time for a tile t 0 i is equal to the reference deblocking time of the previous deblocked tile in the same row t 0 i u2212 1 plus one reference time unit for instance if the reference deblocking time is one reference time unit for t 0 0 then the reference deblocking time for the next tile in the row t 0 1 is two reference time units since one reference time unit plus the reference time of t 0 0 is two reference time units for the tiles in the following rows the reference deblocking time t j i is equal to two reference time units plus the reference deblocking time for t j u2212 1 i because of the data dependency of.