IP Library › Granted Patent US 12,375,099
Granted Patent B2
US 12,375,099 · App. 18/742,321 · Granted Jul 29, 2025

Entropy encoding and decoding scheme

Inventors: Detlev Marpe (Berlin, DE); Tung Nguyen (Berlin, DE); Heiko Schwarz (Berlin, DE); Thomas Wiegand (Berlin, DE)
Assignee: Dolby Video Compression, LLC
H03M7/00H03M7/40H03M7/4006H03M7/46
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 12,375,099
App. No.
18/742,321
Granted
Jul 29, 2025
Kind
B2
Abstract

Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols s i with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols s i yields z, and, if n>1, for all i=1 . . . n−1, the value of s i corresponds to a range of the i th partition.

Claims (18)

1. A method of transmitting a video signal, comprising:

transmitting, on a transmission medium, a data stream comprising data associated with a first sequence of source symbols and a second sequence of source symbols, wherein the source symbols of the first and second sequences are related to level values of transform coefficients of a transform coefficient block, and are determined based on a sequence of syntax elements having a value range which is sub-divided into a plurality of disjoint portions by executing operations using a processor, the operations including:

decomposing each syntax element into a corresponding set of source symbols based on a portion of the plurality of disjoint portions associated with the syntax element, such that a combination of values of the source symbols of the set yields a value of the syntax element, and

adapting one or more limits between the plurality of disjoint portions according to one or more previously encoded source symbols.

2. The method of claim 1 , wherein:

a source symbol in the second sequence of source symbols corresponds to a first-ordered portion in the plurality of disjoint portions.

3. The method of claim 2 , wherein:

the plurality of disjoint portions is arranged such that a first portion covers higher values of the value range than a second portion.

4. The method of claim 1 , wherein:

the source symbols from the first sequence and the source symbols from the second sequence correspond to different portions of the plurality of disjoint portions.

5. The method of claim 2 , wherein:

the source symbols from the first sequence and the source symbols from the second sequence correspond to different portions of the plurality of disjoint portions.

6. The method of claim 3 , wherein:

a second portion of the data stream represents at least one scaling factor.

7. The method of claim 1 , wherein:

the transmission medium is a wireless transmission medium.

8. The method of claim 1 , wherein:

the transmission medium is a wired transmission medium.

