The Versatile Video Coding (H.266/VVC) standard has developed by Joint Video Exploration Team (JVET). Compared with the previous generation video coding standard, the H.266/VVC is more outstanding. Since the H.266/VVC introduces multi-type tree (MTT) structure including binary tree (BT) and ternary tree (TT), which brings the significant coding efficiency but increases coding complexity. Moreover, the intra prediction modes have increased from 35 to 67, which can provide more accurate prediction than H.265/High Efficiency Video Coding (HEVC). Therefore, these can improve the encoding quality, but increase computational complexity. To reduce the computational complexity, this paper designs a fast coding unit (CU) partition and intra mode decision algorithm, which includes fast CU partition based on random forest classifier (RFC) model and fast intra prediction modes optimization based on texture region features. Simulation results indicate that the proposed scheme can save 54.91% encoding time with only 0.93% increase in BDBR.
The versatile video coding (VVC) is the latest video coding standard, which uses a Multi-Type Tree (MTT) coding structure. Compared with existing video coding standards, this structure can flexibly split coding blocks according to the complex texture features of the image. As MTT structure introduces binary tree (BT) and ternary tree (TT) splitting, it will lead to a sharp increase in computational complexity. In the paper, a fast Coding Unit (CU) size decision method for intra prediction of VVC is proposed, which can significantly reduce the calculation in the intra encoding of VVC. The proposed method consists of two steps: 1) determine whether CU is divided and 2) select the best CU splitting mode. In the intra prediction process, the CU texture complexity is firstly calculated, which judges whether the CU is divided into sub-CUs. Then, the unnecessary splitting mode candidates are discarded according to the relationship between the texture direction and the CU splitting mode. The experimental results show that our proposed fast CU partition method reduces about 48.58% the computational complexity, while the BDBR only increases by 0.91%.
The joint video expert team (JVET) is currently developing a new video coding standard called H.266/Versatile Video Coding (VVC). Compared with High Efficiency Video Coding (HEVC), VVC has added a variety of coding tools. These tools have greatly improved video compression efficiency and maintained a high level video quality. However, due to the increase in computational complexity, the encoding time is much longer than HEVC. We propose a prediction tool based on DenseNet (a convolutional neural network) to decrease the VVC coding complexity. We predict the probability that the edge of 4 ×4 blocks in each 64 ×64 block is the division boundary by Convolutional Neural Networks (CNN). Then, we skip the unnecessary rate distortion optimization (RDO) and speed up the coding by probability vectors in advance. The proposed method can reduce the coding complexity of 46.10% in VTM10.0 intra coding, while Bjøntegaard delta bit rate (BDBR) only increases by 1.86%. In the sequence with a resolution greater than 1080P, the acceleration efficiency can be at 64.81%, the BDBR loss only increased by 1.92%.
The H.266/Versatile Video Coding (VVC) standard is the latest video coding standards released by the Joint Video Exploration Group (JVET). These new technologies have brought more than 40% increase in compression rate and brought huge coding complexity. In order to reduce the coding complexity of VVC, we propose a fast Coding Unit (CU) partition decision algorithm combining Bayes algorithm and Improved De-blocking Filter (IDBF). The algorithm includes two stages. In the parameter update stage, the original VVC Test Model (VTM) is used to encode every certain video frame, and the Rough Mode Decision evaluation cost (JRMD) generated during the encoding process is used to update the parameters of the Bayes algorithm. In the fast coding stage, the video frame between two parameter update frames is encoded. First, the JRMD of the current CU is calculated and compares it with the split threshold to decide whether the current CU continues to split. If the current CU continues to be split, the current CU is divided into the same 16 simulation blocks, and the IDBF is used to calculate the texture direction and texture complexity of each simulation block. According to the texture features contained in the simulation block, the texture distribution position and texture complexity in the current CU can be judged, so that some bad candidate splitting modes can be discarded. Experimental results show that the proposed method can reduce the complexity of VVC about 56.08%, while Bjontegaard delta bit rate (BDBR) only increases by 1.30%.
As a promising interference management technology, interference alignment (IA) applied in reconfigurable intelligent surface (RIS)-aided interference networks can eliminate the mutual interference and improve system performance. Most of existing works study the iterative RIS-aided IA schemes with high computational complexity. In this paper, we study the closed-form IA design problem for sum-rate improvement and interference mitigation, in active RIS-aided multiuser multiple-input multiple-output (MIMO) networks. A novel joint active and passive beamforming scheme based on interference subspace alignment (ISA) is proposed, where the former is to eliminate the interference completely, and the latter is to compress the interference subspace. The proposed scheme can achieve the full MIMO multiplexing gain. Simulation results show that the proposed scheme outperforms state-of-the-art benchmarks in terms of sum-rate performance and computational complexity, and the computational complexity is 15 times lower compared to the iterative RIS-aided IA scheme.
H.266/VVC introduces new technologies based on previous video coding standards, including the QTMT partition structure and support for 65 angular intra-prediction modes. The introduced new technologies significantly improve the coding efficiency, but also lead to a great increase in coding complexity. This paper proposes a ResNet-based fast CU partition decision algorithm to reduce the coding complexity of VVC. First, we count and analyze the proportion of CU split modes to explore the appropriate CNN models. Then, the ResNet-based CNN models are designed to predict CU split mode, and the first convolutional layer of the CNN models combines symmetric and asymmetric convolutional kernels to extract features efficiently. We also introduce the RD cost into the loss function to improve the prediction accuracy of CNN models. Finally, two threshold schemes are used to achieve a compromise between coding complexity and coding performance. The experimental results show that the “Fast” scheme saves 55.12% of the encoding time with 1.83% BDBR increase and the “Moderate” scheme saves 47.03% of the encoding time with only 1.27% BDBR increase compared with VTM7.0.