In this paper, we propose an improved DC prediction method for high-efficiency video coding (HEVC) intra coding. The technique involves the application of pixel-wise predictors rather than block-based predictor in the DC mode. In HEVC, the pixels of neighboring reconstructed blocks are used to support multiple directional spatial prediction modes and reduce spatial redundancy. For lossless codi...

H.264/AVC is currently one of the most commonly used video coding standards. The compression efficiency of H.264/AVC is higher than any other previous video coding standards, as it includes more sophisticated coding techniques, such as intra prediction, variable block size motion estimation, rate-distortion optimized mode decision, and entropy coding (Luthra et al., 2003; Sullivan & Wiegand, 20...

In this paper, an interpolation technique of nearest neighbour base is proposed along with absolute block truncation coding that exploited the spatial domain of low resolution image, and then reversely reconstruct the up layers hierarchically. The results showed the superior performance of compression ratio and image quality compared to traditional absolute block truncation coding.

Block-Matching motion compensation is one of the key technologies in current video coding standards and requires about 70% of the overall execution time. Therefore, parallelization of video coding always involves parallelization of block-matching motion compensation. In this work we use this communication intensive application to show the limitations of cluster computing as compared to shared m...

In Broadcast and Multicast Services (BCMCS) for CDMA2000 networks, Reed–Solomon (RS) coding is applied to the layers above the turbo code. An additional block interleaving mechanism improves the performance of RS coding when there are long bursts of errors. We propose a performance model of RS coding for varying conditions of Rayleigh fading on the broadcast channel with the maximum amount of b...

Block-coded modulation with interblock memory (BCMIM) is a variation of block-coded modulation (BCM) which is designed for multilevel coding. By providing interblock memory between adjacent blocks, the coding rate of a BCMIM scheme can be increased without decreasing the minimum squared Euclidean distance (MSED) as compared to the original BCM. In an early version of BCMIM, interblock coding is...

We undertake a study of the performance difference of different transform coding techniques i.e. Block truncating coding, wavelet and fractal image compression. This paper focuses important features of transform coding in compression of still images, including the extent to which the quality of image is degraded by the process of compression and decompression. The above techniques have been suc...

The joint source channel coding problem of transmitting a pair of correlated sources over a 2−user MAC is considered. A new concatenated coding scheme, comprising of an inner code of fixed block-length and an outer code of arbitrarily large block-length, is proposed. Its information theoretic performance is analyzed to derive a new set of sufficient conditions. An example is identified to demon...

A coding scheme for the binary memoryless source is presented. The scheme is an extension of a scheme discovered by Lynch and Davisson and developed by Schalkwijk, and is based upon the Schalkwijk algorithm for the Lynch-Davisson (LD) code. The new coding scheme is shown to be asymptotically optimal as the block length approaches infinity, regardless of the source statistics. Although the LD sc...