检索结果-内蒙古大学图书馆

Concatenated Spatially Coupled LDPC Codes With Sliding Window Decoding for joint source-channel coding

IEEE TRANSACTIONS ON COMMUNICATIONS 2022年第2期70卷 851-864页

作者： Golmohammadi, Ahmad Mitchell, David G. M. New Mexico State Univ Klipsch Sch Elect & Comp Engn Las Cruces NM 88003 USA Bose Corp Framingham MA 01701 USA

In this paper, a method for joint source-channel coding (JSCC) based on concatenated spatially coupled low-density parity-check (SC-LDPC) codes is investigated. A construction consisting of two SC-LDPC codes is proposed: one for source coding and the other for channel coding, with a joint belief propagation-based decoder. Also, a novel windowed decoding (WD) scheme is presented with significantly reduced latency and complexity requirements. The asymptotic behavior for various graph node degrees is analyzed using a protograph-based Extrinsic Information Transfer (EXIT) chart analysis for both LDPC block codes with block decoding and for SC-LDPC codes with the WD scheme, showing robust performance for concatenated SC-LDPC codes. Simulation results show a notable performance improvement compared to existing state-of-the-art JSCC schemes based on LDPC codes with comparable latency and complexity constraints.

关键词： Codes Parity check codes Decoding source coding Convolutional codes Generators Sparse matrices Low-density parity-check (LDPC) codes spatially coupled codes joint source-channel coding window decoding

来源：评论

学校读者我要写书评

暂无评论

Distributed joint source-channel coding Using Unequal Error Protection LDPC Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第8期61卷 3472-3482页

作者： Shahid, Iqbal Yahampath, Pradeepa Univ Manitoba Dept Elect & Comp Engn Winnipeg MB R3T 2N2 Canada

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 joint source-channel coding LDPC codes unequal error protection belief-propagation EXIT-chart analysis

来源：评论

学校读者我要写书评

暂无评论

LDGM codes for channel coding and joint source-channel coding of correlated sources

引用

EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING 2005年第6期2005卷 942-953页

作者： Zhong, W Garcia-Frias, J Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA

We propose a coding scheme based on the use of systematic linear codes with low-density generator matrix (LDGM codes) for channel coding and joint source-channel coding of multiterminal correlated binary sources. In both cases, the structures of the LDGM encoder and decoder are shown, and a concatenated scheme aimed at reducing the error floor is proposed. Several decoding possibilities are investigated, compared, and evaluated. For different types of noisy channels and correlation models, the resulting performance is very close to the theoretical limits.

关键词： channel coding LDPC codes LDGM codes iterative decoding correlated sources joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

On the joint source-channel coding error exponent for discrete memoryless systems

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第4期52卷 1450-1468页

作者： Zhong, YF Alajaji, F Campbell, LL Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

We investigate the computation of Csiszar's bounds for the joint source-channel coding (JSCC) error exponent E-J of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily computed for arbitrary source-channel pairs via Arimoto's algorithm. When the channel's distribution satisfies a symmetry property, the bounds admit closed-form parametric expressions. We then use our results to provide a systematic comparison between the JSCC error exponent E-J and the tandem coding error exponent E-T, which applies if the source and channel are separately coded. It is shown that E-T <= E-J <= 2E(T). We establish conditions for which E-J > E-T and for which E-J = 2E(T). Numerical examples indicate that E-J is close to 2E(T) for many source-channel pairs. This gain translates into a power saving larger than 2 dB for a binary source transmitted over additive white Gaussian noise (AWGN) channels and Rayleigh-fading channels with finite output quantization. Finally, we study the computation of the lossy JSCC error exponent under the Hamming distortion measure.

关键词： discrete memoryless sources and channels error exponent Fenchel's duality Hamming distortion measure joint source-channel coding random-coding exponent reliability function sphere-packing exponent symmetric channels tandem source and channel coding

来源：评论

