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

joint source and channel coding using punctured ring convolutional coded CPM

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第5期56卷 712-723页

作者： Lin, Zihuai Aulin, Tor Chalmers Univ Technol Dept Comp Sci & Engn SE-41296 Gothenburg Sweden

In this paper, a novel trellis source encoding scheme based on punctured ring convolutional codes is presented. joint source and channel coding (JSCC) using trellis coded Continuous Phase Modulation (CPM) with punctured convolutional codes over rings is investigated. The channels considered are the Additive White Gaussian Noise (AWGN) channel and the Rayleigh fading channel. Optimal soft decoding for the proposed JSCC scheme is studied. The soft decoder is based on the A Posteriori Probability (APP) algorithm for trellis coded CPM with punctured ring convolutional codes. It is shown that these systems with soft decoding outperform the same systems with hard decoding especially when the systems operate at low to medium Signal-to-Noise Ratio (SNR). Furthermore adaptive JSCC approaches based on the proposed source coding scheme are investigated. Compared with JSCC schemes with fixed source coding rates, the proposed adaptive approaches can achieve much better performance in the high SNR region. The novelties of this work are the development of a trellis source encoding method based on punctured ring convolutional codes, the use of a soft decoder, the APP algorithm for the combined systems and the adaptive approaches to the JSCC problem.

关键词： joint source and channel coding punctured ring TCQ combined punctured ring TCQ/CPM punctured ring convolutional coded CPM soft decoding

来源：评论

学校读者我要写书评

暂无评论

joint source and channel coding for 3-D scene databases using vector quantization and embedded parity objects

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2007年第6期16卷 1675-1685页

作者： Tian, Dihong Li, Junlin AlRegib, Ghassan Cisco Syst Inc San Jose CA 95134 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

Three-dimensional graphic scenes contain various mesh objects in one geometric space where different objects have potentially unequal importance regarding display. This paper proposes an object-oriented system for efficiently coding and streaming 3-D scene databases in lossy and rate-constrained environments. Vector quantization (VQ) is exploited to code 3-D scene databases into multiresolution hierarchies. For the best distortion-rate performance, adaptive quantization precisions are allocated to different objects and different layers of each object based on a weighted distortion model. Upon transmission, scalably coded objects are delivered in respective packet sequences to preserve their manipulation independency. For packet loss resilience, a plurality of FEC codes are generated as "parity objects" parallel to graphic objects, which protect the graphic objects concurrently and also preferentially in regard to their unequal decoding importance. A rate-distortion optimization framework is then developed, which performs rate allocation between graphic objects and parity objects and generates the parity data properly. We show that, by treating graphic objects jointly and preferentially in source and channel coding while preserving their independencies in transport, the proposed system reduces the receiving distortion of the 3-D database significantly compared to conventional methods.

关键词： forward error protection joint source and channel coding multimedia multiresolution rate allocation vector quantization

来源：评论

学校读者我要写书评

暂无评论

joint source and channel coding Using Double Polar Codes

引用

IEEE COMMUNICATIONS LETTERS 2021年第9期25卷 2810-2814页

作者： Dong, Yanfei Niu, Kai Dai, Jincheng Wang, Sen Yuan, Yifei Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China

In this letter, a double polar code (D-Polar) for joint source and channel coding (JSCC) is proposed, in which the source compress is implemented by a polar code, the channel error correction is performed by a systematic polar code. Furthermore, a turbo-like belief propagation (TL-BP) decoder consisted of a channel BP decoder and a source BP decoder is proposed for joint source and channel decoding in the receiver. In this TL-BP decoder, the soft information is exchanged between the channel BP decoder and the source BP decoder so as to improve the efficiency of channel decoding in utilizing the source information residual in the compressed bits. Simulation results show that the performance of the proposed D-Polar JSCC scheme with TL-BP decoder is significantly improved compared with the existing source-channel joint polarization scheme.

关键词： Decoding Polar codes Systematics Iterative decoding channel coding source coding Simulation joint source and channel coding double polar codes turbo-like belief propagation decoder

来源：评论

学校读者我要写书评

暂无评论

joint source and channel coding for image transmission over time varying channels

Joint source and channel coding for image transmission over ...

引用

IEEE International Conference on Communications (ICC 2007)

作者： Cao, Lei Univ Mississippi Dept Elect Engn University MS 38677 USA

ISBN: (纸本)9781424403523

In this paper, the joint source and channel coding for progressive image transmission over channels with varying SNR is considered. Since the feedback of channel status information generally lags behind the channel variation and the optimization process often causes high computational complexity, it is appropriate to optimally allocate the given bandwidth between the source and channel codes based on the statistics of the channel rather than a specific SNR. In such case, the optimization objective function is no longer in a recursive format and the computational complexity with exhaustive search for the optimal allocation is prohibitive. In this paper, we present a simple yet very effective genetic algorithm (GA) based optimization method so that the near-optimal channel rate allocation can be obtained through crossover and mutation operations over a candidate pool. Simulation shows that this GA-based method always approaches to the optimal results or the brute force search for the considered scenario, but with much lower complexity.

