S3 Texture Compression

<h2 id="patent">Patent</h2>
<p>Some (e.g. US 5956431 A) of the multiple USPTO patents on S3 Texture Compression expired on October 2, 2017.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> At least one continuation patent, <a href="https://docs.google.com/viewer?url=patentimages.storage.googleapis.com/pdfs/US6775417.pdf">US6,775,417</a>, however had a 165-day extension. This continuation patent expired on March 16, 2018.
</p>
<h2 id="codecs">Codecs</h2>
<p>There are five variations of the S3TC algorithm (named DXT1 through DXT5, referring to the <a href="/facts/FourCC/4AxE2jJa">FourCC</a> code assigned by Microsoft to each format), each designed for specific types of image data. All convert a 4×4 block of <a href="/facts/Pixel/UzwBvXBV">pixels</a> to a 64-<a href="/facts/Bit/S972NSaD">bit</a> or 128-bit quantity, resulting in compression ratios of 6:1 with 24-bit <a href="/facts/RGB_color_space/00Q0tTS5">RGB</a> input data or 4:1 with 32-bit <a href="/facts/RGBA_color_space/gSIu9laE">RGBA</a> input data. S3TC is a <a href="/facts/Lossy_data_compression/jHW7DDv3">lossy</a> compression algorithm, resulting in image quality degradation, an effect which is minimized by the ability to increase texture resolutions while maintaining the same memory requirements. Hand-drawn cartoon-like images do not compress well, nor do <a href="/facts/Normal_mapping/7YmzxkPp">normal map</a> data, both of which usually generate <a href="/facts/Compression_artifacts/7DhxoVAv">artifacts</a>. <a href="/facts/ATI_Technologies/7hPl9Cqx">ATI</a>'s <a href="/facts/3Dc/CILfELvg">3Dc</a> compression algorithm is a modification of DXT5 designed to overcome S3TC's shortcomings with regard to normal maps.  <a href="/facts/Id_Software/NsbHCMsV">id Software</a> worked around the normalmap compression issues in <i><a href="/facts/Doom_3/np3bfurA">Doom 3</a></i> by moving the red component into the alpha channel before compression and moving it back during rendering in the <a href="/facts/Pixel_shader/qfhkKFwA">pixel shader</a>.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a>
</p><p>Like many modern image compression algorithms, S3TC only specifies the method used to decompress images, allowing implementers to design the compression algorithm to suit their specific needs, although the patent still covers compression algorithms. The <a href="/facts/Nvidia/8QfCgqbu">nVidia</a> GeForce 256 through to GeForce 4 cards also used 16-bit interpolation to render DXT1 textures, which resulted in banding when unpacking textures with color gradients. Again, this created an unfavorable impression of <a href="/facts/Texture_compression/HcyqY6aj">texture compression</a>, not related to the fundamentals of the codec itself.
</p>
<h2 id="dxt1">DXT1</h2>
<p>DXT1 (also known as Block Compression 1 or BC1) is the smallest variation of S3TC, storing 16 input pixels in 64 bits of output, consisting of two 16-bit RGB 5:6:5 color values 
  
    
      
        
          c
          
            0
          
        
      
    
    {\displaystyle c_{0}}
  
 and 
  
    
      
        
          c
          
            1
          
        
      
    
    {\displaystyle c_{1}}
  
, and a 4×4 two-bit lookup table.
</p><p>If 
  
    
      
        
          c
          
            0
          
        
        >
        
          c
          
            1
          
        
      
    
    {\displaystyle c_{0}>c_{1}}
  
(compare these colors by interpreting them as two 16-bit unsigned numbers), then two other colors are calculated, such that for each component, 
  
    
      
        
          c
          
            2
          
        
        =
        
          
            2
            3
          
        
        
          c
          
            0
          
        
        +
        
          
            1
            3
          
        
        
          c
          
            1
          
        
      
    
    {\textstyle c_{2}={2 \over 3}c_{0}+{1 \over 3}c_{1}}
  
 and 
  
    
      
        
          c
          
            3
          
        
        =
        
          
            1
            3
          
        
        
          c
          
            0
          
        
        +
        
          
            2
            3
          
        
        
          c
          
            1
          
        
      
    
    {\textstyle c_{3}={1 \over 3}c_{0}+{2 \over 3}c_{1}}
  
.
This mode operates similarly to mode 0xC0 of the <a href="/facts/Apple_Video/L8aYH99v">original Apple Video codec</a>.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a>
</p><p>Otherwise, if 
  
    
      
        
          c
          
            0
          
        
        ≤
        
          c
          
            1
          
        
      
    
    {\displaystyle c_{0}\leq c_{1}}
  
, then 
  
    
      
        
          c
          
            2
          
        
        =
        
          
            1
            2
          
        
        
          c
          
            0
          
        
        +
        
          
            1
            2
          
        
        
          c
          
            1
          
        
      
    
    {\textstyle c_{2}={1 \over 2}c_{0}+{1 \over 2}c_{1}}
  
 and 
  
    
      
        
          c
          
            3
          
        
      
    
    {\displaystyle c_{3}}
  
 is transparent black corresponding to a <a href="/facts/Alpha_compositing/7uUBtjrt">premultiplied alpha format</a>. This color sometimes causes a black border surrounding the transparent area when linear texture filtering and alpha test is used, due to colors being interpolated between the color of opaque texel and neighbouring black transparent texel.
</p><p>The lookup table is then consulted to determine the color value for each pixel, with a value of 0 corresponding to 
  
    
      
        
          c
          
            0
          
        
      
    
    {\displaystyle c_{0}}
  
 and a value of 3 corresponding to 
  
    
      
        
          c
          
            3
          
        
      
    
    {\displaystyle c_{3}}
  
.
</p>
<h2 id="dxt2-and-dxt3">DXT2 and DXT3</h2>
<p>DXT2 and DXT3 (collectively also known as Block Compression 2 or BC2) converts 16 input pixels (corresponding to a 4x4 pixel block) into 128 bits of output, consisting of 64 bits of <a href="/facts/Alpha_channel/7uUBtjrt">alpha channel</a> data (4 bits for each pixel) followed by 64 bits of color data, encoded the same way as DXT1 (with the exception that the 4-color version of the DXT1 algorithm is always used instead of deciding which version to use based on the relative values of 
  
    
      
        
          c
          
            0
          
        
      
    
    {\displaystyle c_{0}}
  
 and 
  
    
      
        
          c
          
            1
          
        
      
    
    {\displaystyle c_{1}}
  
).
</p><p>In DXT2, the color data is interpreted as being <a href="/facts/Premultiplied_by_alpha/GfIomenN">premultiplied by alpha</a>, in DXT3 it is interpreted as not having been premultiplied by alpha. Typically DXT2/3 are well suited to images with sharp alpha transitions, between translucent and opaque areas.
</p>
<h2 id="dxt4-and-dxt5">DXT4 and DXT5</h2>
<p>DXT4 and DXT5 (collectively also known as Block Compression 3 or BC3) converts 16 input pixels into 128 bits of output, consisting of 64 bits of alpha channel data (two 8-bit alpha values and a 4×4 3-bit lookup table) followed by 64 bits of color data (encoded the same way as DXT1).
</p><p>If 
  
    
      
        
          α
          
            0
          
        
        >
        
          α
          
            1
          
        
      
    
    {\displaystyle \alpha _{0}>\alpha _{1}}
  
, then six other alpha values are calculated, such that 
  
    
      
        
          α
          
            2
          
        
        =
        
          
            
              6
              
                α
                
                  0
                
              
              +
              1
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{2}={{6\alpha _{0}+1\alpha _{1}} \over 7}}
  
, 
  
    
      
        
          α
          
            3
          
        
        =
        
          
            
              5
              
                α
                
                  0
                
              
              +
              2
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{3}={{5\alpha _{0}+2\alpha _{1}} \over 7}}
  
, 
  
    
      
        
          α
          
            4
          
        
        =
        
          
            
              4
              
                α
                
                  0
                
              
              +
              3
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{4}={{4\alpha _{0}+3\alpha _{1}} \over 7}}
  
, 
  
    
      
        
          α
          
            5
          
        
        =
        
          
            
              3
              
                α
                
                  0
                
              
              +
              4
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{5}={{3\alpha _{0}+4\alpha _{1}} \over 7}}
  
, 
  
    
      
        
          α
          
            6
          
        
        =
        
          
            
              2
              
                α
                
                  0
                
              
              +
              5
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{6}={{2\alpha _{0}+5\alpha _{1}} \over 7}}
  
, and 
  
    
      
        
          α
          
            7
          
        
        =
        
          
            
              1
              
                α
                
                  0
                
              
              +
              6
              
                α
                
                  1
                
              
            
            7
          
        
      
    
    {\textstyle \alpha _{7}={{1\alpha _{0}+6\alpha _{1}} \over 7}}
  
