The growing demand for high-performance ultra- high-definition video coding leads to H.265/HEVC, where the increased computational complexity and data/timing dependency hinder its coding throughput. To address these challenges, this paper presents four algorithm adaptations and a fully-parallel hardware architecture for H.265/HEVC intra encoder. To our best knowledge, this is the first fully-parallel H.265/HEVC intra encoder. This design supports 35 prediction modes and all CTU partitions. All PUs are independently processed in four prediction engines for high parallelism. An appropriate set of intra prediction modes, RDO candidates, and CABAC rate estimate instances is assigned to each PE, where internal computational tasks are pipelined and scheduled to maximize the processing throughput. Compared with the HM-15.0 software, the proposed algorithm adaptations lead to a reduction of 27% in computational workload, while the average BD-Rate and BD-PSNR are 4.39% and -0.21dB, respectively. This BD-Rate is lower than existing designs with the same video resolution. FPGA implementation of proposed design shows it operates at 120MHz and supports 45 fps of 1080P video sequences using 201K logic elements and 120KB on-chip SRAM. ASIC implementation of the proposed design in TSMC 90nm technology shows that its clock frequency reaches 320MHz with a hardware gate count of 2288K, and it supports real-time encoding of 30 fps of 4K video sequences. Compared with state-of-the-art designs, our proposed design demonstrates advantages in computational complexity, bit rate, video quality, throughput, reliability, and flexibility.
1 February 2019 in AEU - International Journal of Electronics and Communications
High computational complexity and heavy data/ timing dependency in HEVC hinder the throughput of video encoding. In order to address both design challenges, we present high-performance algorithm adaptations and high-throughput hardware architecture for HEVC intra encoders. Particularly, the chroma intra prediction includes the derived luma mode, which greatly improves the worst-case video compression performance. Compared with the HM-15.0 reference software, the proposed algorithms reduce the computational workload by 22%, while the average BD-Rate and BD-PSNR for classes A-F and 4K are 2.79% and -0.13dB, respectively. This BD-Rate is lower than existing designs in the literature with the same video resolution. The FPGA implementation of proposed design shows it operates at 120MHz and supports 45 fps of 1080P video sequences using 196K logic elements and 127KB on-chip SRAM. The ASIC implementation of the proposed design in TSMC 90nm technology shows that its clock frequency reaches 320MHz with a hardware gate count of 2186K and power consumption of 290mW, and it supports real-time encoding of 4K videos at 30 fps.
23 November 2017 in IEEE Transactions on Circuits and Systems II: Express Briefs
This paper presents a 5.8GHz digitally controlled DSRC receiver for Chinese electronic toll collection system. All RF, IF blocks and digital baseband for on-chip automatic gain control, are integrated on an RF-SoC. The proposed digitally controlled LNA and mixer circuits are elaborated. The test chip was realized in a 0.13µm CMOS technology. The RF blocks in receiver occupy a chip area of 0.75mm². The receiver blocks consume 22mA under a 1.5V supply voltage. Measurement results show that the bit error rate maintains better than 10¯⁶, while the input power level varies from -75dBm to -8dBm. This design results in a receiver sensitivity improvement of at least 25%, and a dynamic range enhancement of at least 12%.
In a multithreaded execution environment, race condition leads to computational errors and system hazards. Up to date, a series of task scheduling strategies have been presented in the literature to reduce the risk of race condition. Because of the increasing complexity of this problem in multi-core systems, existing task scheduling approaches are not very efficient. To deal with this challenge, in this work, we develop a race-condition-aware and hardware-oriented task partitioning and scheduling algorithm using entropy maximization model. We model uncertainty as a probabilistic occurrence within a time interval, and hence the characteristics of event ordering are analyzed through an uncertainty matrix. Next, a metric is developed to measure the uncertainty of task execution in various execution environments. Finally, a maximum entropy model is generated to ensure the lowest probability of race condition during task execution. The smallest one among maximum entropy values is chosen and used in our proposed task scheduling algorithm. Experimental results show that the proposed task scheduling strategy based on our maximum entropy model outperforms existing state-of-the-art approaches. For example, in a 128-core computing system, the task execution time, CPU utilization ratio, and throughput of our proposed task scheduling is improved by $15.3\% \sim 36.4\%$ , $8.2\% \sim 17.6\%$ , and $20.7\% \sim 41.4\%$ , respectively. Moreover, our proposed scheduling algorithm exhibits low computational complexity and good adaptivity to diverse execution environments.