学校读者我要写书评

暂无评论

Multiple Description Analog joint source-channel coding to Exploit the Diversity in Parallel channels

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第11期60卷 5880-5892页

作者： Erdozain, Aitor Crespo, Pedro M. Beferull-Lozano, Baltasar Univ Navarra CEIT San Sebastian 20018 Spain Univ Valencia Inst Robot Tecnol Informac & Comunicac Valencia 46980 Spain Univ Navarra Tecnun San Sebastian 20018 Spain

The complexity and delay introduced by efficient digital coding strategies may be a barrier in some real-time communications. In this sense, these last years, joint source-channel coding schemes based on analog mappings have gained prominence precisely for their simplicity and their implicit low delay. In this work, analog mappings originally designed for point-to-point communications are adapted to the case of parallel channels by following the multiple description strategy traditionally used in source coding. In principle, the coding scheme is designed to transmit over parallel AWGN on-off channels, which are characterized by the possibility of having failures. We also show that our scheme performs satisfactorily over slow Rayleigh fading parallel channels.

关键词： Analog mappings joint source-channel coding parallel channels

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Agile Image Transmission With Deep joint source-channel coding

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第12期20卷 8081-8095页

作者： Kurka, David Burth Gunduz, Deniz Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

We propose deep learning based communication methods for adaptive-bandwidth transmission of images over wireless channels. We consider the scenario in which images are transmitted progressively in layers over time or frequency, and such layers can be aggregated by receivers in order to increase the quality of their reconstructions. We investigate two scenarios, one in which the layers are sent sequentially, and incrementally contribute to the refinement of a reconstruction, and another in which the layers are independent and can be retrieved in any order. Those scenarios correspond to the well known problems of successive refinement and multiple descriptions, respectively, in the context of joint source-channel coding (JSCC). We propose DeepJSCC-l, an innovative solution that uses convolutional autoencoders, and present three architectures with different complexity trade-offs. To the best of our knowledge, this is the first practical multiple-description JSCC scheme developed and tested for practical information sources and channels. Numerical results show that DeepJSCC-l can learn to transmit the source progressively with negligible losses in the end-to-end performance compared with a single transmission. Moreover, DeepJSCC-l has comparable performance with state of the art digital progressive transmission schemes in the challenging low signal-to-noise ratio (SNR) and small bandwidth regimes, with the additional advantage of graceful degradation with channel SNR.

关键词： Image transmission joint source-channel coding multiple description coding successive refinement wireless communication

来源：评论

学校读者我要写书评

暂无评论

Communicating Correlated sources Over MAC and Interference channels II: joint source-channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第6期67卷 3847-3872页

作者： Padakandla, Arun Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

We present the second part of our work on communicating correlated sources over multiple access (MAC) and interference channels (IC). Specifically, we undertake a Shannon-theoretic study of the above scenarios and focus on characterizing sufficient conditions for lossless recoverability of the sources at the decoder(s). We enhance the fixed block-length (B-L) coding technique by incorporating the technique of inducing source correlation onto channel inputs, originally discovered by Cover, El Gamal and Salehi. In contrast to the first part, performance analysis of a joint source-channel decoder poses new challenges. We enhance the earlier developed suite of coding and analytical tools to overcome these challenges and derive (simplified) single-letter characterizations for a new set of sufficient conditions for both scenarios. For both the MAC and IC problems, the derived sufficient conditions are (i) subsumed in the current known tightest, and (ii) strictly weaker for identified examples. Lastly, we propose simple 'plug-in' approaches that can further weaken the derived sufficient conditions. Our findings enable us to subsume Dueck's findings (1981) and go even further for the example considered therein.

关键词： Encoding channel coding Integrated circuits Task analysis Correlation Interference channels Tools Shannon theory joint source-channel coding inner bound achievability sufficient conditions correlated sources constant composition codes

来源：评论

学校读者我要写书评

