US 11,818,392 B2
Decoder and encoder and methods for coding of a video sequence
Jonatan Samuelsson, Stockholm (SE); and Rickard Sjöberg, Stockholm (SE)
Assigned to Telefonaktiebolaget LM Ericsson (publ), Stockholm (SE)
Filed by Telefonaktiebolaget L M Ericsson (publ), Stockholm (SE)
Filed on Feb. 9, 2022, as Appl. No. 17/667,627.
Application 17/667,627 is a continuation of application No. 17/221,333, filed on Apr. 2, 2021, granted, now 11,284,106.
Application 17/221,333 is a continuation of application No. 16/589,505, filed on Oct. 1, 2019, granted, now 10,999,600, issued on May 4, 2021.
Application 16/589,505 is a continuation of application No. 15/984,573, filed on May 21, 2018, granted, now 10,477,239, issued on Nov. 12, 2019.
Application 15/984,573 is a continuation of application No. 15/014,543, filed on Feb. 3, 2016, granted, now 9,998,758, issued on Jun. 12, 2018.
Application 15/014,543 is a continuation of application No. 14/420,408, granted, now 9,300,965, issued on Mar. 29, 2016, previously published as PCT/EP2013/077229, filed on Dec. 18, 2013.
Claims priority of provisional application 61/753,158, filed on Jan. 16, 2013.
Prior Publication US 2022/0167007 A1, May 26, 2022
Int. Cl. H04N 19/58 (2014.01); H04N 19/176 (2014.01); H04N 19/70 (2014.01); H04N 19/463 (2014.01); H04N 19/105 (2014.01); H04N 19/174 (2014.01); H04N 19/184 (2014.01); H04N 19/169 (2014.01); H04N 19/503 (2014.01); H04N 19/423 (2014.01); H04N 19/44 (2014.01)
CPC H04N 19/58 (2014.11) [H04N 19/105 (2014.11); H04N 19/174 (2014.11); H04N 19/176 (2014.11); H04N 19/184 (2014.11); H04N 19/188 (2014.11); H04N 19/423 (2014.11); H04N 19/44 (2014.11); H04N 19/463 (2014.11); H04N 19/503 (2014.11); H04N 19/70 (2014.11)] 18 Claims
OG exemplary drawing
 
1. A method for encoding a video sequence into a bitstream, wherein the bitstream is a High Efficiency Video Coding “HEVC” compliant bitstream, wherein the method comprises, when encoding a current picture of the video sequence:
performing, by at least one processor of an encoder:
calculating an indication to a previous reference picture located before the current picture in decoding order, wherein the previous reference picture is, relatively to the current picture, a closest previous reference picture, in decoding order;
creating a first set of indicators to previous pictures, wherein the first set comprises:
the indication of the previous reference picture,
a second set of indicators to all reference pictures included in a first reference picture set, “RPS”, of the previous reference picture, and
a third set of indicators to all pictures in the first RPS that follow the previous reference picture in decoding order and precede the current picture in decoding order; and
based on a long term reference picture in a second RPS of the current picture having least significant bits of a picture order count, for which more than one picture indicated in the first set share the same value of the least significant bits of picture order count as the long term reference picture:
setting a flag for the long term reference picture, wherein the flag indicates use of a picture order count cycle and least significant bits of the picture order count to indicate the long term reference picture in the second RPS; and
calculating a full picture order count value for each of the more than one picture indicated in the first set that share the same value of the least significant bits of picture order count as the long term reference picture.