A formal duality between the information embedding (data hiding) problem and the Wyner-Ziv problem of source coding with decoder side information is developed, including results for the quadratic Gaussian and binary-s...
详细信息
ISBN:
(纸本)0780371232
A formal duality between the information embedding (data hiding) problem and the Wyner-Ziv problem of source coding with decoder side information is developed, including results for the quadratic Gaussian and binary-symmetric-Hamming cases, with implications for a number of important applications.
A 3-node lossy source coding problem for a 2-DMS (X 1 , X 2 ) is considered. source nodes 1 and 2 observe X 1 and X 2 , respectively, and each wishes to reconstruct the other source with a prescribed distortion. To a...
详细信息
A 3-node lossy source coding problem for a 2-DMS (X 1 , X 2 ) is considered. source nodes 1 and 2 observe X 1 and X 2 , respectively, and each wishes to reconstruct the other source with a prescribed distortion. To achieve these goals, nodes 1 and 2 send descriptions of their sources to relay node 3. The relay node then broadcasts a joint description to the source nodes. A cutset outer bound and a compress-linear code inner bound are established and shown to coincide in several special cases. A compute-compress inner bound is then presented and shown to outperform the compress-linear code in some cases. An outer bound based on Kaspi's converse for the two-way source coding problem is shown to be strictly tighter than the cutset outer bound.
Use of low-density generator matrix codes as codebook and encoding with message-passing algorithm is an efficient approach for lossy coding of the i.i.d. binary source. We propose lossy source encoder which is trained...
详细信息
ISBN:
(数字)9784885523410
ISBN:
(纸本)9781665499071
Use of low-density generator matrix codes as codebook and encoding with message-passing algorithm is an efficient approach for lossy coding of the i.i.d. binary source. We propose lossy source encoder which is trained on the associated unfolded Tanner graph for improving the rate-distortion performance and/or reducing computational cost.
Recent advances in distributed source coding (DSC) for mission-driven wireless sensor networks (WSN) are related to the coding for multiple correlated sensors in applications such as real time target tracking and envi...
详细信息
Recent advances in distributed source coding (DSC) for mission-driven wireless sensor networks (WSN) are related to the coding for multiple correlated sensors in applications such as real time target tracking and environment monitoring. The characteristic of these DSC applications provides significant potential opportunities in the associated sensor network to utilize multirate transmissions for enhancing network performance. In this paper, we study a methodology for interplay optimization between routing and DSC in WSN, and propose a novel multirate based routing scheme for mission-driven DSC applications that considerably extends network lifetime. The proposed scheme adopts the rate assignment based on the residual energy, and employs a joint rate and energy scheduling mechanism to meet the end-to-end transmission rate constraint, information precision requirement, and the energy constraints in the network for DSC. Simulation results show that this multirate based routing scheme achieves significantly longer network lifetime compared to other existing research in WSN for DSC applications.
Run period Encoding (RLE) is a powerful and efficient approach for fact compression and supply coding. It is generally applied to the lossless compression of grayscale or bi-tonal (black-and-white) photos and digital ...
详细信息
ISBN:
(数字)9798350370249
ISBN:
(纸本)9798350370270
Run period Encoding (RLE) is a powerful and efficient approach for fact compression and supply coding. It is generally applied to the lossless compression of grayscale or bi-tonal (black-and-white) photos and digital pix. Significantly, RLE decreases the statistics required to save and transmit virtual facts. That is completed by making the information greater compact and casting off redundancy. Typically, RLE counts the number of consecutive occurrences of a given image or sign and then encodes those occurrences into an unmarried cost. By encoding multiple repetitions of a symbol in this manner, RLE can reduce the entire quantity of statistics wanted for garage or transmission. The RLE set of rules works by looking for long strings of characters that may be compressed into fewer characters. Exploring the potential packages of RLE in supply coding and records compression is an ongoing study subject matter within the area.
Reserving space for a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper, we show how to exploit this capability using two sequential decoder structures to pro...
详细信息
Reserving space for a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper, we show how to exploit this capability using two sequential decoder structures to provide powerful error correction capability. This joint source/channel coder design provides significant packet loss recovery with minimal rate overhead, and compares favorably with conventional schemes.
This paper explores different encoding methods for speech signals and provides a methodology for a narrowband speech waveform with a targeted bandwidth of less than 25 kHz. This waveform could be used in any standard ...
详细信息
ISBN:
(数字)9798350370249
ISBN:
(纸本)9798350370270
This paper explores different encoding methods for speech signals and provides a methodology for a narrowband speech waveform with a targeted bandwidth of less than 25 kHz. This waveform could be used in any standard reconfigurable radio system. The paper also explores the effectiveness of different source encoding techniques for speech and audio signals, and also considering effects of different source coding techniques on signal quality and bandwidth utilization. The proposed methodology for the narrowband speech waveform emphasizes on optimizing resources while maintaining a targeted bandwidth requirement under $25 \mathbf{k H z}$. Different encoding schemes for speech have been studied and different parameters such as SNR, compression ratio and encoding decoding time has been calculated using mathematical simulation software. Few of the promising schemes have been simulated with entire narrowband waveform and their performance within the specified targeted bandwidth has been assessed at different bit error rate introduced by channel.
Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized and dynamic environments such as peer-to-...
详细信息
Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized and dynamic environments such as peer-to-peer networks is marginal, as peers can rapidly end up in a deadlock situation. Many proposed solutions to this problem are either less resilient to freeloading behavior or induce a computational overhead that cannot be sustained by regular peers. In contrast, we retain tit-for-tat, but enhance the system with a novel form of source coding and an effective scheme to prevent peers from freeloading from seeding peers. We show that our system performs well without the risk of peer starvation and without sacrificing fairness. The proposed solution has a reasonably low overhead, and may hence be suitable for fully distributed content distribution applications in real networks.
Renewal theory is a powerful tool in the analysis of source codes. In this paper, we use renewal theory to obtain some asymptotic properties of finite-state noiseless channels. We discuss the relationship between thes...
详细信息
Renewal theory is a powerful tool in the analysis of source codes. In this paper, we use renewal theory to obtain some asymptotic properties of finite-state noiseless channels. We discuss the relationship between these results and earlier uses of renewal theory to analyze the Lempel-Ziv codes and the Tunstall code. As a new application of our results, we provide a simple derivation of the asymptotic performance of the prefix condition code that minimizes the average transmission cost when the source symbols are equiprobable.
暂无评论