JVET-Q0784 Combination of JVET-Q0106, JVET-0686 and JVET-Q0133 for LFNST Signalling, Latency Reduction and Scaling Process [H. E. Egilmez, A. Nalci, A. K. Ramasubramonian, M. Coban, V. Seregin, M. Karczewicz (Qualcomm), T. Hashimoto, T. Chujoh, E. Sasaki, T. Ikai (Sharp)] [late]
This was reviewed in Track B Wednesday 15 January at 1750.
This document describes the specification text changes needed for the combination of JVET-Q0106, JVET-Q0686 and JVET-Q0133 proposals which are adopted during Main Track A.
During the discussion, it is pointed out that the worst case complexity is not changed, if LFNST stays enabled for the dual tree case. It is therefore asked what the performance drop would be when single tree was used in AI? There would probably be some loss.
It is again suggested that JVET-Q0529 would also ultimately solve the problems addressed (except the bug fix of JVET-Q0133). However, it would also not improve worst case complexity in terms of processing, may be somewhat better regarding latency and buffer (which are however implementation architecture dependent), and the necessary syntax changes are substantially more than with JVET-Q0784. The spec text of JVET-Q0784 appears straightforward, where the elements coming through inclusion of JVET-Q0686 are small.
There is no convincing argument for reverting the decision made initially
Decision: Adopt JVET-Q0784.
Residual coding (8)
Contributions in this category were discussed Thursday 9 Jan. 1800–1900 in Track B (chaired by JRO).