.
</p><p>Otherwise, if 
  
    
      
        
          α
          
            0
          
        
        ≤
        
          α
          
            1
          
        
      
    
    {\textstyle \alpha _{0}\leq \alpha _{1}}
  
, four other alpha values are calculated such that 
  
    
      
        
          α
          
            2
          
        
        =
        
          
            
              4
              
                α
                
                  0
                
              
              +
              1
              
                α
                
                  1
                
              
            
            5
          
        
      
    
    {\textstyle \alpha _{2}={{4\alpha _{0}+1\alpha _{1}} \over 5}}
  
, 
  
    
      
        
          α
          
            3
          
        
        =
        
          
            
              3
              
                α
                
                  0
                
              
              +
              2
              
                α
                
                  1
                
              
            
            5
          
        
      
    
    {\textstyle \alpha _{3}={{3\alpha _{0}+2\alpha _{1}} \over 5}}
  
, 
  
    
      
        
          α
          
            4
          
        
        =
        
          
            
              2
              
                α
                
                  0
                
              
              +
              3
              
                α
                
                  1
                
              
            
            5
          
        
      
    
    {\textstyle \alpha _{4}={{2\alpha _{0}+3\alpha _{1}} \over 5}}
  
, and 
  
    
      
        
          α
          
            5
          
        
        =
        
          
            
              1
              
                α
                
                  0
                
              
              +
              4
              
                α
                
                  1
                
              
            
            5
          
        
      
    
    {\textstyle \alpha _{5}={{1\alpha _{0}+4\alpha _{1}} \over 5}}
  
 with 
  
    
      
        
          α
          
            6
          
        
        =
        0
      
    
    {\displaystyle \alpha _{6}=0}
  
 and 
  
    
      
        
          α
          
            7
          
        
        =
        255
      
    
    {\displaystyle \alpha _{7}=255}
  
.
</p><p>The lookup table is then consulted to determine the alpha value for each pixel, with a value of 0 corresponding to 
  
    
      
        
          α
          
            0
          
        
      
    
    {\displaystyle \alpha _{0}}
  
 and a value of 7 corresponding to 
  
    
      
        
          α
          
            7
          
        
      
    
    {\displaystyle \alpha _{7}}
  
