We aim at developing a streamlined genome sequence compression algorithm to support alternative miniaturized sequencing devices, which have limited communication, storage, and computation power. Existing techniques th...
详细信息
We aim at developing a streamlined genome sequence compression algorithm to support alternative miniaturized sequencing devices, which have limited communication, storage, and computation power. Existing techniques that require heavy client (encoder side) cannot be applied. To tackle this challenge, we carefully examined distributed source coding theory and developed a customized reference-based genome compression protocol to meet the low-complexity need at the client side. Based on the variation between source and reference, our protocol will pick adaptively either syndrome coding or hash coding to compress subsequences of changing code length. Our experimental results showed promising performance of the proposed method when compared with the state-of-the-art algorithm (GRS).
We show how real-number codes can be used to compress correlated sources, and establish a new framework for distributed lossy sourcecoding, in which we quantize compressed sources instead of compressing quantized sou...
详细信息
ISBN:
(纸本)9781467318808
We show how real-number codes can be used to compress correlated sources, and establish a new framework for distributed lossy sourcecoding, in which we quantize compressed sources instead of compressing quantized sources. This change in the order of binning and quantization blocks makes it possible to model correlation between continuous-valued sources more realistically and correct quantization error when the sources are completely correlated. The encoding and decoding procedures are described in detail, for discrete Fourier transform (DFT) codes. Reconstructed signal, in the mean-squared error sense, is seen to be better than or close to quantization error level in the conventional approach.
The problem of correlated information multicasting is considered in this paper, i.e., from multiple sources to multiple destinations through a network. It can be solved by jointly optimizing the distributedsource cod...
详细信息
ISBN:
(纸本)9781457701009
The problem of correlated information multicasting is considered in this paper, i.e., from multiple sources to multiple destinations through a network. It can be solved by jointly optimizing the distributed source coding and network coding. Previous research found that optimal performance can be achieved with unlimited decoding complexity, which cannot be applied in practical implementations. Some practical methods were also presented, which shows sub-optimal performance. To improve the coding performance and keep the low complexity of the algorithm, an adaptive coding and transmission scheme according to the conditional entropy of the sources is proposed. It has been demonstrated that the proposed scheme can achieve better performance compared with the existing ones.
This paper presents a general approach to designing distributed joint source channel (DJSC) codes with arbitrary rates for communication of a pair of correlated binary sources over noisy channels. In this approach, bo...
详细信息
This paper presents a general approach to designing distributed joint source channel (DJSC) codes with arbitrary rates for communication of a pair of correlated binary sources over noisy channels. In this approach, both distributed compression and channel error correction are simultaneously achieved by transmitting, for each source, a fraction of the information bits together with the parity bits of a systematic channel code. This approach is shown to be asymptotically optimal, i.e., any rate-pair in the achievable rate-region can be approached as the codeword length is increased. The practical realization of such a code requi res the design of a pair of channel codes with unequal error protection (UEP) properties determined by the inter-source correlation and the channel capacity available to each source. Towards this end, a linear programming based procedure for jointly optimizing the degree profiles of a pair of irregular LDPC codes to achieve the required UEP properties is presented. Experimental results obtained with both binary symmetric channels and binary-input Gaussian channels are presented, which demonstrate that the proposed UEP-DJSC codes can significantly outperform separate source-channel codes, as well as previously reported joint source-channel coding schemes, particularly for short codeword lengths.
distributed source coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. More specifically, distributed Joint source-Channel coding (DJSC) is ...
详细信息
distributed source coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. More specifically, distributed Joint source-Channel coding (DJSC) is associated with the scenario, where the correlated source signals are transmitted through a noisy channel. On one hand, employing DSC or DJSC schemes exploits the existing correlation between sensors resulting in minimising the transmission energy required by the sources, while maintaining reliable communication. On the other hand, Network coding (NC) is an efficient data transport technique leveraging network efficiency, by allowing Relay Nodes (RNs) in a communication network to combine multiple data packets received via the incoming links before transmitting them to the Destination Node (DN). In this paper, the bandwidth -efficient distributed Joint Turbo Trellis -Coded Modulation (DJTTCM) aided by both Dynamic Network coding (DNC) and Adaptive DNC (ADNC)-based cooperative transmission schemes are proposed. Both systems are proposed for supporting correlated source transmissions over hostile channels experiencing both small-scale and large-scale fading in which the RNs dynamically transmit its non -binary linear combinations to the DN. A substantial gain of 19.5 dB was attained at a correlation coefficient of rho = 0.8 over its counterpart dispensing with NC.
作者:
Cen, FengTongji Univ
Dept Control Sci & Engn Shanghai 200092 Peoples R China
Low-density parity-check (LDPC) codes with the parity-based approach for distributed joint source channel coding (DJSCC) with decoder side information is described in this letter. The parity-based approach is theoreti...
详细信息
Low-density parity-check (LDPC) codes with the parity-based approach for distributed joint source channel coding (DJSCC) with decoder side information is described in this letter. The parity-based approach is theoretical limit achievable. Different edge degree distributions are used for source variable nodes and parity variable nodes. Particularly, the codeword-averaged density evolution (CADE) is presented for asymmetrically correlated nonuniform sources over the asymmetric memoryless transmission channel. Extensive simulations show that the splitting of variable nodes can improve the coding efficiency of suboptimal codes and lower the error floor.
sourcecoding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as...
详细信息
sourcecoding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv problem, can be controlled by the decoder. This control action is selected by the decoder based on the message encoded by the source node. Unlike conventional settings, the message can thus carry not only information about the source to be reproduced at the decoder, but also control information aimed at improving the quality of the side information. In this paper, the analysis of the tradeoffs between rate, distortion, and cost associated with the control actions is extended from the previously studied point-to-point setup to two basic multiterminal models. First, a distributed source coding model is studied, in which two encoders communicate over rate-limited links to a decoder, whose side information can be controlled. The control actions are selected by the decoder based on the messages encoded by both source nodes. For this setup, inner bounds are derived on the rate-distortion-cost region for both cases in which the side information is available causally and noncausally at the decoder. These bounds are shown to be tight under specific assumptions, including the scenario in which the sequence observed by one of the nodes is a function of the source observed by the other and the side information is available causally at the decoder. Then, a cascade scenario in which three nodes are connected in a cascade and the last node has controllable side information is also investigated. For this model, the rate-distortion-cost region is derived for general distortion requirements and under the assumption of causal availability of side information at the last node.
sourcecoding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence ca...
详细信息
ISBN:
(纸本)9781467325790
sourcecoding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information available at the decoder and the source sequence can be controlled by the decoder based on the message received from the encoder. In this paper, the characterization of the optimal rate-distortion performance as a function of the cost associated with the control actions is extended from the previously studied point-to-point set-up to two multiterminal models. First, a distributed source coding model is studied, in which two encoders communicate over rate-limited links to a decoder, whose side information can be controlled based on the control actions selected by one of the encoders. The rate-distortion-cost region is characterized under the assumption of lossless reconstruction of the source encoded by the node that does not control the side information. Then, a three-node cascade scenario is investigated, in which the last node has controllable side information. The rate-distortion-cost region is derived for general distortion requirements and under the assumption of "causal" availability of side information at the last node.
Channel state information (CSI) acquisition is essential for the base station (BS) to fully reap the beamforming gain in intelligent reflecting surface (IRS)-aided downlink communication systems. Recently, Wang et al....
详细信息
Channel state information (CSI) acquisition is essential for the base station (BS) to fully reap the beamforming gain in intelligent reflecting surface (IRS)-aided downlink communication systems. Recently, Wang et al. (2020) revealed a strong correlation in different users' cascaded channels stemming from their common BS-IRS channel component, and leveraged such a correlation to significantly reduce the pilot transmission overhead in IRS-aided uplink communication. In this paper, we aim to exploit the above channel property to reduce the overhead for both pilot and feedback transmission in IRS-aided downlink communication. Note that in the downlink, the distributed users merely receive the pilot signals containing their own CSI and cannot leverage the correlation in different users' channels, which is in sharp contrast to the uplink counterpart considered in Wang et al. (2020). To tackle this challenge, this paper proposes a novel "quantize-then-estimate" protocol in frequency division duplex (FDD) IRS-aided downlink communication. Specifically, the users quantize and feed back their received pilot signals, instead of the estimated channels, to the BS. After de-quantizing the pilot signals received by all the users, the BS estimates all the cascaded channels by leveraging their correlation, similar to the uplink scenario. Under this protocol, we manage to propose efficient user-side quantization and BS-side channel estimation methods. Moreover, we analytically quantify the pilot and feedback transmission overhead to reveal the significant performance gain of our proposed scheme over the conventional "estimate-then-quantize" scheme.
distributed source coding (DSC) is a new technology for source compression. In contrast with the traditional source compression methods, DSC achieves low-complexity encoding by transferring complex decorrelation proce...
详细信息
distributed source coding (DSC) is a new technology for source compression. In contrast with the traditional source compression methods, DSC achieves low-complexity encoding by transferring complex decorrelation process from the encoder to the decoder, so that it is suitable for friendly up-link serves of low-power devices such as mobile phones. This paper addresses the transmission of DSC bit stream and proposes two kinds of transmission systems, including distributed joint source-channel coding (DJSCC) and distributed separate source-channel coding (DSSCC). And LDPC (Low Density Parity Check) is used in these two systems for the simulation experiments which finally show that DJSCC outperforms DSSCC in practice.
暂无评论