Assignments (2)
CHANGE OF NAME Recorded Jan 30, 2026
From: GE VIDEO COMPRESSION, LLC
To: DOLBY VIDEO COMPRESSION, LLC
Reel/Frame 074536/0781 →
CHANGE OF NAME Recorded Nov 26, 2024
From: GE VIDEO COMPRESSION, LLC
To: DOLBY VIDEO COMPRESSION, LLC
Reel/Frame 069451/0262 →
Continuity (14)
Continuation 17849169 · Jun 24, 2022
Continuation 17039204 · Sep 30, 2020
Continuation 16779851 · Feb 3, 2020
Continuation 16446228 · Jun 19, 2019
Continuation 16109953 · Aug 23, 2018
Continuation 15717427 · Sep 27, 2017
Continuation 15479787 · Apr 5, 2017
Continuation 15195696 · Jun 28, 2016
Continuation 14980671 · Dec 28, 2015
Continuation 14734407 · Jun 9, 2015
Continuation 13940561 · Jul 12, 2013
Continuation PCTEP2012050431 · Jan 12, 2012
Provisional Application 61432884 · Jan 14, 2011
Related Publication 20240413836A1 · Dec 12, 2024
References Cited (103)
US 5436626A · Fujiwara et al. · 1995 [cited by applicant]
US 5473376A · Auyeung · 1995 [cited by applicant]
US 5600812A · Park · 1997 [cited by applicant]
US 5604498A · Park · 1997 [cited by applicant]
US 5712955A · Sonohara · 1998 [cited by applicant]
US 5717394A · Schwartz et al. · 1998 [cited by applicant]
US 5778339A · Sonohara et al. · 1998 [cited by applicant]
US 5828790A · Kim · 1998 [cited by applicant]
US 7221296B2 · Zìauddin · 2007 [cited by applicant]
US 7573405B2 · Shima · 2009 [cited by applicant]
US 7796065B2 · Fenney · 2010 [cited by applicant]
US 8396311B2 · Chono · 2013 [cited by applicant]
US 8410959B2 · Karczewicz et al. · 2013 [cited by applicant]
US 8483282B2 · Karczewicz et al. · 2013 [cited by applicant]
US 9083371B2 · Aruga · 2015 [cited by applicant]
US 9083374B2 · Marpe · 2015 [cited by applicant]
US 9252806B2 · Marpe · 2016 [cited by applicant]
US 9473169B2 · Marpe · 2016 [cited by applicant]
US 9647683B2 · Marpe · 2017 [cited by applicant]
US 9806738B2 · Marpe · 2017 [cited by examiner]
US 10090856B2 · Marpe · 2018 [cited by applicant]
US 10404272B2 · Marpe · 2019 [cited by applicant]
US 10419017B2 · Marpe · 2019 [cited by examiner]
US 10581454B2 · Marpe · 2020 [cited by examiner]
US 10644719B2 · Inc · 2020 [cited by applicant]
US 10826514B1 · Honarparvar · 2020 [cited by examiner]
US 11405050B2 · Marpe · 2022 [cited by examiner]
US 20030081674A1 · Malvar · 2003 [cited by applicant]
US 20040081241A1 · Kadono et al. · 2004 [cited by applicant]
US 20040114683A1 · Schwarz et al. · 2004 [cited by applicant]
US 20040165664A1 · Karczewicz et al. · 2004 [cited by applicant]
US 20050088324A1 · Fuchigami et al. · 2005 [cited by applicant]
US 20050283700A1 · O'Dea · 2005 [cited by applicant]
US 20060071827A1 · Lynch et al. · 2006 [cited by applicant]
US 20070016418A1 · Mehrotra et al. · 2007 [cited by applicant]
US 20070036443A1 · Srinivasan · 2007 [cited by applicant]
US 20070110153A1 · Cho et al. · 2007 [cited by applicant]
US 20080025391A1 · Amon et al. · 2008 [cited by applicant]
US 20080165036A1 · Shima · 2008 [cited by applicant]
US 20090232204A1 · Lee et al. · 2009 [cited by applicant]
US 20100153828A1 · Wijingaarde · 2010 [cited by applicant]
US 20110211636A1 · Yamada et al. · 2011 [cited by applicant]
US 20120121012A1 · Shiodera · 2012 [cited by applicant]
US 20120262444A1 · Stefanoski et al. · 2012 [cited by applicant]
US 20130107951A1 · Sole · 2013 [cited by applicant]
US 20130300591A1 · Marpe et al. · 2013 [cited by applicant]
US 20140333458A1 · Marpe · 2014 [cited by applicant]
US 20160353110A1 · Zhang · 2016 [cited by applicant]
US 20170127058A1 · Misra · 2017 [cited by applicant]
CN 1112799A · 1995 [cited by applicant]
CN 1118196A · 1996 [cited by applicant]
CN 1140003A · 1997 [cited by applicant]
CN 1158051A · 1997 [cited by applicant]
CN 1158058A · 1997 [cited by applicant]
CN 1378750A · 2002 [cited by applicant]
CN 1409558A · 2003 [cited by applicant]
CN 1447603A · 2003 [cited by applicant]
CN 1610265A · 2005 [cited by applicant]
CN 1215647C · 2005 [cited by applicant]
CN 1848690A · 2006 [cited by applicant]
CN 101073264A · 2007 [cited by applicant]
CN 101099391A · 2008 [cited by applicant]
CN 101198055A · 2008 [cited by applicant]
CN 101243459A · 2008 [cited by applicant]
CN 101243459B · 2010 [cited by applicant]
CN 101223573A · 2011 [cited by applicant]
CN 103404035B · 2013 [cited by applicant]
EP 0777387A2 · 1997 [cited by applicant]
EP 2768145A2 · 2014 [cited by applicant]
EP 2768144B1 · 2016 [cited by applicant]
EP 3349360A1 · 2018 [cited by applicant]
JP 08116266A · 1996 [cited by applicant]
JP 3346204B2 · 2002 [cited by applicant]
JP 2003153265A · 2003 [cited by applicant]
JP 2005507184A · 2005 [cited by applicant]
JP 2005530375A · 2005 [cited by applicant]
JP 2007116501A · 2007 [cited by applicant]
JP 2008514142A · 2008 [cited by applicant]
JP 2009516417A · 2009 [cited by applicant]
JP 2010527523A · 2010 [cited by applicant]
KR 101741296B1 · 2017 [cited by applicant]
KR 102175762B1 · 2020 [cited by applicant]
KR 102222957B1 · 2021 [cited by applicant]
TW 200913721A · 2009 [cited by applicant]
TW 200917850A · 2009 [cited by applicant]
TW 200930102A · 2009 [cited by applicant]
WO 2007149444A · 2007 [cited by applicant]
WO 2008129021A2 · 2008 [cited by applicant]
WO 2010052833A1 · 2010 [cited by applicant]
WO 2012031628A1 · 2012 [cited by applicant]
“Information Technology—Coding of Audio-Visual Objects—Part 16: Animation Framework Extension (AFX), Amendment 1: Scalable Complexity 3D Mesh Compression,” ISOIIEC 14496-16:2009/FDAM 1:2010 (E), Jan. 22, 2010, 62 pages. [cited by applicant]
Kiely, “Selecting the Golomb Parameter in Rice Coding,” IPN Progress Report 42-159, Nov. 15, 2004, pp. 1-18. [cited by applicant]
Marpe et al., “Entropy Coding in Video Compression Using Probability Interval Partitioning,” 28th Picture Coding Symposium, PCS2010, Dec. 8-10, 2010, pp. 66-69. [cited by applicant]
Marpe et al., “Entropy Encoding and Decoding Scheme Using VLC Coding and Pipe or Entropy Coding for High Compression Efficiency”, U.S. Appl. No. 13/940,561, filed Jul. 12, 2013. [cited by applicant]
Nguyen et al. “Reduced-Complexity Entropy Coding of Transform Coefficient Levels Using a Combination of VLC and PIPE,” Joint Collaborative Team on Video Coding (JCT/VC) of ITU-T SG 16 WP3 and ISO/IEC JTC1/SC29WG11, Jan.… [cited by applicant]
Winger, “Putting a Reasonable Upper Limit of Binarization Expansion,” Joint Video Team (JVT) of ISOIIEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ItuTU-T SG16 Q.6) May 6-10, 2002, pp. 1-8. [cited by applicant]
Winken et al., “Description of Video Coding Technology Proposal by Fraunhofer HHI,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Apr. 2010, pp. 1-44. [cited by applicant]
Bardone, David et al., Adaptive Golomb Codes For Level Binalization in the H.264/AVC FRExt Lossless Mode, ISSPIT2008. IEEE International Symposium on Signal Processing and Information Technology, US, IEEE, Dec. 16, 2008… [cited by applicant]
Ohkubo, Sakae et al., H.264/AVC Text, Third version, Impress R&D, Jan. 1, 2009. pp. 150-151. [cited by applicant]
Budagavi, Madhukar et al., Parallel Context Processing techniques for high coding efficiency entropy coding in HEVC, JCTVC-B088, ITU-T, Jul. 21, 2010. [cited by applicant]
“ITU-T Recommendation H.264 (May 2003)”, Series H: Audiovisual and Multimedia Systems, Infrastructure of audiovisual services—Coding of moving video, Advanced video coding for generic audiovisual services, pp. 46,177. [cited by applicant]
Lowell Winger: “Putting a Reasonable Upper Limit an Binarization Expansion”, 3. JVT Meeting; 60. MPEG Meeting; Jun. 5, 2002-Oct. 5, 2002; Fairfax, US; (Joint Video Team of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.16 ), No. J… [cited by applicant]
Martin Winken et al., “Description of video coding technology proposal by Fraunhofer HHI”, Joint Collaborative Team on Video Codiing (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 1st Meeting: Dresden, DE, Apr. … [cited by applicant]