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

Energy-Distortion Tradeoffs in Gaussian joint source-channel coding Problems

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第5期58卷 3153-3168页

作者： Jain, Aman Guenduez, Deniz Kulkarni, Sanjeev R. Poor, H. Vincent Verdu, Sergio Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Ctr Tecnol Telecomunicac Catalunya E-08860 Barcelona Spain

The information-theoretic notion of energy efficiency is studied in the context of various joint source-channel coding problems. The minimum transmission energy E(D) required to communicate a source over a noisy channel so that it can be reconstructed within a target distortion D is analyzed. Unlike the traditional joint source-channel coding formalisms, no restrictions are imposed on the number of channel uses per source sample. For single-source memoryless point-to-point channels, E(D) is shown to be equal to the product of the minimum energy per bit E-bmin of the channel and the rate-distortion function R(D) of the source, regardless of whether channel output feedback is available at the transmitter. The primary focus is on Gaussian sources and channels affected by additive white Gaussian noise under quadratic distortion criteria, with or without perfect channel output feedback. In particular, for two correlated Gaussian sources communicated over a Gaussian multiple-access channel, inner and outer bounds on the energy-distortion region are obtained, which coincide in special cases. For symmetric channels, the difference between the upper and lower bounds on energy is shown to be at most a constant even when the lower bound goes to infinity as D -> 0. It is also shown that simple uncoded transmission schemes perform better than the separation-based schemes in many different regimes, both with and without feedback.

关键词： Energy efficiency feedback information theory joint source-channel coding multiple-access channel (MAC) separate source and channel coding uncoded transmission

来源：评论

学校读者我要写书评

暂无评论

Machine Learning in the Air

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2019年第10期37卷 2184-2199页

作者： Gunduz, Deniz de Kerret, Paul Sidiropoulos, Nicholas D. Gesbert, David Murthy, Chandra R. van der Schaar, Mihaela Imperial Coll London Dept Elect & Elect Engn Informat Proc & Commun Lab London SW7 2BT England EURECOM Commun Syst Dept F-501930690 Sophia Antipolis France Univ Virginia Dept Elect & Comp Engn Charlottesville VA 22904 USA Indian Inst Sci Dept Elect & Comp Engn Bengaluru 560012 India Univ Calif Los Angeles Dept Elect & Comp Engn Los Angeles CA 90095 USA

Thanks to the recent advances in processing speed, data acquisition and storage, machine learning (ML) is penetrating every facet of our lives, and transforming research in many areas in a fundamental manner. Wireless communications is another success story - ubiquitous in our lives, from handheld devices to wearables, smart homes, and automobiles. While recent years have seen a flurry of research activity in exploiting ML tools for various wireless communication problems, the impact of these techniques in practical communication systems and standards is yet to be seen. In this paper, we review some of the major promises and challenges of ML in wireless communication systems, focusing mainly on the physical layer. We present some of the most striking recent accomplishments that ML techniques have achieved with respect to classical approaches, and point to promising research directions where ML is likely to make the biggest impact in the near future. We also highlight the complementary problem of designing physical layer techniques to enable distributed ML at the wireless network edge, which further emphasizes the need to understand and connect ML with fundamental concepts in wireless communications.

关键词： Autoencoders channel coding channel estimation data-driven methods distributed learning distributed resource allocation deep learning federated edge learning joint source-channel coding machine learning stochastic approximation wireless communications

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Constructed joint Transmission-Recognition for Internet of Things

引用

IEEE ACCESS 2019年 7卷 76547-76561页

作者： Lee, Chia-Han Lin, Jia-Wei Chen, Po-Hao Chang, Yu-Chieh Natl Chiao Tung Univ Inst Commun Engn Hsinchu 30010 Taiwan

The widely deployed Internet-of-Things (IoT) devices provide intelligent services with its cognition capability. Since the IoT data are usually transmitted to the server for recognition (e.g., image classification) due to low computational capability and limited power supply, achieving recognition accuracy under limited bandwidth and noisy channel of wireless networks is a crucial but challenging task. In this paper, we propose a deep learning-constructed joint transmission-recognition scheme for the IoT devices to effectively transmit data wirelessly to the server for recognition, jointly considering transmission bandwidth, transmission reliability, complexity, and recognition accuracy. Compared with other schemes that may be deployed on the IoT devices, i.e., a scheme based on JPEG compression and two compressed sensing-based schemes, the proposed deep neural network-based scheme has much higher recognition accuracy under various transmission scenarios at all signal-to-noise ratios (SNRs). In particular, the proposed scheme maintains good performance at the very low SNR. Moreover, the complexity of the proposed scheme is low, making it suitable for IoT applications. Finally, a transfer learning-based training method is proposed to effectively mitigate the computing burden and reduce the overhead of online training.