关键词： progressive image transmission joint source and channel coding optimal rate-allocation GA-based optimization

来源：评论

学校读者我要写书评

暂无评论

On the performance and complexity of Irregular Variable Length Codes for near-capacity joint source and channel coding

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第4期7卷 1338-1347页

作者： Maunder, R. G. Wang, J. Ng, S. X. Yang, L. -L. Hanzo, L. Univ Southampton Sch Elect & Comp Sci Southampton SO9 5NH Hants England

In this paper we propose a novel Irregular Variable Length coding (IrVLC) scheme for near-capacity joint source and channel coding. We employ a number of component Variable Length coding (VLC) codebooks having different coding rates for encoding particular fractions of the input source symbol stream. These fractions may be chosen with the aid of EXtrinsic Information Transfer (EXIT) charts in order to shape the inverted EXIT curve of the IrVLC codec for ensuring that it does not cross the EXIT curve of a serially concatenated channel codec. In this way, an open EXIT chart tunnel may be created even at low E-b/N-0 values that are close to the capacity bound of the channel. We propose iteratively decoded serially concatenated IrVLC designs amalgamated with Trellis Coded Modulation (TCM). These schemes are shown to be capable of operating within 0.6 dB of the uncorrelated narrowband Rayleigh fading channel's capacity bound using an average interleaver length of 217,500 bits and an effective bandwidth efficiency of 1.56 bit/s/Hz, assuming ideal Nyquist filtering. By contrast, the equivalent-rate regular VLC-based bench-marker schemes were found to be capable of operating at a higher distance of 1.1 dB from the capacity bound, which is nearly twice that of the proposed IrVLC-TCM scheme. Additionally, an Irregular Convolutional coding (IrCC) based bench-marker was found to be capable of operating at 0.8 dB from the capacity bound, owing to its slightly eroded performance when operating with the considered interleaver length.

关键词： variable length codes joint source and channel coding trellis codes information rates

来源：评论

学校读者我要写书评

暂无评论

Bit allocation for joint source and channel coding of progressively compressed 3-D models

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2005年第2期15卷 256-268页

作者： Al-Regib, G Altunbasak, Y Mersereau, RM Georgia Inst Technol Ctr Signal & Image Proc Atlanta GA 30332 USA Georgia Inst Technol Savannah GA USA

This paper presents a joint source and channel coding method for transmission of progressively, compressed three-dimensional (3-D) models where the bit budget is allocated optimally. The proposed system uses the Compressed Progressive Mesh (CPM) algorithm to produce a hierarchical bitstream representing different levels of detail (LODs). In addition to optimizing the transmitted bitstream with respect to the channel characteristics, we also choose the optimum combination of quantization and tessellation to maximize the expected decoded,model quality. That is, given a 3-D mesh, a total bit budget (B) and a channel packet-loss rate (P-LR), we determine the optimum combination of: 1) the geometry coordinates quantizer step size (l-bit);2) the number of transmitted batches (L);3) the total number of channel coding bits (C);and 4) the distribution of these channel coding bits among the transmitted levels (C-L). Experimental results show that, with our unequal error-protection approach that uses the proposed bit-allocation algorithm, the decoded model quality degrades more gracefully (compared to either no error protection or equal error protection methods) as the packet-loss rate increases.

关键词： bit allocation joint source and channel coding packet-loss resilient transmission streaming three-dimensional (3-D) graphics 3-D graphics streaming 3-D mesh compression unequal error protection (UEP) virtual reality over IP networks

来源：评论

学校读者我要写书评

暂无评论

On joint source and channel coding using trellis coded CPM: Analytical bounds on the channel distortion

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第9期53卷 3081-3094页

作者： Lin, Zihuai Aulin, Tor Chalmers Univ Technol Dept Comp Sci & Engn SE-41296 Gothenburg Sweden

joint source and channel coding (JSCC) using trellis coded quantization (TCQ) in conjunction with trellis coded continuous phase modulation (CPM) is studied. The channel is assumed to be the additive white gaussian noise (AWGN) channel. Analytical bounds on the channel distortion for the investigated systems with maximum-likelihood sequence detection (MLSD) are developed. The bounds are based on the transfer function technique, which was modified and generalized to include continuous-amplitude discrete-time signals. For a memoryless;uniform source, the constructed bounds for the investigated systems are shown to be asymptotically tight for increasing channel signal-to-noise ratio (SNR) values. For a memoryless nonuniform source, the constructed bounds are not as tight as the one for the uniform source, however, it still can be used as an indication to how the system performs. It is concluded that the minimum Euclidean distance of the system alone is not enough to evaluate the performance of the considered systems. The number of error events having minimum Euclidean distance and the total distortion caused by those error events also affect the asymptotic performance. This work provides an analysis tool for the investigated systems. The analysis method is very general. It may be applied to any trellis based JSCC schemes. Index

关键词： channel distortion joint source and channel coding trellis coded continuous phase modulation (CPM) trellis coded quantization

来源：评论

学校读者我要写书评

暂无评论

Disentangled Information Bottleneck Guided Privacy-Protective joint source and channel coding for Image Transmission

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2024年第11期72卷 6992-7005页

作者： Sun, Lunan Yang, Yang Chen, Mingzhe Guo, Caili Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Key Lab Network Syst Architecture & Conver Beijing 100876 Peoples R China Univ Miami Dept Elect & Comp Engn Coral Gables FL 33146 USA Univ Miami Inst Data Sci & Comp Coral Gables FL 33146 USA Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Lab Adv Informat Networks Beijing 100876 Peoples R China

joint source and channel coding (JSCC) has attracted increasing attention in semantic communications. However, JSCC is vulnerable to privacy issues due to the high relevance between the source image and channel input. In this paper, we propose a disentangled information bottleneck guided privacy-protective JSCC (DPJSCC) for image transmission, which aims at protecting private information and achieving superior image transmission performance. In particular, we propose a disentangled information bottleneck objective to compress the private information in public subcodewords and improve the reconstruction quality simultaneously. To optimize JSCC neural networks using the proposed objective, we derive a differentiable estimation based on variational approximation and the density-ratio trick. Additionally, we design a password-based privacy-protective algorithm that encrypts the private subcodewords, achieving joint optimization with JSCC neural networks. The proposed algorithm involves an encryptor for encrypting private information and a decryptor for recovering it at the legitimate receiver. A loss function is derived based on the maximum entropy principle for jointly training the encryptor, decryptor, and JSCC decoder to maximize eavesdropping uncertainty and improve reconstruction quality. Experimental results show that DPJSCC reduces eavesdropping accuracy on private information by up to 18% and decreases inference time by 10%.

关键词： Image reconstruction Neural networks Image communication Encryption Distortion Protection Noise measurement joint source and channel coding information bottleneck semantic communication privacy protection

来源：评论

学校读者我要写书评

暂无评论

Adaptive Information Bottleneck Guided joint source and channel coding for Image Transmission

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2023年第8期41卷 2628-2644页

作者： Sun, Lunan Yang, Yang Chen, Mingzhe Guo, Caili Saad, Walid Poor, H. Vincent Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Key Lab Network Syst Architecture & Conver Beijing 100876 Peoples R China Univ Miami Dept Elect & Comp Engn Coral Gables FL 33146 USA Univ Miami Inst Data Sci & Comp Coral Gables FL 33146 USA Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Lab Adv Informat Net works Beijing 100876 Peoples R China Virginia Tech Bradley Dept Elect & Comp Engn Wireless VT Grp Arlington VA 24061 USA Princeton Univ Dept Elect & Comp Engn Princeton NJ 08544 USA

joint source and channel coding (JSCC) for image transmission has attracted increasing attention due to its robustness and high efficiency. However, the existing deep JSCC research mainly focuses on minimizing the distortion between the transmitted and received information under a fixed number of available channels. Therefore, the transmitted rate may be far more than its required minimum value. In this paper, an adaptive information bottleneck (IB) guided joint source and channel coding (AIB-JSCC) method is proposed for image transmission. The goal of AIB-JSCC is to reduce the transmission rate while improving the image reconstruction quality. In particular, a new IB objective for image transmission is proposed so as to minimize the distortion and the transmission rate. A mathematically tractable lower bound on the proposed objective is derived, and then, adopted as the loss function of AIB-JSCC. To trade off compression and reconstruction quality, an adaptive algorithm is proposed to adjust the hyperparameter of the proposed loss function dynamically according to the distortion during the training. Experimental results show that AIB-JSCC can significantly reduce the required amount of transmitted data and improve the reconstruction quality and downstream task accuracy.

关键词： & nbsp Information bottleneck joint source and channel coding image transmission

来源：评论

学校读者我要写书评

暂无评论

Price Based joint source and channel coding for Real Time Video Applications Over the Internet with Flow Rate Management

Price Based Joint Source and Channel Coding for Real Time Vi...

引用

5th IEEE Conference on Industrial Electronics and Applications

作者： Li, Z. G. Yao, W. Xie, S. L. Rahardja, S. Inst Infocomm Res Signal Proc Dept Singapore 138632 Singapore

ISBN: (纸本)9781424450466

In this paper, we first propose an adaptation scheme at each source for adjusting send rates and channel code ratios of all flows at each source by using a joint source and channel coding based approach. Sufficient conditions are derived for formulating such a challenging problem as a convex optimization problem. A simple algorithm is provided to solve this problem. We then design a simple scheduling algorithm for transmitting packets from all flows at each link by using a weighted round robin based method. The proposed adaptation scheme at each source and the scheduling algorithm at each link form a framework for real time video applications over the Internet. With the proposed framework, Internet service providers (ISPs) have incentive to increase their capacities so that the Internet is more friendly to high bandwidth consuming applications such as real time video applications over the Internet.

关键词： joint source and channel coding Weighted Round Robin Congestion Price End-to-End Loose Admission Control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：