暂无评论

On Lossy joint source-channel coding in Energy Harvesting Communication Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2015年第11期63卷 4433-4447页

作者： Motlagh, Meysam Shahrbaf Khuzani, Masoud Badiei Mitran, Patrick Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA

We study the problem of lossy joint source-channel coding in a single-user energy harvesting communication system with causal energy arrivals and the energy storage unit may have leakage. In particular, we investigate the achievable distortion in the transmission of a single source via an energy harvesting transmitter over a point-to-point channel. We consider an adaptive joint source-channel coding system, where the length of channel codewords varies based on the available battery charge. We first establish a lower bound on the achievable distortion. Then, as necessary conditions for local optimality, we obtain two coupled equations that determine the mismatch ratio between channel symbols and source symbols as well as the transmission power, both as functions of the battery charge. As examples of continuous and discrete sources, we consider Gaussian and binary sources respectively. For the Gaussian case, we obtain a closed-form expression for the mismatch factor in terms of the LambertW function, and show that an increasing transmission power policy results in a decreasing mismatch factor policy and vice versa. Finally, we numerically compare the performance of the adaptive mismatch factor scheme to the case of a constant mismatch factor.

关键词： joint source-channel coding energy harvesting distortion resource allocation

来源：评论

学校读者我要写书评

暂无评论

A joint source-channel coding approach to digital image self-recovery

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2017年第7期11卷 1371-1378页

作者： Sarreshtedari, Saeed Abbasfar, Aliazam Akhaee, Mohammad Ali Univ Tehran Dept Elect & Comp Engn Coll Engn Tehran *** Iran

The aim of the digital image self-embedding methods is to restore the content of a tampered image as much as possible. In this article, a joint source-channel coding solution is presented to solve this problem, in which an image compression algorithm is applied to generate a representation of the original image. The preserved information of the original image is used to produce hash bits that help the receiver to find the tampered area. Having the location of tampering known, it can be modeled as an erasure channel. Therefore, a channel coding phase is added to protect the image representation. The limited watermarking bit-budget will be optimally dedicated to the source and channel code bits based on the results derived by solving a dynamic programming optimization problem. It is shown in the experimental results that including this optimization stage results in the superiority of the proposed scheme to the similar state-of-the-art methods who lack such optimization.

关键词： Image tampering protection Self-recovery joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Scalable joint source-channel coding for the Scalable Extension of H.264/AVC

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2008年第12期18卷 1657-1670页

作者： Stoufs, Maryse Munteanu, Adrian Cornelis, Jan Schelkens, Peter Vrije Univ Brussel Dept Elect & Informat ETRO B-1050 Brussels Belgium

This paper proposes a novel joint source-channel coding (JSCC) methodology which minimizes the end-to-end distortion for the transmission over packet loss channels of scalable video encoded using SVC, the scalable extension of H.264/AVC. The proposed JSCC approach performs channel protection using low-density parity-check codes and relies on Lagrangian-based optimization techniques to derive the appropriate protection levels for each layer produced by the scalable source codec. Our JSCC approach for SVC can support spatial, temporal and quality scalability and can provide an optimized channel protection in any scalable setting. Experiments show that our JSCC methodology yields competitive results against state-of-the-art Lagrangian-based JSCC algorithms. Compared to the state-of-the-art, our approach significantly reduces the number of computations needed to derive the rate-distortion hulls. Moreover, the proposed approach constructs convex rate-distortion hulls for each frame, irrespective of the target rate. This allows the pre-computation of the convex rate-distortion hulls for typical packet loss channels, such that the extraction of a near-optimal JSCC allocation can be achieved on-the-fly for any target rate or packet-loss rate. We conclude that the proposed JSCC methodology provides optimized resilience against transmission errors in scalable video streaming over variable-bandwidth error-prone channels.

关键词： Error resilience H.264/AVC joint source-channel coding scalable video coding unequal error protection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：