关键词： Internet of things (IoT) recognition transmission joint source-channel coding deep learning deep neural networks transfer learning JPEG compressed sensing

来源：评论

学校读者我要写书评

暂无评论

MULTIPLE DESCRIPTION ANALOG joint source-channel coding FOR PARALLEL channelS WITH SIDE INFORMATION

MULTIPLE DESCRIPTION ANALOG JOINT SOURCE-CHANNEL CODING FOR ...

引用

20th European Signal Processing Conference (EUSIPCO)

作者： Alustiza, Iker Erdozain, Aitor Crespo, Pedro Beferull-Lozano, Baltasar Un Navarra Tecnun Manuel de Lardizabal 15 San Sebastian 20018 Spain Univ Valencia Paterna Inst Robot Tecnol Informac & Commun Valencia 46980 Spain

ISBN: (纸本)9781467310680

With the purpose of reducing the coding complexity and delay of the separation-based schemes, an analog joint source-channel coding scheme is proposed for transmissions through parallel AWGN channels with side information at the receiver. This scheme divides the bidimensional source space into a set of hexagons and transmits the relative position of the source vectors inside the corresponding hexagon by using two complimentary analog mappings. The results are satisfactory, specially taking into consideration the low complexity and delay of the proposed scheme.

关键词： joint source-channel coding analog mappings side information multiple description coding

来源：评论

学校读者我要写书评

暂无评论

Tracking Unstable Autoregressive sources Over Discrete Memoryless channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第12期65卷 8140-8163页

作者： Timo, Roy Vellami, Badri N. Grant, Alex Nguyen, Khoa D. Ericsson Res S-16440 Stockholm Sweden CEAS Elect Engn & Comp Syst Cincinnati OH 45221 USA Myriota Adelaide SA 5000 Australia Univ South Australia Sch Informat Technol & Math Sci Adelaide SA 5095 Australia

We consider the problem of tracking, in realtime, an unstable autoregressive (AR) source over a discrete memory-less channel (DMC). We present computable achievable bounds on the optimal tracking error for general DMCs, and we particularize these bounds to the binary erasure, packet erasure, and binary symmetric channels. The achievable bounds in this paper are proved using a partially separate source quantization and channel coding architecture. We do not use complete or strict separation in usual Shannon sense: 1) the quantiser's resolution is optimized against the error-correction capabilities of the channel code and the channel code is optimized against an AR Hamming distortion function matched to the source (a weighted Hamming distortion function that provides unequal error protection to different parts of the AR source). The achievability results for general DMCs are proved by combining the AR Hamming distortion function with new realtime (streaming) versions of the random coding union and dependence testing bounds. When applied to erasure channels, these general bounds combine with simple converses to demonstrate that the channel's cutoff rate plays an important role in realtime tracking.

关键词： joint source-channel coding sequential error-control coding auto-regressive (AR) sources error exponents

来源：评论

学校读者我要写书评

暂无评论

channel IMPULSIVE NOISE MITIGATION FOR LINEAR VIDEO coding SCHEMES 44

CHANNEL IMPULSIVE NOISE MITIGATION FOR LINEAR VIDEO CODING S...

引用

44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Zheng, S. Cagnazzo, M. Kieffer, M. Univ Paris Saclay Telecom ParisTech LTCI F-75013 Paris France Univ Paris Saclay Univ Paris Sud Cent Supelec L2SCNRS 3 Rue Joliot Curie F-91192 Gif Sur Yvette France

ISBN: (纸本)9781479981311

This paper considers the problem of impulse noise mitigation for videos encoded using a SoftCast-based Linear Video coding (LVC) scheme and transmitted using an OFDM scheme over a wideband channel prone to impulse noise. In the time domain, the impulse noise is modeled as realizations of iid Bernoulli-Gaussian variables. A Fast Bayesian Matching Pursuit algorithm is employed for impulse noise mitigation. This approach requires the provisioning of some OFDM subchannels to estimate the impulse noise locations and amplitudes. Provisioned subchannels cannot be used to transmit data and lead to a decrease of the nominal decoded video quality at receivers in absence of impulse noise. Using a phenomenological model (PM) of the residual noise variance after impulse correction, an algorithm is proposed to evaluate the optimal number of subchannels to provision for impulse noise mitigation. Simulation results show that the PM can accurately predict the number of subchannels to provision and that impulse noise mitigation can significantly improve the decoded video quality compared to a situation where all subchannels are used for data transmission.

关键词： Video transmission SoftCast OFDM Impulse noise mitigation joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Maximum a Posteriori Decoding of Arithmetic Codes in joint source-channel coding

Maximum a Posteriori Decoding of Arithmetic Codes in Joint S...

引用

7th International joint Conference on e-Business and Telecommunications (ICETE)

作者： Spiteri, Trevor Buttigieg, Victor Univ Malta Msida 2080 Msd Malta

ISBN: (纸本)9783642252051

Arithmetic codes are being increasingly used in the entropy coding stage in many multimedia transmission applications. Combining channel coding with arithmetic coding can give implementation and performance advantages compared to separate source and channel coding. In this work, novel improvements are introduced into a technique by Grangetto et al. that uses maximum a posteriori (MAP) estimation for decoding joint source-channel coding using arithmetic codes. The arithmetic decoder is modified for quicker symbol decoding and error detection by the introduction of a look-ahead technique. and the calculation of the MAP metric is modified for faster error detection. These modifications also result in improved performance compared to the original scheme. Experimental results show an improvement of up to 0.4 dB when using soft-decision decoding and 0.6 dB when using hard-decision decoding.

关键词： Arithmetic coding joint source-channel coding Maximum a posteriori decoding

来源：评论

学校读者我要写书评

暂无评论

Lossy joint source-channel coding in the finite blocklength regime 2012

Lossy joint source-channel coding in the finite blocklength ...

引用

IEEE International Symposium on Information Theory

作者： Kostina, Victoria Verdu, Sergio Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781467325790

This paper shows new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the non-asymptotic regime. A joint source-channel code maps a block of k source symbols onto a length-n channel codeword, and the fidelity of reproduction at the receiver end is measured by the probability epsilon that the distortion exceeds a given threshold d. For memoryless sources and channels, it is demonstrated that the parameters of the best joint source-channel code must satisfy nC - kR(d) approximate to root nV + kV(d)Q(-1) (epsilon), where C and V are the channel capacity and dispersion, respectively;R(d) and V(d) are the source rate-distortion and rate-dispersion functions;and Q is the standard Gaussian complementary cdf.

关键词： Achievability converse finite blocklength regime joint source-channel coding lossy source coding memoryless sources rate-distortion theory Shannon theory

来源：评论

学校读者我要写书评

暂无评论

On Lossy Multi-Connectivity: Finite Blocklength Performance and Second-Order Asymptotics

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2019年第4期37卷 735-748页

作者： Zhou, Lin Wolf, Albrecht Motani, Mehul Natl Univ Singapore Dept Elect & Comp Engn Singapore 117583 Singapore Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Tech Univ Dresden Vodafone Chair Mobile Commun Syst D-01069 Dresden Germany

We consider the lossy transmission of a single source over parallel additive white Gaussian noise channels with independent quasi-static fading, which we term the lossy multi-connectivity problem. We assume that only the decoder has access to the channel state information. Motivated by ultra-reliable and low latency communication requirements, we are interested in the finite blocklength performance of the problem, i.e., the minimal excess-distortion probability of transmitting k source symbols over n channel uses. By generalizing non-asymptotic bounds by Kostina and Verdu for the lossy joint source-channel coding problem, we derive non-asymptotic achievability and converse bounds for the lossy multi-connectivity problem. Using these non-asymptotic bounds and under mild conditions on the fading distribution, we derive approximations for the finite blocklength performance in the spirit of second-order asymptotics for any discrete memoryless source under an arbitrary bounded distortion measure. Furthermore, in the achievability part, we analyze the performance of a universal coding scheme by modifying the universal joint source-channel coding scheme by Csiszar and using a generalized minimum distance decoder. Our results demonstrate that the asymptotic notions of outage probability and outage capacity are in fact reasonable criteria even in the finite blocklength regime. Finally, we illustrate our results via numerical examples.

关键词： Parallel channels dispersion 5G ultra-reliable and low latency communication finite blocklength analysis quasi-static fading joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Tradeoffs Between Weak-Noise Estimation Performance and Outage Exponents in Nonlinear Modulation

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2019年第8期65卷 5189-5196页

作者： Merhav, Neri Technion Andrew & Erna Viterbi Fac Elect Engn Haifa Israel

We focus on the problem of modulating a parameter onto a power-limited signal transmitted over a discrete-time Gaussian channel and estimating this parameter at the receiver. Considering the well-known threshold effect in the non-linear modulation systems, our approach is the following: instead of deriving upper and lower bounds on the total estimation error, which weighs both weak-noise errors and anomalous errors beyond the threshold, we separate the two kinds of errors. In particular, we derive upper and lower bounds on the best achievable tradeoff between the exponential decay rate of the weak-noise expected error cost and the exponential decay rate of the probability of the anomalous error event, also referred to as the outage event. This outage event is left to be defined as a part of the communication system design problem. Our achievability scheme, which is based on lattice codes, meets the lower bound at the high signal-to-noise limit and for a certain range of tradeoffs between the weak-noise error cost and the outage exponent.

关键词： Modulation parameter estimation joint source-channel coding Shannon-Kotel'nikov mappings lattice codes error exponents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：