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

Noisy channel coding via Privacy Amplification and Information Reconciliation

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第11期57卷 7377-7385页

作者： Renes, Joseph M. Renner, Renato ETH Inst Theoret Phys CH-8093 Zurich Switzerland

We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic protocols: privacy amplification and information reconciliation, also known as data compression with side information. We do this in the one-shot scenario of structureless resources, and formulate our results in terms of the smooth min- and max-entropy. In the context of classical information theory, this shows that essentially all two-terminal protocols can be reduced to these two primitives, which are in turn governed by the smooth min- and max-entropies, respectively. In the context of quantum information theory, the recently-established duality of these two protocols means essentially all two-terminal protocols can be constructed using just a single primitive. As an illustration, we show how optimal noisy channel coding protocols can be constructed solely from privacy amplification.

关键词： channel coding information reconciliation privacy amplification quantum information Slepian-Wolf coding smooth entropies

来源：评论

学校读者我要写书评

暂无评论

Exponential Golomb and Rice Error Correction Codes for Generalized Near-Capacity Joint Source and channel coding

引用

IEEE ACCESS 2016年 4卷 7154-7175页

作者： Brejza, Matthew F. Wang, Tao Zhang, Wenbo Al-Khalili, David Maunder, Robert G. Al-Hashimi, Bashir M. Hanzo, Lajos Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England

The recently proposed unary error correction (UEC) and Elias gamma error correction (EGEC) codes facilitate the near-capacity joint source and channel coding (JSCC) of symbol values selected from large alphabets at a low complexity. Despite their large alphabet, these codes were only designed for a limited range of symbol value probability distributions. In this paper, we generalize the family of UEC and EGEC codes to the class of rice and exponential Golomb error correction codes, which have a much wider applicability, including the symbols produced by the H.265 video codec, the letters of the English alphabet, and in fact any arbitrary monotonic unbounded source distributions. Furthermore, the practicality of the proposed codes is enhanced to allow a continuous stream of symbol values to be encoded and decoded using only fixed-length system components. We explore the parameter space to offer beneficial tradeoffs between error correction capability, decoding complexity, as well as transmission-energy, -duration, and -bandwidth over a wide range of operating conditions. In each case, we show that our codes offer significant performance improvements over the best of several state-of-the-art benchmarkers. In particular, our codes achieve the same error correction capability, as well as transmission energy, transmission duration, and transmission bandwidth as a variable length error-correction code benchmarker, while reducing the decoding complexity by an order of magnitude. In comparison with the best of the other JSCC and separate source and channel coding benchmarkers, our codes consistently offer E-b/N-0 gains of between 0.5 and 1.0 dB which only appear to be the modest, because the system operates close to capacity. These improvements are achieved for free, since they are not achieved at the cost of increasing transmission energy, transmission duration, transmission bandwidth, or decoding complexity.

关键词： Source coding channel coding error correction codes combined source-channel coding

来源：评论

学校读者我要写书评

暂无评论

Near-Capacity Joint Source and channel coding of Symbol Values from an Infinite Source Set Using Elias Gamma Error Correction Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第1期62卷 280-292页

作者： Wang, Tao Zhang, Wenbo Maunder, Robert G. Hanzo, Lajos Univ Southampton Southampton SO17 1BJ Hants England

In this paper we propose a novel low-complexity Joint Source and channel Code (JSCC), which we refer to as the Elias Gamma Error Correction (EGEC) code. Like the recently-proposed Unary Error Correction (UEC) code, this facilitates the practical near-capacity transmission of symbol values that are randomly selected from a set having an infinite cardinality, such as the set of all positive integers. However, in contrast to the UEC code, our EGEC code is a universal code, facilitating the transmission of symbol values that are randomly selected using any monotonic probability distribution. When the source symbols obey a particular zeta probability distribution, our EGEC scheme is shown to offer a 3.4 dB gain over a UEC benchmarker, when Quaternary Phase Shift Keying (QPSK) modulation is employed for transmission over an uncorrelated narrowband Rayleigh fading channel. In the case of another zeta probability distribution, our EGEC scheme offers a 1.9 dB gain over a Separate Source and channel coding (SSCC) benchmarker.

关键词： Source coding channel coding channel capacity iterative decoding

来源：评论

学校读者我要写书评

暂无评论

A unified design of channel coding for LTE uplink control information

引用

WIRELESS NETWORKS 2015年第5期21卷 1661-1667页

作者： Yang, Wei Zhang, Linyuan Yang, Zhenhua Xu, Changlong Kim, Young-Il Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Elect & Telecommun Res Inst Wireless Syst Res Grp Taejon 350350 South Korea

