The hard square model consists of all binary arrays in which the s are isolated both hor izontally and vertically Based on a certain proba bility measure de ned on those arrays an e cient variable to xed rate encoder scheme is obtained that maps unconstrained binary words into arrays that sat isfy the hard square model For su ciently large ar rays the average rate of the encoder approaches a va...

A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined. The storage capacity is found when complete defect information is given to the encoder or to the decoder, and when the defect information is given completely to the decoder but only partially to the encoder. Achievable storage rates are established when partial defect inform...

We introduce the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. We show that such distortion side information is not only useful at the encoder, but that under certain conditions, knowing it at only the encoder is as good as knowing it at both encoder and decoder, and knowing it at only the decoder is useless. Thus d...

This paper presents an H.264 standard-compliant video encoder optimized for region-of-interest (ROI) based coding and applied to American Sign Language (ASL) videos. Three encoding parameters are developed which allow the encoder to allocate both rate and computational resources differently between the ROI and non-ROI. An objective measure of intelligibility is included in an encoder parameter ...

We propose a novel extension of the encoder-decoder framework, called a review network. The review network is generic and can enhance any existing encoderdecoder model: in this paper, we consider RNN decoders with both CNN and RNN encoders. The review network performs a number of review steps with attention mechanism on the encoder hidden states, and outputs a thought vector after each review s...

We introduce a new way to use fractal coding for image compression, based on the parallel use of a fractal encoder and a DCT encoder. The two encoders are given the complementary roles to capture the information of edge and smooth variation, and the information of detail respectively. We show the advantage of using this hybrid coding scheme over the use of a fractal encoder alone, or a DCT enco...

HEVC doubles the coding efficiency with more than 4x coding complexity as compared to H.264/AVC. To alleviate the burden of Intra encoder, we estimate the RD-cost from the source image textures, and dynamically select two promising CU/PU mode candidates to execute exhaustive RDO processing. As integrated in our hardwired encoder, the averaged 61.7% computation complexity was saved with 4.53% ra...

In this paper, a FPGA implementation of IEEE 802.16e LDPC encoder is presented. We employ parity bit prediction and correction to break up the data dependency within the encoding process. This encoder implementation can handle sixteen combinations of code rates and code lengths defined in IEEE 802.16e standards. Efficient hardware architecture reduces the complexity and area of encoder that can...

The hard-square model, also known as the two-dimensional (2-D) (1 )-RLL constraint, consists of all binary arrays in which the 1’s are isolated both horizontally and vertically. Based on a certain probability measure defined on those arrays, an efficient variable-to-fixed encoder scheme is presented that maps unconstrained binary words into arrays that satisfy the hard-square model. For suffici...