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

Joint source and channel coding with systematic polar codes for wireless sensor communication in next generation networks

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2019年第12期10卷 4641-4649页

作者： Yaacoub, Charles Sarkis, Malak Holy Spirit Univ Kaslik USEK Fac Engn POB 446 Jounieh Lebanon

Polar codes have strongly entered into action within the standardization of the next generation 5G mobile communication systems, which are expected to be an enabling technology for the Internet of Things where networks with a large number of sensors have to handle massive connectivity demands. This paper proposes and investigates the use of systematic polar codes for joint source-channel coding of correlated sources in wireless sensor networks, thus allowing the compression of the volume of data to be transmitted over the network on one hand, and on the other hand, the protection of this data from channel impairments. Results show that systematic polar codes can achieve a distributed compression with rates close to theoretical limits, with better error rates obtained for larger blocks, and a better robustness against transmission errors obtained with stronger compression and shorter block lengths. Furthermore, while the system is able to overcome the effect of noise on parity information with adequate power management, noisy side information significantly degrades system performance with remarkable gaps towards the case of distributed compression with an ideal transmission channel.

关键词： channel coding Compression Distributed source coding Entropy Systematic polar codes Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Digitization and Variable channel coding for Enhancement of Compressed Digital Mobile Fronthaul in PAM-4 Optical Links

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2017年第21期35卷 4714-4720页

作者： Lu, Feng Xu, Mu Cheng, Lin Wang, Jing Shen, Shuyi Cho, Hyung Joon Chang, Gee-Kung Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA

The standardization and development of LTE-A and 5G introduced advanced wireless technologies including multiple-input multiple-output and carrier aggregation, which require multiple wireless carriers to be delivered to and from each remote radio head. The common public radio interface (CPRI) as the mainstream standard in mobile fronthaul (MFH) with on-off-keying-based optical links cannot fulfill the capacity and efficiency requirement. Instead, using compressed CPRI in a high-speed pulse-amplitude-modulation-4 (PAM-4) link is actively researched and demonstrated. In this paper, we propose and demonstrate adaptive digitization and channel coding based on these compression and capacity boosting technologies. Depending on the optical link condition, the digitization bits and channel coding rates can be adaptively and dynamically changed to achieve the lowest error vector magnitude (EVM) of wireless carriers. By separating digitization bits into high bits and low bits, the coding overhead can be different between groups, while still keeping the same bit rate per wireless carrier. Based on the existing digital MFH infrastructure, the proposed scheme can significantly improve the capacity and sensitivity in the PAM-4-based compressed digital MFH. Capacity gains from 30% to 68%, sensitivity improvement of 2-9 dB, and significant EVM improvements are demonstrated experimentally, comparing with other compressed CPRI MFH solutions.

关键词： channel coding compressed common public radio interface (CPRI) digital mobile fronthaul pulse-amplitude modulation-4 (PAM-4)

来源：评论

学校读者我要写书评

暂无评论

Error exponents for channel coding with application to signal constellation design

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2006年第8期24卷 1647-1661页

作者： Huang, Jianyi Meyn, Sean Medard, Muriel Marvell Technol Santa Clara CA 95054 USA Univ Illinois Urbana IL 61801 USA Dept Elect & Comp Engn Urbana IL 61801 USA Coordinated Sci Lab Urbana IL 61801 USA MIT Informat & Decis Syst Lab Cambridge MA 02138 USA

This paper concerns error exponents and the structure of input distributions maximizing the random coding exponent for a stochastic channel model. The following conclusions are obtained under general assumptions on the channel statistics. 1) The optimal distribution has a finite number of mass points, or in the case of a complex channel, the amplitude has finite support. 2) A new clash of algorithms is introduced based on the cutting-plane method to construct an optimal input distribution. The algorithm constructs a sequence of discrete distributions, along with upper and lower bounds on the random coding exponent at each iteration. 3) In some numerical example considered, the resulting code significantly outperforms traditional signal constellation schemes such as quadrature amplitude modulation and phase-shift keying for all rates below the capacity.

关键词： channel coding error exponents fading channels information theory

来源：评论

学校读者我要写书评

暂无评论

Finite-SNR analysis for partial relaying cooperation with channel coding and opportunistic relay selection

引用

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2017年第1期2017卷 1页

作者： Vu, Thang X. Duhamel, Pierre Chatzinotas, Symeon Ottersten, Bjorn Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SnT Luxembourg Luxembourg Univ Paris Sud 11 LSS French Natl Ctr Sci Res CNRS Cent Supelec Paris France

