A Reconfigurable implement of the Chroma Intra-frame linear Prediction Algorithm

Although the cross-component linear model used in H.266 chroma coding can increase the coding efficiency, it also introduces the issue of high complexity. To address this problem, this paper studies the relationship between the texture complexity of Coding Units (CU) and the coding modes of other CUs that are spatially adjacent to them. The article proposes a fast linear pattern prediction algorithm based on adjacent block coding patterns and texture complexity. First, data from experiments are used to determine the association between texture complexity and intra-frame prediction pattern decision. Second, the current encoding pattern is decided by analyzing the encoding patterns adjacent to the current space. Finally, a parallel implementation strategy for DPRAP-based chroma linear intra-frame prediction mapping is developed. According to the testing results, the optimized method has an execution time reduction of roughly 26.3% when compared to the VTM-9.0 standard algorithm.