<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>H265.net &#187; Software</title>
	<atom:link href="http://www.h265.net/tag/software/feed" rel="self" type="application/rss+xml" />
	<link>http://www.h265.net</link>
	<description>Witness the development of H.265</description>
	<lastBuildDate>Sun, 05 Feb 2012 02:39:13 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>HEVC Test Model (HM) Reference Software 1.0 Released</title>
		<link>http://www.h265.net/2011/01/hevc-test-model-hm-reference-software-1-0-released.html</link>
		<comments>http://www.h265.net/2011/01/hevc-test-model-hm-reference-software-1-0-released.html#comments</comments>
		<pubDate>Fri, 14 Jan 2011 01:25:02 +0000</pubDate>
		<dc:creator>Yu Liu</dc:creator>
				<category><![CDATA[News]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[HM]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=850</guid>
		<description><![CDATA[<p style="text-align: justify;"><em>[Update on 2011-01-25] The repository URL for HM-1.0 is moved to<br />
</em><em><a href="https://hevc.hhi.fraunhofer.de/svn/svn_HEVCSoftware/tags/HM-1.0">https://hevc.hhi.fraunhofer.de/svn/svn_HEVCSoftware/tags/HM-1.0</a> .</em></p>
<p style="text-align: justify;">The latest reference software of HEVC Test Model (HM-1.0) was released at svn servers under the HM-1.0 tag. The repository URL for HM-1.0 is <a href="https://hevc.hhi.fraunhofer.de/svn/svn_TMuCSoftware/tags/HM-1.0">https://hevc.hhi.fraunhofer.de/svn/svn_TMuCSoftware/tags/HM-1.0</a>.</p>
<p style="text-align: justify;">HM-1.0 is significantly different from the previous versions of TMuC in that a lot of code implementing things that are not part of the HM design has been removed. As a result, the size of the code base shrunk by about half. </p>
<p style="text-align: justify;">In addition, the first working draft (WD1) of HEVC HM text is also available as document <a href="http://phenix.int-evry.fr/jct/doc_end_user/documents/3_Guangzhou/wg11/JCTVC-C403-v1.zip">C403</a> at JCT-VC Document Management System.</p>]]></description>
		<wfw:commentRss>http://www.h265.net/2011/01/hevc-test-model-hm-reference-software-1-0-released.html/feed</wfw:commentRss>
		<slash:comments>48</slash:comments>
		</item>
		<item>
		<title>Analysis of Coding Tools in HEVC Test Model (HM 1.0) – Inter Prediction</title>
		<link>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-inter-prediction.html</link>
		<comments>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-inter-prediction.html#comments</comments>
		<pubDate>Tue, 07 Dec 2010 08:55:38 +0000</pubDate>
		<dc:creator>Yu Liu</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[HM]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[MCP]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=921</guid>
		<description><![CDATA[<p style="text-align: justify"><em>[Update on 2011-02-15] The 12-tap DCT-based interpolation filter (high efficiency configuration) and 6-tap directional interpolation filter (low complexity configuration) for 1/4 luma sample will be replaced by 8-tap DCT-based interpolation filter for both HE and LC (JCTVC-D344) in the upcoming HM2.0. In addition, the bilinear interpolation filter for 1/8 chroma sample will be replaced by 4-tap DCT-based interpolation filter (JCTVC-D347) in the HM2.0.</em></p>
<p style="text-align: justify">Tools adopted in HM0.9 include 12-tap DCT-based interpolation filter (high efficiency configuration) and 6-tap directional interpolation filter (low complexity configuration) for 1/4 luma sample, bilinear interpolation filter for 1/8 chroma sample (both HE and LC), advanced motion vector prediction, bi-direction rounding control, bi-directional prediction for temporal level 0.</p>
<li><strong>12-tap DCT-based Interpolation Filter for luma (HE)</strong></li>
<p style="text-align: justify">Motion compensation is the key factor for high efficient video compressing, where fractional pel accuracy requir[......]</p><p class='read-more'><a href='http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-inter-prediction.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-inter-prediction.html/feed</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Analysis of Coding Tools in HEVC Test Model (HM 1.0) – Intra Prediction</title>
		<link>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-intra-prediction.html</link>
		<comments>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-intra-prediction.html#comments</comments>
		<pubDate>Wed, 01 Dec 2010 02:42:12 +0000</pubDate>
		<dc:creator>Yu Liu</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[HM]]></category>
		<category><![CDATA[Intra Prediction]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=877</guid>
		<description><![CDATA[<p style="text-align: justify">The current intra prediction in HM unified two directional intra prediction methods, Arbitrary Direction Intra (ADI) introduced in <a href="http://wftp3.itu.int/av-arch/jctvc-site/2010_04_A_Dresden/JCTVC-A124.zip">JCTVC-A124 </a>and Angular Intra Prediction introduced in <a href="http://wftp3.itu.int/av-arch/jctvc-site/2010_04_A_Dresden/JCTVC-A119.zip">JCTVC-A119</a>, with simplification for parallel processing possibility, leading to a simplified unified intra prediction (<a href="http://wftp3.itu.int/av-arch/jctvc-site/2010_07_B_Geneva/JCTVC-B100.zip">JCTVC-B100</a>, <a href="http://phenix.int-evry.fr/jct/doc_end_user/documents/3_Guangzhou/wg11/JCTVC-C042-m18063-v1-JCTVC-C042.zip">JCTVC-C042</a>).</p>
<p style="text-align: justify">In current HM, unified intra prediction provides up to 34 directional prediction modes for different PUs. With the PU size of 4&#215;4, 8&#215;8, 16&#215;16, 32&#215;32, 64&#215;64, there are 17, 34, 34, 34, and 5 prediction modes available respectively. The prediction directions in the unified intra prediction have the angles of +/- [0, 2, 5, 9, 13, 17, 21, 26, 32]/32. The angle is given by displacement of the bottom row of the PU and the reference row above the PU in case of vertical prediction, or displacement of the rightmost column of the PU and the reference column left from the PU in case of horizontal prediction. Figure 1 shows an example of prediction directions for 32&#215;32 block size. Instead of different accuracy for different sizes, the reconstruction of the pixel uses the linear interpolation of the reference top or left samples at 1/32th pixel accuracy for all block size.</p>
<p style="text-align: center"><img class="aligncenter" style="float: none;margin-left: auto;margin-right: auto;border-width: 0px" src="http://www.h265.net/wp-content/uploads/2010/12/unified_intra_pred.png" border="0" alt="HM Decoder" width="640" />Figure 1. Available prediction directions in the unified intra prediction</p>
<p style="text-align: justify">Two arrays of reference samples are used in the unified intra prediction, corresponding to the row of samples lying above the current PU to be predicted, and the column of samples lying to the left of the same PU. Given a dominant prediction direction (horizontal or vertical), one of the reference arrays is defined to be the main array and the other array the side array. In the case of vertical prediction, the reference row above the PU is called the main array and the reference column to the left of the same PU is called the side array. In the case of horizontal prediction, the reference column to the left of the PU is called the main array and the reference row above the PU is called the side array.</p>
<p style="text-align: justify">When the intra prediction angle is positive, blue lines in Figure 1, only the samples from the main array are used for prediction. When the intra prediction angle is negative, red lines in Figure 1, a per-sample test should be performed to determine whether samples from the main or the side array should be used for prediction, as shown in Figure 2 (a). Additionally when the side array is used, the computation of the index into the side array requires a division operation. In order to remove the division operation, the lookup-table (LUT) technique is used for the negative angular prediction process in the calculation of the y-intercept in the case of vertical prediction or the x-intercept in the case of horizontal prediction. Normally, the integer and fractional parts of the intercept between are calculated using the following equations respectively:</p>
<p style="text-align: justify"><em>deltaIntSide = (256*32*(l+1)/absAng)&#62;&#62;8</em></p>
<p style="text-align: justify"><em>deltaFractSide = (256*32*(l+1)/absAng)%256</em></p>
<p style="text-align: justify">where <em>absAng</em> is the absolute value of intra prediction angle (=[ 2,    5,   9,  13,  17,  21,  26,  32]) and <em>l</em> is x/y pixel location for vertical/horizontal prediction. With LUT technique, the above equations can be replaced with the following equations:</p>
<p><em>deltaIntSide = (invAbsAngTable[absAngIndex]*(l+1))&#62;&#62;8</em></p>
<p><em>deltaFractSide = (invAbsAngTable[absAngIndex]*(l+1))%256</em></p>
<p style="text-align: justify">where invAbsAngTable = [4096, 1638, 910, 630, 482, 390, 315, 256]. By using LUT, there is no division operation during the computation of the index into the side array. However, there still exists the per-sample test to determine the main or the side array for prediction. To simplify this process, the main array is extended by projecting samples from the side array onto it according to the prediction direction, as shown in Figure 2 (b). During the projection, the fractional part of the intercept is omitted and the intercept is rounded to the nearest integer:</p>
<p><em>deltaInteger = (invAbsAngTable[absAngIndex]*(l+1)+128)&#62;&#62;8</em></p>
<p style="text-align: justify">Finally, the prediction process only uses the extended main array and the same simple linear interpolation formula to predict all samples in the PU. Figure 2 shows an example of simplified intra prediction with direction angle VER-8.</p>
<p style="text-align: center"><img class="aligncenter" style="float: none;margin-left: auto;margin-right: auto;border-width: 0px" src="http://www.h265.net/wp-content/uploads/2010/12/simplified_intra_pred.png" border="0" alt="HM Decoder" width="223" /></p>
<p style="text-align: center">Figure 2. An example of simplified intra prediction with direction angle VER-8</p>
<p style="text-align: justify">When DC mode is used in the intra prediction, the mean value of samples from both top row and left column is used for the DC prediction.</p>
<p style="text-align: justify">Table 1 summarizes the physical and logical mode indexes used in the bitstream and prediction functions respectively. Depending on the PU size, different numbers of prediction modes are available respectively, as listed in Table 2.</p>
<p style="text-align: center"> Table 1. Physical and logical mode indexes used in the bitstream and prediction functions respectively</p>
<table style="text-align: center" border="1" width="640">
<tbody>
<tr>
<td><strong>Index</strong></td>
<td>0</td>
<td>1</td>
<td>2</td>
<td>3</td>
<td>4</td>
<td>5</td>
<td>6</td>
<td>7</td>
<td>8</td>
<td>9</td>
<td>10</td>
<td>11</td>
</tr>
<tr>
<td><strong>Physical</strong></td>
<td>VER</td>
<td>HOR</td>
<td>DC</td>
<td>VER-8</td>
<td>VER-4</td>
<td>VER+4</td>
<td>VER+8</td>
<td>HOR-4</td>
<td>HOR+4</td>
<td>HOR+8</td>
<td>VER-6</td>
<td>VER-2</td>
</tr>
<tr>
<td><strong>Logical </strong></td>
<td>DC</td>
<td>VER-8</td>
<td>VER-7</td>
<td>VER-6</td>
<td>VER-5</td>
<td>VER-4</td>
<td>VER-3</td>
<td>VER-2</td>
<td>VER-1</td>
<td>VER</td>
<td>VER+1</td>
<td>VER+2</td>
</tr>
</tbody>
</table>
<p style="text-align: justify">[......]</p><p class='read-more'><a href='http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-intra-prediction.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2010/12/analysis-of-coding-tools-in-hevc-test-model-hm-intra-prediction.html/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Analysis of Coding Tools in HEVC Test Model (HM 1.0) – Coding Structure</title>
		<link>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-coding-structure.html</link>
		<comments>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-coding-structure.html#comments</comments>
		<pubDate>Tue, 30 Nov 2010 07:28:24 +0000</pubDate>
		<dc:creator>Yu Liu</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[HM]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=848</guid>
		<description><![CDATA[<p style="text-align: justify">The HEVC test model (HM) still belongs to block-based hybrid video coding framework, except that the macroblock is extended to larger size (up to 64&#215;64) compared with H.264/AVC. In order to facilitate syntax representation of block hierarchy, three block concepts are introduced: coding unit (CU), prediction unit (PU), and transform unit (TU). The overall coding structure is characterized by the various sizes of CU, PU and TU in a recursive manner, once the size of largest coding unit (LCU) and the hierarchical depth of CU are defined.</p>
<p style="text-align: justify">CU, the basic coding unit like the macroblock and sub-macroblock in H.264/AVC, can have various sizes but is restricted to be a square shape. Given the size and hierarchical depth of LCU, CU can be expressed in a recursive quadtree representation adapted to the picture. Figure 1 (b) shows maximum possible recursive CU structure in HM (LCU size = 64 and hierarchical depth = 4). In HM, the coding unit tree structure is limited from 8&#215;8 to 64&#215;[......]</p><p class='read-more'><a href='http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-coding-structure.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-coding-structure.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Analysis of Coding Tools in HEVC Test Model (HM 1.0) – Overview</title>
		<link>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-overview.html</link>
		<comments>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-overview.html#comments</comments>
		<pubDate>Wed, 17 Nov 2010 17:19:15 +0000</pubDate>
		<dc:creator>Yu Liu</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[HM]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=808</guid>
		<description><![CDATA[<p style="text-align: justify;">The HEVC test model (HM) was formally established in the 3rd JCT-VC meeting in Guangzhou, China. HM only contains the minimum set of well tested tools together from a coherent design that is confirmed to show good capability, meanwhile it also follows the “one tool one functionality“ approach. It expects to closely resemble the performance of best–performing proposals, as TMuC did, and plans to contain different clusters of tools (could become a seed for profile in future) with as much commonality as possible. Currently, two configurations of typical coding tools are suggested: High Efficiency and Low Complexity, as listed in the following table.</p>
<p style="text-align: center;">Table 1. Structure of tools forming the high efficiency and low complexity configurations of the HM</p>



<strong>High Efficiency</strong>
<strong>Low Complexity</strong>


Coding unit tree structure (8&#215;8 up to 64&#215;64 luma samples)


Prediction units


Transform unit tree structure (maximum of 3 levels)
Transform unit tree structure (maximum of 2 levels)


Transform bloc[......]<p class='read-more'><a href='http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-overview.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2010/11/analysis-of-coding-tools-in-hevc-test-model-hm-overview.html/feed</wfw:commentRss>
		<slash:comments>23</slash:comments>
		</item>
		<item>
		<title>Introduction to Test Model under Consideration (TMuC)</title>
		<link>http://www.h265.net/2010/06/introduction-to-tmuc.html</link>
		<comments>http://www.h265.net/2010/06/introduction-to-tmuc.html#comments</comments>
		<pubDate>Sun, 27 Jun 2010 04:37:19 +0000</pubDate>
		<dc:creator>Jie Dong</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[HEVC]]></category>
		<category><![CDATA[JCT-VC]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[TMuC]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=552</guid>
		<description><![CDATA[<p style="text-align: justify;">TMuC is the initial test model of JCT-VC, but it is not formally adopted as a test model of the draft standard, as no thorough testing has been performed for such a possible combination of tools. The coding tools in TMuC will be further tested to confirm their effectiveness, before adopted in a formal test model.</p>
<p style="text-align: justify;">TMuC provides more flexibility than H.264/AVC. The  basic coding unit, called coding tree block (CTB), which has a similar role to the macroblocks in H.264/AVC, can have variable sizes (a power of 2). The sizes of the largest and smallest CTBs are specified in the sequence parameter set (SPS). A frame is divided into non-overlapped largest CTBs (LCTB), e.g., 128&#215;128, and then each LCTB can be further divided in a recursive tree representation.</p>
<p style="text-align: justify;">Each CTB has its own prediction type (intra/inter) and prediction partition. The partition can be symmetric, just as in H.264/AVC, or asymmetric, e.g., 64&#215;64 block can be partitioned into 64&#215;16/64&#215;48 or 16&#215;64/48&#038;[......]</p><p class='read-more'><a href='http://www.h265.net/2010/06/introduction-to-tmuc.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2010/06/introduction-to-tmuc.html/feed</wfw:commentRss>
		<slash:comments>11</slash:comments>
		</item>
		<item>
		<title>KTA Software JM11KTA2.3</title>
		<link>http://www.h265.net/2009/04/kta-software-jm11kta23.html</link>
		<comments>http://www.h265.net/2009/04/kta-software-jm11kta23.html#comments</comments>
		<pubDate>Thu, 16 Apr 2009 09:59:07 +0000</pubDate>
		<dc:creator>Jie Dong</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[KTA]]></category>
		<category><![CDATA[Software]]></category>

		<guid isPermaLink="false">http://www.h265.net/?p=28</guid>
		<description><![CDATA[<p>The latest KTA software is <a href="http://iphome.hhi.de/suehring/tml/download/KTA/jm11.0kta2.3.zip">JM11KTA2.3</a>, which integrates the coding tools adopted in the Geneva meeting (Jan. 2009) and before.  </p>
<ol>
<li>Inter prediction
<ol>
<li>Adaptive interpolation filter (AIF)
<ul>
<li>2-D non-separable AIF (<a href="http://ftp3.itu.ch/av-arch/video-site/0610_Han/VCEG-AD08.zip">AD08</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0701_Mar/VCEG-AE16.zip">AE16</a>)</li>
<li>Separable AIF (<a href="http://ftp.h265.net/C219.zip">COM16-C219</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0710_She/VCEG-AG10.zip">AG10</a>)</li>
<li>Directional AIF (DAIF) (<a href="http://ftp3.itu.ch/av-arch/video-site/0710_She/VCEG-AG21.zip">AG21</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0710_She/VCEG-AG22.zip">AG22</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0801_Ant/VCEG-AH17.zip">AH17</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0801_Ant/VCEG-AH18.zip">AH18</a>)</li>
<li>Enhanced DAIF (E-DAIF) (<a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI12.zip">AI12</a>,  <a href="http://ftp.h265.net/C126.doc">COM16-C126</a>)</li>
<li>Enhanced DAIF 2 (E-DAIF2) (<a href="http://ftp.h265.net/C125.doc">COM16-C125</a>)</li>
<li>Enhanced AIF (EAIF) (<a href="http://ftp.h265.net/C464.zip">COM16-C464</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI38.zip">AI38</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0810_San/VCEG-AJ30.zip">AJ30</a>)</li>
<li>Switch interpolation filters with offsets (SIFO) (<a href="http://ftp.h265.net/C463.zip">COM16-C463</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI35.zip">AI35</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0810_San/VCEG-AJ29.zip">AJ29</a>, <a href="http://ftp.h265.net/C126.doc">COM16-C126</a>)</li>
<li>High precision filter (HPF) (<a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI33.zip">AI33</a>)</li>
<li>Single-Pass Encoding (<a href="http://ftp3.itu.ch/av-arch/video-site/0810_San/VCEG-AJ29.zip">AJ29</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0904_Yok/VCEG-AK26.zip">AK26</a>)</li>
</ul>
</li>
<li>1/8-pel MCP (<a href="http://ftp3.itu.ch/av-arch/video-site/0610_Han/VCEG-AD09.zip">AD09</a>)</li>
<li>Extended MCP block size (<a href="http://ftp.h265.net/C123.doc">COM16-C123</a>)</li>
<li>Competition-based MV prediction (<a href="http://wftp3.itu.int/av-arch/video-site/0607_Kla/VCEG-AC06r1.doc">AC06r1</a>)</li>
</ol>
</li>
<li>Transform and quantization
<ol>
<li>Mode-dependent directional transform (MDDT) (<a href="http://ftp3.itu.ch/av-arch/video-site/0704_San/VCEG-AF15.zip">AF15</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0710_She/VCEG-AG11.zip">AG11</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0801_Ant/VCEG-AH20.zip">AH20</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0810_San/VCEG-AJ24.zip">AJ24</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI36.zip">AI36</a>)</li>
<li>Very large block transform (<a href="http://ftp.h265.net/C123.doc">COM16-C123</a>)</li>
<li>Adaptive prediction error coding (APEC) (<a href="http://ftp3.itu.ch/av-arch/video-site/0601_Ban/VCEG-AB06.doc">AB06</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0610_Han/VCEG-AD07.zip">AD07</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0701_Mar/VCEG-AE15.zip">AE15</a>)</li>
<li>Adaptive quantization matrix selection (AQMS) (<a href="http://ftp3.itu.ch/av-arch/video-site/0607_Kla/VCEG-AC07.doc">AC07</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0610_Han/VCEG-AD06.zip">AD06</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0704_San/VCEG-AF08.zip">AF08</a>, <a href="http://ftp3.itu.ch/av-arch/video-site/0807_Ber/VCEG-AI19.zip">AI19</a>)</li>
<li>Rate-distortion optimized quantization (RDO[......]</li></ol></li></ol><p class='read-more'><a href='http://www.h265.net/2009/04/kta-software-jm11kta23.html'>Read More...</a></p>]]></description>
		<wfw:commentRss>http://www.h265.net/2009/04/kta-software-jm11kta23.html/feed</wfw:commentRss>
		<slash:comments>15</slash:comments>
		</item>
	</channel>
</rss>

