نتایج جستجو برای: block markov coding

تعداد نتایج: 349226  

Intra coding in High efficiency video coding (HEVC) can significantly improve the compression efficiency using 35 intra-prediction modes for 2N×2N (N is an integer number ranging from six to two) luma blocks. To find the luma block with the minimum rate-distortion, it must perform 11932 different rate-distortion cost calculations. Although this approach improves coding efficiency compared to th...

Intra coding in High efficiency video coding (HEVC) can significantly improve the compression efficiency using 35 intra-prediction modes for 2N×2N (N is an integer number ranging from six to two) luma blocks. To find the luma block with the minimum rate-distortion, it must perform 11932 different rate-distortion cost calculations. Although this approach improves coding efficiency compared to th...

2009
Gordhan Das Menghwar Christoph F. Mecklenbräuker

User cooperation is a communication strategy where transmitting users share their resources to help each others’ transmission for reliable delivery of their message at destination. Multiple-access-channel with Dedicated-relay (MAC-DR) is a MAC channel, where there are more than one transmitters, single receiver, and a fixed or dedicated node which act as a relay for transmitting users. In this ...

2011
Aditya Kumar Pardeep Singh

This comparison paper scrutinizes image compression using Block Truncation Coding. Many algorithms were selected likely the original Block Truncation coding, Absolute Moment Block Truncation Coding, a comparison survey was executed. These above techniques are divided image into non overlapping blocks. They distinguish in the direction of choosing the quantization level in order to remove redund...

Journal: :IEEE Transactions on Information Theory 2023

Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is critical component efficient deoxyribonucleic acid (DNA) data storage systems. In this paper, we consider concatenated coding scheme with outer nonbinary low-density parity-check code or polar either inner convolutional time-varying block code. We propose two novel dec...

1999
Venceslav Kafedziski

A novel approach to joint source and channel coding for frequency selective channels is presented. Multicarrier modulation is used to obtain an equivalent vector channel to the frequency selective channel and utilize the linear coding procedure of Lee and Petersen. The use of the block pulse amplitude transmission results in graceful degradation of the decoded signal for low channel SNR. The ne...

Journal: :IEEE Trans. Information Theory 1991
Neri Merhav

-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...

2000
Yong Wang Mandyam D. Srinath

One inherent problem of network video is the sensitivity of the compressed bit-stream to data loss. Error propagation is one of the most important factors that affect the quality of network video. This paper discusses a new scheme for robust video coding to cope with this problem. First, error propagation in Block Motion Compensation (BMC) in H.263 is analyzed using a Markov chain model. Severa...

2012
Jumpei Taketsugu

Abstract—We propose random relaying of MDS codeword blocks in cooperative multi-hop networks and evaluate its performance over random error channels by means of an absorbing Markov chain. The proposed scheme can apply to cooperative multi-hop networks with the arbitrary number of relay nodes at each hop stage and require no feedback channels between nodes. In the proposed scheme, a message bloc...

2017
Neevan Kakkan Ramalingam

We investigate the superposition strategy and its usefulness in terms of achievable information theoretic rates. The achievable rate of the superposition of block Markov encoding (decode-forward) and side information encoding (compress-forward) for the three-node Gaussian relay channel is analyzed. It is generally believed that the superposition can out perform decode-forward or compress-forwar...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید