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

Partially Block Markov Superposition Transmission of a Gaussian source With Nested Lattice Codes

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第12期64卷 5217-5226页

作者： Zhao, Shancheng Ma, Xiao Jinan Univ Coll Informat Sci & Technol Guangzhou 510632 Guangdong Peoples R China Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510275 Guangdong Peoples R China

This paper studies the transmission of Gaussian sources through additive white Gaussian noise channels in bandwidth expansion regime, i.e., the channel bandwidth is greater than the source bandwidth. To mitigate the error propagation phenomenon of conventional digital transmission schemes, we propose in this paper a new capacity-approaching joint source channel coding (JSCC) scheme based on partially block Markov superposition transmission (BMST) of nested lattice codes. In the proposed scheme, first, the Gaussian source sequence is discretized by a lattice-based quantizer, resulting in a sequence of lattice points. Second, these lattice points are encoded by a short systematic group code. Third, the coded sequence is partitioned into blocks of equal length and then transmitted in the BMST manner. The main characteristics of the proposed JSCC scheme include: 1) entropy coding is not used explicitly and 2) only parity-check sequence is superimposed, hence, termed partially BMST. This is different from the original BMST. To show the superior performance of the proposed scheme, we present extensive simulation results which show that the proposed scheme performs within 1 dB of the Shannon limits. Hence, the proposed scheme provides an attractive candidate for transmission of Gaussian sources.

关键词： Gaussian sources joint source channel coding nested lattice codes partially block Markov superposition transmission

来源：评论

学校读者我要写书评

暂无评论

DAC-Mobi: Data-Assisted Communications of Mobile Images with Cloud Computing Support

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2016年第5期18卷 893-904页

作者： Wu, Jun Wu, Jian Cui, Hao Luo, Chong Sun, Xiaoyan Wu, Feng Tongji Univ Coll Elect & Informat Engn Key Lab Minist Educ Embedded Syst & Serv Comp Shanghai 201804 Peoples R China Microsoft Res Asia Beijing 100080 Peoples R China Univ Sci & Technol China Sch Informat Sci & Technol Hefei 230027 Peoples R China

This research proposes a novel data assisted image transmission scheme, which utilizes a large amount of correlated images stored in the cloud to improve the spectrum efficiency and visual quality. First, a two-layer Coset coding is proposed for the DCT coefficients transmission. The most significant bits (MSB) of the coefficients are generated by the first layer Coset and together with a few low frequency coefficients are transmitted through the most reliable channel coding and digital modulation. The middle bits generated by the second layer Coset are discarded by the sender and the residual bits are transmitted through amplitude modulation. Based on the MSB and the residual bits, an approximation of the original image is reconstructed. With this approximation, a lot of correlated images can be retrieved from the cloud, which are used to recover the discarded middle bits. The two layer Coset coding can significantly decrease the data energy so as to improve the transmission power efficiency. Hence, the end to end distortion of amplitude modulation can be reduced. Second, the image quality can be further improved by joint internal and external denoising with the retrieved images. Simulations show that the proposed scheme outperforms conventional digital schemes about 4 dB in peak signal to noise power ratio (PSNR) and achieves 2 dB gain over the state-of-the-art uncoded transmission. At low signal to noise power ratio (SNR), an additional 2-3 dB gain is achieved. The visual quality comparison also validates the objective image assessment result.

关键词： Correlated image joint source channel coding pseudo-analog transmission

来源：评论

学校读者我要写书评

暂无评论

Multiple description wavelet-based image coding using correlating transforms

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2007年第6期61卷 411-417页

作者： Khelil, Khaled Bekka, Rais El Hadi Djebari, Ali Rouvaen, Jean M. Univ Djillali Liabes Sidi Bel Abbes Lab LTTNS Sidi Bel Abbes 22000 Algeria Univ Ferhat Abbes Dept Elect Setif 19000 Algeria Univ Valenciennes Mont Houy CNRS IEMN Dept OAEUMR 8520 F-59313 Valenciennes France

The objective of multiple description coding (MDC) is to represent a source into multiple descriptions such that various reconstruction qualities are obtained from different subsets of the descriptions. In this paper, we propose a simple scheme that combines the multiple descriptions transform coding (MDTC) method with the discrete wavelet transform (DWT). We compare the performance of the proposed scheme with a discrete cosine transform (DCT)-based scheme prevalent in other papers. Simulation results show that our proposed DWT technique outperforms both objectively and subjectively the method based on DCT in the case of packet loss. (C) 2006 Elsevier GmbH. All rights reserved.

关键词： joint source channel coding multiple description coding discrete wavelet transform (DWT) image coding

来源：评论

学校读者我要写书评

暂无评论

TRELLIS-CODED QUANTIZATION DESIGNED FOR NOISY channelS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1994年第6期40卷 1792-1802页

作者： WANG, M FISCHER, TR ROCKWELL INT CORP NEWPORT BEACH CA 92658 USA WASHINGTON STATE UNIV SCH ELECT ENGN & COMP SCI PULLMAN WA 99164 USA

Trellis-coded quantization (TCQ) of memoryless sources is developed for transmission over a binary symmetric channel. The optimized TCQ coder can achieve essentially the same performance as Ayanoglu and Gray's unconstrainted trellis coding optimized for the binary symmetric channel, but with a much lower implementation complexity for transmission rates above 1 b/sample. In most cases, the optimized TCQ coder also provides larger signal-to-noise ratio than Farvardin and Vaishampayan's channel-optimized vector quantization. Algorithms are developed for the joint design of trellis-coded quantization/modulation (TCQ/TCM). The jointly designed TCQ/TCM system outperforms the straightforward cascade of separately designed TCQ and TCM systems. The improvement is most significant at low channel signal-to-noise ratio. For a first-order Gauss-Markov source, the predictive TCQ/TCM performance can exceed that of optimum pulse amplitude modulation.

关键词： source coding TRELLIS CODES QUANTIZATION joint source channel coding

来源：评论

学校读者我要写书评

暂无评论

Shannon- Kotel' nikov Mappings for Analog Point-to-Point Communications

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第4期70卷 2491-2517页

作者： Floor, Pal Anders Ramstad, Tor A. Norwegian Univ Sci & Technol NTNU Dept Comp Sci Colourlab N-2815 Gjovik Norway Norwegian Univ Sci & Technol NTNU Dept Elect Syst N-7034 Trondheim Norway

In this paper an approach to joint source-channel coding (JSCC) named Shannon-Kotel'nikov (S-K) mappings is discussed. S-K mappings are continuous, or piecewise smooth direct source-to-channel mappings operating on amplitude-continuous and discrete-time signals, and they encompass several existing JSCC schemes as special cases. Many existing approaches to analog- or hybrid discrete-analog JSCC provide both excellent performance as well as robustness to variable noise level at both low and arbitrary complexity and delay. However, a general theory explaining their performance and behaviour, as well as guidelines on how to construct well-performing mappings, do not exist. Therefore, such mappings are often based on educated guesses inspired by configurations that are known in advance to produce good solutions through numerical optimization methods. The objective of this paper is to develop a theoretical framework for analysis of analog- or hybrid discrete-analog S-K mappings which enables calculation of distortion when applying them on point-to-point links, reveal more about their fundamental nature, and provide guidelines for their construction at low as well as arbitrary complexity and delay. Such guidelines will likely help constrain solutions to numerical approaches and help explain why deep learning approaches obtain the solutions they do. The overall task is difficult and we do not provide a complete framework at this stage: We focus on high SNR and memoryless sources with an arbitrary continuous unimodal density function and memoryless Gaussian channels. We also provide example mappings based on surfaces which are chosen, or constructed, based on the provided theory.

关键词： joint source channel coding analog mappings distortion analysis differential geometry OPTA

来源：评论

学校读者我要写书评

暂无评论

Index assignment-based channel coding

引用

IET COMMUNICATIONS 2012年第2期6卷 172-178页

作者： Oztoprak, H. Villette, S. Kondoz, A. Univ Surrey Ctr Vis Speech & Signal Proc Guildford GU2 7XH Surrey England

A scheme named index assignment-based channel coding (IACC) has been developed for resilience of speech/audio codecs against the bit errors commonly experienced in wireless channels. Although IACC is a type of joint source channel coding, it does not intervene with the source codec design. The proposed scheme takes into account source characteristics and adjusts the amount of coding according to the sensitivity of different values of the source parameters. It is shown that source characteristics play an important role in the performance of IACC. The performance of IACC has been evaluated by applying it to parameters generated by adaptive multi-rate wideband (AMR-WB+) audio codec. A method for perceptual training of IACC codes is also proposed. The results demonstrate that the performance of IACC and IACC concatenated with convolutional coding can be superior to that of conventional convolutional coding at high and moderate bit error rates, respectively.

关键词： combined source-channel coding convolutional codes error statistics source codec design wireless channels concatenated coding adaptive multirate wideband audio codec index assignment-based channel coding speech coding bit error rates Speech and audio coding audio coding adaptive codes concatenated codes speech codecs joint source channel coding Speech processing techniques BER Radio links and equipment convolutional coding Other topics in statistics

来源：评论

学校读者我要写书评

暂无评论

Predictive and Adaptive Deep coding for Wireless Image Transmission in Semantic Communication

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2023年第8期22卷 5486-5501页

作者： Zhang, Wenyu Zhang, Haijun Ma, Hui Shao, Hua Wang, Ning Leung, Victor C. M. Univ Sci & Technol Beijing Inst Artificial Intelligence Sch Intelligence Sci & Technol Beijing 100083 Peoples R China Univ Sci & Technol Beijing Beijing Adv Innovat Ctr Mat Genome Engn Beijing Peoples R China Univ Sci & Technol Beijing Beijing Engn & Technol Res Ctr Convergence Network Beijing Peoples R China Zhengzhou Univ Sch Informat Engn Henan Joint Int Res Lab Intelligent Networking & D Zhengzhou 450001 Henan Peoples R China Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada

Semantic communication is a newly emerged communication paradigm that exploits deep learning (DL) models to realize communication processes like source coding and channel coding. Recent advances have demonstrated that DL-based joint source-channel coding (DeepJSCC) can achieve exciting data compression and noise-resiliency performances for wireless image transmission tasks, especially in environments with low channel signal-to-noises (SNRs). However, existing DeepJSCC-based semantic communication frameworks still cannot achieve adaptive code rates for different channel SNRs and image contents, which reduces its flexibility and bandwidth efficiency. In this paper, we propose a predictive and adaptive deep coding (PADC) framework for realizing flexible code rate optimization with a given target transmission quality requirement. PADC is realized by a variable code length enabled DeepJSCC (DeepJSCC-V) model for realizing flexible code length adjustment, an Oracle Network (OraNet) model for predicting peak-signal-to-noise (PSNR) value for an image transmission task according to its contents, channel signal to noise ratio (SNR) and the compression ratio (CR) value, and a CR optimizer aims at finding the minimal data-level or instance-level CR with a PSNR quality constraint. By using the above three modules, PADC can transmit the image data with minimal CR, which greatly increases bandwidth efficiency. Simulation results demonstrate that the proposed DeepJSCC-V model can achieve similar PSNR performances compared with the state-of-the-art Attention-based DeepJSCC (ADJSCC) model, and the proposed OraNet model is able to predict high-quality PSNR values with an average error lower than 0.5dB. Results also demonstrate that the proposed PADC can use nearly minimal bandwidth consumption for wireless image transmission tasks with different channel SNR and image contents, at the same time guaranteeing the PSNR constraint for each image data.

关键词： Adaptive code length joint source channel coding quality prediction semantic communication wireless image transmission

来源：评论

学校读者我要写书评

暂无评论

A 2.63 Mbit/s VLSI Implementation of SISO Arithmetic Decoders for High Performance joint source channel Codes

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2013年第4期60卷 951-964页

作者： Zezza, Simone Nooshabadi, Saeid Masera, Guido Politecn Torino Dept Elect I-10129 Turin Italy Michigan Technol Univ Dept Elect & Comp Engn Houghton MI 49931 USA

This paper highlights the implementation challenges faced by the current high performing error resilient joint source channel coding (JSCC) techniques based on the concept of soft-input soft-output (SISO) decoding of arithmetic codes (AC). Further, it proposes several efficient algorithmic and a very large scale integration (VLSI) architectural techniques to improve the throughput performance of SISO for JSCC. The VLSI hardware implementation of the proposed algorithm, when implemented on a 90 nm standard cells technology running at 588 MHz, achieves a decoding throughput of up to 2.63 Mbits/s capable of decoding QCIF format for video conferencing.

关键词： Error resilience arithmetic codes iterative decoding joint source channel coding wireless multimedia

来源：评论

学校读者我要写书评

暂无评论

Bounds on the a priori index crossover probabilities for trellis-based channel codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第4期46卷 1276-1291页

作者： Belzer, B Washington State Univ Sch Elect Engn & Comp Sci Pullman WA 99164 USA

This paper derives truncated union bounds on the a priori index crossover probabilities p(j/i) that result when an n-bit data index i is convolutionally encoded, transmitted over a noisy channel, and decoded with the Viterbi algorithm, giving received index j, The bounds are derived with a modified transfer function technique, using n-stage state transition matrices with symbolic labels. The technique is easily automated with commercial symbolic algebra packages, Bounds are obtained for convolutional and trellis-coded modulation (TCM) codes, over binary-symmetric and additive white Gaussian noise (AWGN) channels. A joint source channel coding example demonstrates that the bounds on p(j/i) developed in this paper can give a 1-3-dB accuracy improvement in end-to-end signal-to-noise ratio (SNR) predictions, when compared to predictions based on bounds on the delivered bit error probability P-b.

关键词： couvolutional coding index crossover probabilities joint source channel coding trellis-coded modulation union bounds

来源：评论

学校读者我要写书评

暂无评论

Compression With Actions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第2期60卷 796-807页

作者： Zhao, Lei Chia, Yeow-Khiang Weissman, Tsachy Stanford Univ Stanford CA 94305 USA

We consider the setting where actions can be used to modify a state sequence before compression. The minimum rate needed to losslessly describe the optimal modified sequence is characterized when the state sequence is either noncausally or causally available at the action encoder. The achievability is closely related to the optimal channel coding strategy for channel with states. We also extend the analysis to the lossy case.

关键词： joint source channel coding channels with state source coding action dependent side information action dependent states compression with actions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：