. DXT4's color data is premultiplied by alpha, whereas DXT5's is not. Because DXT4/5 use an interpolated alpha scheme, they generally produce superior results for alpha (transparency) gradients than DXT2/3.
</p>
<h2 id="further-variants">Further variants</h2>
<h3>BC4 and BC5</h3>
<p class="note">Main article: <a href="/facts/3Dc/CILfELvg">3Dc</a></p>
<p>BC4 and BC5 (Block Compression 4 and 5) are added in Direct3D 10. They reuse the alpha channel encoding found in DXT4/5 (BC3).<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a>
</p>
<ul><li>BC4 stores 16 input single-channel (e.g. greyscale) pixels into 64 bits of output, encoded in nearly<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> the same way as BC3 alphas. The expanded palette provides higher quality.</li>
<li>BC5 stores 16 input double-channel (e.g. tangent space normal map) pixels into 128 bits of output, consisting of two halves each encoded like BC4.</li></ul>
<h3>BC6H and BC7</h3>
<p>BC6H (sometimes BC6) and BC7 (Block Compression 6H and 7) are added in Direct3D 11.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a>
</p>
<ul><li>BC6H encodes 16 input RGB HDR (float16) pixels into 128 bits of output. It essentially treats float16 as 16 sign-magnitude integer value and interpolates such integers linearly. It works well for blocks without sign changes. A total of 14 modes are defined, though most differ minimally: only two prediction modes are really used.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a></li>
<li>BC7 encodes 16 input RGB8/RGBA8 pixels into 128 bits of output. It can be understood as a much-enhanced BC3.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a></li></ul>
<p>BC6H and BC7 have a much more complex algorithm with a selection of encoding modes. The quality is much better as a result.<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> These two modes are also specified much more exactly, with ranges of accepted deviation. Earlier BCn modes decode slightly differently among GPU vendors.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a>
</p>
<h2 id="s3tc-format-comparison">S3TC format comparison</h2>
<table><tbody><tr><th>FOURCC</th><th>DX 10/11 name</th><th>Description</th><th>Alpha premultiplied?</th><th>Compression ratio</th><th>Texture type</th></tr><tr><td>DXT1</td><td>BC1</td><td>1-bit alpha / opaque</td><td>Yes</td><td>6:1 (for 24-bit source image)</td><td>Simple non-alpha</td></tr><tr><td>DXT2</td><td>BC2</td><td>Explicit alpha</td><td>Yes</td><td>4:1</td><td>Sharp alpha</td></tr><tr><td>DXT3</td><td>BC2</td><td>Explicit alpha</td><td>No</td><td>4:1</td><td>Sharp alpha</td></tr><tr><td>DXT4</td><td>BC3</td><td>Interpolated alpha</td><td>Yes</td><td>4:1</td><td>Gradient alpha</td></tr><tr><td>DXT5</td><td>BC3</td><td>Interpolated alpha</td><td>No</td><td>4:1</td><td>Gradient alpha</td></tr><tr><td>—</td><td>BC4</td><td>Interpolated greyscale</td><td>—</td><td>2:1</td><td>Gradient</td></tr><tr><td>—</td><td>BC5</td><td>Interpolated two-channel</td><td>—</td><td>2:1</td><td>Gradient</td></tr><tr><td>—</td><td>BC6H</td><td>Interpolated HDR (no alpha)</td><td>—</td><td>6:1</td><td>Gradient</td></tr><tr><td>—</td><td>BC7</td><td>Interpolated alpha</td><td>?</td><td>4:1</td><td>Gradient</td></tr></tbody></table>
<h2 id="data-preconditioning">Data preconditioning</h2>
<p>BCn textures can be further compressed for on-disk storage and distribution (<a href="/facts/Texture_supercompression/HcyqY6aj">texture supercompression</a>). An application would decompress this extra layer and send the BCn data to the GPU as usual.
</p><p>BCn can be combined with Oodle Texture, a lossy preprocessor that modifies the input texture so that the BCn output is more easily compressed by a <a href="/facts/LZ77/HGH09JM9">LZ77</a> compressor (<a href="/facts/Rate-distortion_optimization/4IQuepQN">rate-distortion optimization</a>). BC7 specifically can also use "bc7prep", a lossless pass to re-encode the texture in a more compressible form (requiring its inverse at decompression).<a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a>
</p><p>crunch is another tool that performs RDO and optionally further re-encoding.<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a>
</p><p>In 2021, Microsoft produced a "BCPack" compression algorithm specifically for BCn-compressed textures. Xbox series X and S have hardware support for decompressing BCPack streams.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a>
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/S2TC/CcGBDDE4">S2TC</a>, patentless workaround</li>
<li><a href="/facts/FXT1/ldudRXgJ">FXT1</a></li>
<li><a href="/facts/DirectDraw_Surface/NwMoxWKv">DirectDraw Surface</a></li>
<li><a href="/facts/PVRTC/E1cvwJlo">PVRTC</a></li>
<li><a href="/facts/Adaptive_Scalable_Texture_Compression/QskeHtWP">Adaptive Scalable Texture Compression</a> (ASTC)</li>
<li><a href="/facts/Ericsson_Texture_Compression/9B2cdPdL">Ericsson Texture Compression</a> (ETC1 & ETC2)</li>
<li><a href="/facts/Color_Cell_Compression/lDrtm7Qh">Color Cell Compression</a></li></ul>

<h2 id="external-links">External links</h2>
<ul><li><a href="http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&Sect2=HITOFF&p=1&u=/netahtml/PTO/search-bool.html&r=1&f=G&l=50&d=PALL&RefSrch=yes&Query=PN/5956431">US Patent & Trademark Office, Patent Full Text and Image Database, result for US 5956431 A</a></li>
<li><a href="https://assignment.uspto.gov/patent/index.html#/patent/search/resultAbstract?id=5956431&type=patNum">USPTO Patent Assignment Search for US 5956431 A</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>US 5956431  "Fixed-rate block-based image compression with inferred pixel values" <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5956431" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5956431</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>US 5956431, Iourcha, Konstantine I.; Nayak, Krishna S. & Hong, Zhou, "System and method for fixed-rate block-based image compression with inferred pixel values", published Sep 21, 1999
 <a href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5956431" target="_blank">https://worldwide.espacenet.com/textdoc?DB=EPODOC&IDX=US5956431</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>"1990 IEEE Color Cell Compression Paper". IEEE. doi:10.1109/TENCON.1990.152671. S2CID 62015990. {{cite journal}}: Cite journal requires |journal= (help) <a href="/wiki/IEEE" target="_blank">/wiki/IEEE</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>"S3TC situation on official DRI information page". Dri.freedesktop.org. Archived from the original on 2012-01-19. Retrieved 2012-01-25. <a href="http://dri.freedesktop.org/wiki/S3TC" target="_blank">http://dri.freedesktop.org/wiki/S3TC</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>S2TC: A Possible Workaround For The S3TC Patent Situation Archived 2016-05-13 at the Wayback Machine on phoronix <a href="https://www.phoronix.com/scan.php?page=article&item=s2tc_s3tc_fix" target="_blank">https://www.phoronix.com/scan.php?page=article&item=s2tc_s3tc_fix</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Yates, Tom (2017-02-15). "This is why I drink: a discussion of Fedora's legal state". LWN.net. Archived from the original on 2017-03-01. Retrieved 2017-02-16. ... The patent on S3 texture compression expires on October 2, 2017, so Steam games might work better on Fedora after that date. ... <a href="https://lwn.net/Articles/714524/" target="_blank">https://lwn.net/Articles/714524/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Duffy, Robert (July 27, 2004). "DOOM 3 Video Requirements". Gamershell.com. Archived from the original on January 3, 2008. Retrieved 2012-01-25. <a href="https://web.archive.org/web/20080103155922/http://www.gamershell.com/news/14362.html" target="_blank">https://web.archive.org/web/20080103155922/http://www.gamershell.com/news/14362.html</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Togni, Roberto, et al. "Apple RPZA Archived 2017-07-04 at the Wayback Machine". MultimediaWiki. <a href="http://wiki.multimedia.cx/index.php?title=Apple_RPZA" target="_blank">http://wiki.multimedia.cx/index.php?title=Apple_RPZA</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