This work studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. To achieve high spectral efficiency, we assume that a single time slot is dedicated to relaying. Conventional network-coded-based cooperation (NCC) selects the best relay which uses network coding to serve the two sources simultaneously. The bit error rate (BER) performance of NCC with channel coding, however, is still unknown. In this paper, we firstly study the BER of NCC via a closed-form expression and analytically show that NCC only achieves diversity of order two regardless of the number of available relays and the channel code. Secondly, we propose a novel partial relaying-based cooperation (PARC) scheme to improve the system diversity in the finite signal-to-noise ratio (SNR) regime. In particular, closed-form expressions for the system BER and diversity order of PARC are derived as a function of the operating SNR value and the minimum distance of the channel code. We analytically show that the proposed PARC achieves full (instantaneous) diversity order in the finite SNR regime, given that an appropriate channel code is used. Finally, numerical results verify our analysis and demonstrate a large SNR gain of PARC over NCC in the SNR region of interest.

关键词： Cooperative diversity Relay selection Partial relaying channel coding

来源：评论

学校读者我要写书评

暂无评论

Abelian Group Codes for channel coding and Source coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第5期61卷 2399-2414页

作者： Sahebi, Aria Ghasemian Pradhan, S. Sandeep Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

In this paper, we study the asymptotic performance of Abelian group codes for the channel coding problem for arbitrary discrete (finite alphabet) memoryless channels as well as the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources. For the channel coding problem, we find the capacity characterized in a single-letter information-theoretic form. This simplifies to the symmetric capacity of the channel when the underlying group is a field. For the source coding problem, we derive the achievable rate-distortion function that is characterized in a single-letter information-theoretic form. When the underlying group is a field, it simplifies to the symmetric rate-distortion function. We give several illustrative examples. Due to the nonsymmetric nature of the sources and channels considered, our analysis uses a synergy of information-theoretic and group-theoretic tools.

关键词： Group codes group capacity source coding channel coding abelian groups

来源：评论

学校读者我要写书评

暂无评论

Third-Order Analysis of channel coding in the Small-to-Moderate Deviations Regime

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第9期70卷 6139-6170页

作者： Yavas, Recep Can Kostina, Victoria Effros, Michelle CALTECH Dept Elect Engn Pasadena CA 91125 USA CNRS CREATE Singapore 138602 Singapore

This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our expansions employs a new quantity here called the channel skewness, which affects the approximation accuracy more significantly as the error probability decreases. For the Gaussian channel, evaluating Shannon's 1959 random coding bound and Vazquez-Vilar's 2021 meta-converse bound in the central limit theorem (CLT) regime enables exact computation of the channel skewness. For discrete memoryless channels, this work generalizes Moulin's 2017 bounds on the asymptotic expansion of the maximum achievable message set size for nonsingular channels from the CLT regime to include the moderate deviations (MD) regime, thereby refining Altug and Wagner's 2014 MD result. For an example binary symmetric channel and most practically important (n,& varepsilon;) pairs, including n is an element of [100,500] and & varepsilon;is an element of [10(-10),10(-1)] , an approximation up to the channel skewness is the most accurate among several expansions in the literature. A derivation of the third-order term in the type-II error exponent of binary hypothesis testing in the MD regime is also included;the resulting third-order term is similar to the channel skewness.

关键词： Error probability channel coding Monte Carlo methods Encoding Accuracy Gaussian channels Testing Moderate deviations large deviations discrete memoryless channel Gaussian channel hypothesis testing dispersion skewness

来源：评论

学校读者我要写书评

暂无评论

Power optimised channel coding in wireless sensor networks using low-density parity-check codes

引用

IET COMMUNICATIONS 2007年第6期1卷 1256-1262页

作者： Kashani, Z. Hajjarian Shiva, M. Univ Tehran Ctr Excellence Appl Electromagnet Syst Sch Elect & Comp Engn Tehran 14399 Iran

