Complexity of palette mode coding (AHG9)
(jct-vc@lists.rwth-aachen.de)
-
Analyze complexity characteristics of proposed palette mode methods with regards to throughput, amount of memory, memory bandwidth, parsing dependencies, parallelism, pixel processing, and other aspects of complexity as appropriate.
-
Quantify the average and worse case throughput (context-coded as well as bypass bins) for palette mode operation and compare it with the average and worse case throughput for other coding modes.
-
Analyze and identify the complexity implications of interleaved and non-interleaved escape colour value signalling.
-
Study latency implications of palette mode coding.
-
Identify criteria to determine the hardware implementability of the key hardware modules.
-
Identify bottlenecks in the current design with regard to implementation complexity.
|
A. Duenas (chair), R. Joshi, S.-H. Kim, W. Wang, X. Xiu (vice chairs)
|