DLD-MAC:一种区分服务的低时延传感器网络MAC协议

针对现有无线传感器网络MAC协议不能提供区分服务和传输时延较大的问题,在经典多跳传输协议DW-MAC的基础上,提出了一种具有区分服务功能的低时延MAC协议—DLD-MAC(Diffserv-based Low-Delay MAC)。其基本思路是让高优先级数据选择更小的竞争窗口,以降低时延和能耗。Markov建模分析表明,DLD-MAC能对不同优先级的业务流进行很好的服务区分,而且相较于传统的无线传感器网络MAC协议,其在时延性能上有显著优势,能更有效地保障服务质量。     

Adaptive quantization parameter selection for low-delay HEVC via temporal propagation length estimation

Rate Distortion Optimization (RDO) is employed in High-Efficiency Video Coding (HEVC) to enhance its coding efficiency. Owing to its coding complexity, RDO is traditionally performed within each frame with fixed quantization parameters (QPs), without fully considering the coding dependencies between the current frame and future frames within a temporal propagation chain. To improve the coding efficiency of HEVC, it is desirable to perform a global RDO among consecutive frames while maintaining a similar coding complexity. To address this problem, in this paper, temporal dependencies are first measured via a model for the energy of prediction residuals that enables the formulation of the global RDO in low-delay (LD) HEVC. Second, the notion of propagation length is introduced, which is defined as the impact length of the current frame on future frames. This length is estimated via offline experiments and used to propose two novel methods to predict the impact of the coding distortion of the current frame on future frames from previous frames of similar coding properties. Third, we apply these two methods to adaptively determine the Lagrangian multiplier and its corresponding QP for each frame in the LD configuration of HEVC. Experimental results show that, in comparison to the default LD HEVC, the first method can achieve, on average, BD-rate savings of 5.0% and 4.9% in low-delay-P (LDP) and low-delay-B (LDB) configurations, respectively, and the second can achieve, on average, BD-rate savings of 4.9% and 4.9% in the LDP and LDB configurations, respectively, all with insignificant increases in encoding time.     

Reference picture selection with decreased temporal dependency for HEVC error resilience

The high level of compression efficiency achieved by the High-Efficiency Video Coding standard (HEVC) decreases the robustness of the encoded bitstreams. This increased susceptibility to network errors leads to end video quality degradation. Moreover, due to the high computational complexity of HEVC, high-resolution video transmission with time constraints over hostile channels such as wireless networks becomes more challenging. This paper proposes a reference picture selection-based error-resilient method to reduce the temporal error propagation due to high-trip delay and frame-copy concealment error. First, the encoder selects the reference pictures based on the error status received from the feedback channel, taking into consideration the Rate-Distortion-Optimization (RDO). Second, the temporal information mismatch prediction resulting from the error concealment is reduced by decreasing the temporal dependency between adjacent frames based on new motion-estimation tools. Results show a PSNR gain of about 6.13 dB, 5.20 dB and 4.72 dB for 1080p, 720p and 480p resolutions respectively.     

Motion estimation in low-delay hierarchical p-frame coding using motion vector composition

Low-delay hierarchical prediction structure is currently adopted in various new video coding standards. The only hurdle of this structure is the need of motion estimation in distant reference frames. To maintain high coding efficiency, a large search range for motion estimation can improve the coding efficiency in distant reference pictures. Computational complexity will thus be increased dramatically. In this paper, a fast motion estimation scheme for a low-delay hierarchical P-frame structure is proposed. The proposed scheme adopts a motion vector composition strategy to expedite the motion estimation process for distant reference frames in the hierarchical P structure. In addition, a motion vector composition algorithm is tailor-made with the proposed hierarchical P coding scheme to further improve the coding efficiency. Simulation results show that the proposed scheme can deliver a remarkable complexity savings and coding efficiency improvement on coding a frame in low temporal layers of the hierarchical P structure.     

用于MIMO-OFDM系统QR分解的分布式脉动阵列处理算法

针对多载波系统中信道矩阵QR(正交三角矩阵)分解的延时问题,该文提出适用于MIMO-OFDM系统QR分解的分布式脉动阵列处理(Distributed Systolic Array Processing, DSAP)算法。该算法包含两种处理机制,一是交织预处理,对不同子载波信道矩阵行矢量进行分组交织处理,按照延时递增规律将每列信道矩阵元素读出并输入到脉动阵列;二是分布式脉动阵列计算,通过脉动阵列边界单元和内部单元中流水线CORDIC计算和子载波同步处理实现信道矩阵QR分解分布式处理,实现不同子载波QR分解分布于脉动阵列边界单元和内部单元中CORDIC不同级。与串行脉动阵列处理(Serial Systolic Array Processing, SSAP)算法比, DSAP算法充分利用时钟周期,分解延时约为SSAP算法的8%,有效减少数据处理延时,而复杂度几乎没有增加。