Energy consumption of low-density parity-check (LDPC) codes in different implementations is evaluated. Decoder's complexity is reduced by finite precision representation of messages, that is, quantised LDPC decoder, and replacement of function blocks with look-up tables. It is shown that the decoder's energy consumption increases exponentially with the number of quantisation bits. For the sake of low-power consumption, 3-bit magnitude and 1-sign bit representation for messages are used in the decoder. It is concluded that high-rate Gallager codes are as energy efficient as the Reed-Solomon codes, which till now have been the first choice for wireless sensor networks (WSNs). Finally, it is shown that using LDPC codes in WSNs can be justified even more by applying the idea of trading the transmitter power with the decoder energy consumption. By exploiting the trade-off inherent in iterative decoding, the network lifetime is increased up to four times with the 3-6 regular LDPC code. Hence, it is inferred that the LDPC codes are more efficient than the block and the convolutional codes.

关键词： Reed-Solomon codes high-rate Gallager codes wireless sensor networks LDPC decoder complexity parity check codes decoder energy consumption iterative decoding computational complexity channel coding power optimised channel coding finite precision representation low-density parity-check codes

来源：评论

学校读者我要写书评

暂无评论

A NEW 8-14 channel coding FOR D-3 FORMAT VTR

引用

IEEE TRANSACTIONS ON BROADCASTING 1993年第2期39卷 265-272页

作者： UEHARA, T OBA, Y NHK Science and Technology Research Laboratories Tokyo Japan

A new 8-14 channel coding suitable for high density recording for digital VTRs has been developed. Using this coding, an 8-bit data word is transferred to a 14-bit code word on the condition that the distance between magnetic polarity transitions is 2 to 7 channel bits, and the maximumabsolute value of the DSV (Digital Sum Variation) is 7. The newly developed 8-14 channel coding has a minimum recorded wavelength 14% longer and a required bandwidth 12.5% narrower than those of S-NRZ and M2 codes. Moreover, as the 8-14 channel coding is a run-length limited block code, it has several merits including simplified recording and reproduction equalization, azimuth and overwrite recording, no error propagation to any other word and error detection. The signals encoded by this 8-14 channel coding together with S-NRZ and M2 from 64Mbit/sec M-sequence data were recorded and reproduced in combination with metal particle tape and a Sendust laminated sputtered type head under the conditions that the head-to-tape speed was 21.4m/s and track width of the recording/reproducing head was 20 mu m. The results showed that the reproduced signal SNR of the 8-14 channel coding was 2.8dB higher than those of S-NRZ and M2. As of now, the 8-14 channel coding has been adopted in D-3 format VTRs.

关键词： channel coding Video recording Magnetic heads Voltage Laboratories Digital magnetic recording Bandwidth Block codes Azimuth Signal detection

来源：评论

学校读者我要写书评

暂无评论

On the Linear Codebook-Level Duality Between Slepian-Wolf coding and channel coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第12期55卷 5575-5590页

作者： Chen, Jun He, Da-ke Jagmohan, Ashish Lastras-Montano, Luis A. Yang, En-hui McMaster Univ Dept Elect & Comp Engn Hamilton ON L8S 4K1 Canada IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

In this paper, it is shown that each Slepian-Wolf coding problem is related to a dual channel coding problem in the sense that the sphere packing exponents, random coding exponents, and correct decoding exponents in these two problems are mirror-symmetrical to each other. This mirror symmetry is interpreted as a manifestation of the linear codebook-level duality between Slepian-Wolf coding and channel coding. Furthermore, this duality, in conjunction with a systematic analysis of the expurgated exponents, reveals that nonlinear Slepian-Wolf codes can strictly outperform linear Slepian-Wolf codes in terms of rate-error tradeoff at high rates. The linear codebook-level duality is also established for general sources and channels.

关键词： channel coding duality error exponent linear code reliability function Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

channel coding Theorem for the Number of Guesses in Decoding

Channel Coding Theorem for the Number of Guesses in Decoding

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Yamamoto, Hirosuke Okudera, Keishi Univ Tokyo Sch Frontier Sci 5-1-5 Kashiwanoha Kashiwa Chiba 2778561 Japan Mitsui Life Insurance Co Ltd Financial Management Dept Chiyoda Ku Tokyo 1008123 Japan

ISBN: (纸本)9781457705953

Arikan and Merhav proved joint source-channel coding theorems for guessing decoders based on Gallager's method. But, in this paper, only channel coding is considered to derive a stronger channel coding theorem for constant composition universal codes based on the method of types. Furthermore, the coding theorem is applied to the wiretap channel coding problem.

关键词： channel coding Decoding Educational institutions Error probability Gallager method Joints TV combined source-channel coding constant composition universal codes decoding decoding joint source-channel coding theorems wiretap channel coding problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：