There are three kinds of channel coding schemes for uplink control information (UCI) with different sizes in long term evolution (LTE) system: the block codes with length of 20 and 30 bits as well as tail-biting convolutional code (TBCC) with rate of 1/3. To reduce complexity, a unified design of 1/5 TBCC using two-level puncture is proposed for all different sizes of UCI in this paper. Compared with LTE design, the proposed design is much simpler since there is only one channel encoding scheme in user equipment (UE) and only one decoding algorithm in base station. In addition, the first three generators of the proposed 1/5 TBCC are the same as that of the TBCC in LTE, thus the proposed design is backwards compatible with the original design in LTE. Simulation results show that the frame error rate performance of the proposed two-level punctured TBCC is close to or even better than that of the original block codes with lower decoding complexity.

关键词： Long term evolution (LTE) channel coding Block codes Tail-biting convolutional code

来源：评论

学校读者我要写书评

暂无评论

Joint source-channel coding using real BCH codes for robust image transmission

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2007年第6期16卷 1568-1583页

作者： Gabay, Abraham Avi Kieffer, Michel Duhamel, Pierre Univ Paris 06 Supelec CNRS Lab Signaux & Syst F-91121 Gif Sur Yvette France

In this paper, a new still image coding scheme is presented. In contrast with standard tandem coding schemes, where the redundancy is introduced after source coding, it is introduced before source coding using real BCH codes. A joint channel model is first presented. The model corresponds to a memoryless mixture of Gaussian and Bernoulli-Gaussian noise. It may represent the source coder, the channel coder, the physical channel, and their corresponding decoder. Decoding algorithms are derived from this channel model and compared to a state-of-art real BCH decoding scheme. A further comparison with two reference tandem coding schemes and the proposed joint coding scheme for the robust transmission of still images has been presented. When the tandem scheme is not accurately tuned, the joint coding scheme outperforms the tandem scheme in all situations. Compared to a tandem scheme well tuned for a given channel situation, the joint coding scheme shows an increased robustness as the channel conditions worsen. The soft performance degradation observed when the channel worsens gives an additional advantage to the joint source-channel coding scheme for fading channels, since a reconstruction with moderate quality may be still possible, even if the channel is in a deep fade.

关键词： channel coding Gaussian-Bernoulli-Gaussian (GBG) channel model impulse noise joint source-channel coding (JSCC) source coding

来源：评论

学校读者我要写书评

暂无评论

Toward a unified framework for modeling and analysis of diversity in joint source-channel coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第1期56卷 90-101页

作者： Kwasinski, Andres Liu, K. J. Ray Texas Instruments Inc Germantown MD USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

The study of Joint Source-channel coding (JSCC) systems faces one major challenge in obtaining an analytical expression for the function that links end-to-end distortion with channel signal-to-noise ratio, the D-SNR curve. In this paper, for certain multimedia systems using practical source and channel codes in a JSCC bit rate allocation design, the D-SNR curve is shown to be well approximated by a set of carefully selected points where the relative contribution of channel errors to end-to-end distortion is small. This approach has the potential advantage that it could be applied to represent performance of many practical systems using JSCC bit rate allocation for which it is shown that the D-SNR function is approximately linear in log-log scales. A unified framework for the modeling, analysis and performance measurement of these systems is proposed by considering a view of diversity more general than its usual interpretation. This view extends that of diversity to include redundant information so coding and diversity gain are still used to characterize performance. Furthermore, the proposed approach is applied to study issues arising from using practical source and channel codes, including the effects on performance of channel codes of different strength or source codes with different compression efficiency.

关键词： adaptive coding source coding channel coding

来源：评论

学校读者我要写书评

暂无评论

Required SNR improvement for downlink optical communication via channel coding and aperture diversity by utilising PPM

引用

IET COMMUNICATIONS 2018年第1期12卷 96-101页

作者： Sahin, Selami TUBITAK BILGEM Natl Res Inst Elect & Cryptol Koca Gebze Turkey

In this study, it is aimed to investigate the required signal-to-noise ratio (SNR) that provides a sufficient bit error rate (BER) according to the zenith angle between the ground station and satellite when pulse position modulation is utilised. Many parameters such as scintillation index, link distance, wavelength, Rytov variance, Fried's parameter, aperture diameter of the receiver and zenith angle have been considered to achieve realistic results. Due to the restrictions on the system, some parameters are specified as deterministic;the obtained results suggest that the required SNR value changes in a wide range from small to large values of the zenith angle to achieve sufficient BER. Therefore, either SNR adjustment as a function of the zenith angle is provided or the interval of the zenith angles to establish the link is determined previously in order to avoid the high link margin. It is shown that, instead of the second choice, aperture diversity is utilised at the receiver to establish communication even for large zenith angles with a reasonable value of the SNR. Besides aperture diversity, channel coding with error correction codes further improves the performance.