<li id="fn:9"><p>Reed, Nathan. "Understanding BCn Texture Compression Formats". Nathan Reed’s coding blog. Archived from the original on 2020-11-09. Retrieved 2020-09-01. <a href="http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/" target="_blank">http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li>
<li id="fn:10"><p>Giesen, Fabian “ryg” (4 October 2021). "GPU BCn decoding". The ryg blog. Archived from the original on 24 July 2023. Retrieved 24 July 2023. <a href="https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/" target="_blank">https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li>
<li id="fn:11"><p>Reed, Nathan. "Understanding BCn Texture Compression Formats". Nathan Reed’s coding blog. Archived from the original on 2020-11-09. Retrieved 2020-09-01. <a href="http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/" target="_blank">http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li>
<li id="fn:12"><p>Giesen, Fabian “ryg” (4 October 2021). "GPU BCn decoding". The ryg blog. Archived from the original on 24 July 2023. Retrieved 24 July 2023. <a href="https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/" target="_blank">https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li>
<li id="fn:13"><p>Giesen, Fabian “ryg” (4 October 2021). "GPU BCn decoding". The ryg blog. Archived from the original on 24 July 2023. Retrieved 24 July 2023. <a href="https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/" target="_blank">https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li>
<li id="fn:14"><p>Reed, Nathan. "Understanding BCn Texture Compression Formats". Nathan Reed’s coding blog. Archived from the original on 2020-11-09. Retrieved 2020-09-01. <a href="http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/" target="_blank">http://www.reedbeta.com/blog/understanding-bcn-texture-compression-formats/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li>
<li id="fn:15"><p>Giesen, Fabian “ryg” (4 October 2021). "GPU BCn decoding". The ryg blog. Archived from the original on 24 July 2023. Retrieved 24 July 2023. <a href="https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/" target="_blank">https://fgiesen.wordpress.com/2021/10/04/gpu-bcn-decoding/</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li>
<li id="fn:16"><p>"Oodle Texture Compression". www.radgametools.com. Archived from the original on 2023-03-18. Retrieved 2023-04-03. Open source part mentioned: bc7enc_rdo Archived 2021-02-02 at the Wayback Machine <a href="http://www.radgametools.com/oodletexture.htm" target="_blank">http://www.radgametools.com/oodletexture.htm</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li>
<li id="fn:17"><p>"crunch open source texture compression library". GitHub. Archived from the original on 2016-09-09. Retrieved 2016-09-13. <a href="https://github.com/BinomialLLC/crunch" target="_blank">https://github.com/BinomialLLC/crunch</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li>
<li id="fn:18"><p>"DirectStorage Overview - Microsoft Game Development Kit". 16 March 2023. Archived from the original on 3 August 2023. Retrieved 3 August 2023. <a href="https://learn.microsoft.com/en-us/gaming/gdk/_content/gc/system/overviews/directstorage/directstorage-overview" target="_blank">https://learn.microsoft.com/en-us/gaming/gdk/_content/gc/system/overviews/directstorage/directstorage-overview</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li>
</ol>

S3 Texture Compression open-in-new

S3 Texture Compression