关键词： optical communication channel coding error statistics pulse position modulation error correction codes SNR downlink optical communication channel coding aperture diversity PPM signal-to-noise ratio bit error rate BER zenith angle ground station satellite pulse position modulation scintillation index link distance wavelength Rytov variance Fried's parameter receiver aperture diameter error correction codes

来源：评论

学校读者我要写书评

暂无评论

Improved many-to-one architecture based on discrete wavelet packet transform for industrial IoT applications using channel coding

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2021年第1期12卷 275-283页

作者： Saadaoui, Safa Khalil, Aamre Tabaa, Mohamed Chehaitly, Mouhamad Monteiro, Fabrice Dandache, Abbas EMSI Casablanca LPRI Lab Casablanca Morocco Lorraine Unvers LGIPM Lab Metz France

Nowadays, the Industrial Internet of Things (IIoT), plays an important role in transforming industrial environment by opening up a new area for economic growth and competitiveness in digital Industry 4.0. Using intelligent communication system based on IIoT, will help factories to obtain better profits in the industrial manufacturing markets. For this purpose, this article presents performances in terms of binary error rate of a wide-band IIoT multi-users (or sensors) system under an industrial medium. This medium is simulated as a fading channel including industrial noise, through which the robustness of our system will be studied and improved. This multi-users system is based on IDWPT and DWPT for many-to-one applications. To face the harshness of the industrial environment, an error-correcting code is added to the architecture to improve its robustness. Two error-correcting codes are used, convolutional coding and RS code for 8, 16 and 32 multi-sensors system. This will lead to a comparative analysis of the performance between this two coding techniques.

关键词： Industrial internet of things (IIoT) Industrial wireless sensor networks (IWSN) Impulse radio Discrete wavelet packet transform (DWPT) Wireless channel channel coding

来源：评论

学校读者我要写书评

暂无评论

Joint source-channel coding of the FS1016 coder LSF parameters: Application of the channel optimized trellis coded vector quantization

引用

ANNALS OF TELECOMMUNICATIONS 2007年第3-4期62卷 426-463页

作者： Bouzid, Merouane USTHB LCPTS Fac Elect & Informat Algiers 16111 Algeria

In this paper we present an optimized trellis coded vector quantization (TCVQ) coding system designed for the effective and robust coding of LSF spectral parameters at low bit rate. The aim of this system, called at the beginning << LSF-OTCVQ Encoder >>, is to achieve a low bit rate transparent quantization of LSF parameters of the US Federal Standard (FS1016) speech coder. Once the effectiveness of our LSF-OTCVQ encoders (with weighted distance) was proven in the case of ideal transmissions over noiseless channel, we were interested after in the improvement of their robustnesses for real transmissions over noisy channel. To implicitly protect the transmission indices of our LSF-OTCVQ coders incorporated in the FS1016, we used a joint source-channel coding carried out by the channel optimized vector quantization (CONQ) method. In the case of transmissions over noisy channel, we will show that our new encoding system, called "COVQ-LSF-OTCVQ Encoder", would be able to contribute significantly in the improvement of the FS1016 performances by ensuring a good coding robustness of its LSF spectral parameters.

关键词： signal theory block quantization treillis coding source coding channel coding background noise system robustness speech coding spectrum line coding circuit low rate digital transmission

来源：评论

学校读者我要写书评

暂无评论

Saddle Point in the Minimax Converse for channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第5期59卷 2576-2595页

作者： Polyanskiy, Yury MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA

A minimax metaconverse has recently been proposed as a simultaneous generalization of a number of classical results and a tool for the nonasymptotic analysis. In this paper, it is shown that the order of optimizing the input and output distributions can be interchanged without affecting the bound. In the course of the proof, a number of auxiliary results of separate interest are obtained. In particular, it is shown that the optimization problem is convex and can be solved in many cases by the symmetry considerations. As a consequence, it is demonstrated that in the latter cases, the (multiletter) input distribution in information-spectrum (Verdu-Han) converse bound can be taken to be a (memoryless) product of single-letter ones. A tight converse for the binary erasure channel is rederived by computing the optimal (nonproduct) output distribution. For discrete memoryless channels, a conjecture of Poor and Verdu regarding the tightness of the information spectrum bound on the error exponents is resolved in the negative. Concept of the channel symmetry group is established and relations with the definitions of symmetry by Gallager and Dobrushin are investigated.

关键词： Binary hypothesis testing channel coding channel symmetries converse theorem error exponents minimax Shannon theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：