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

14th International Symposium on Optical Memory

作者： Lee, JY Hong, YP Lee, JJ Dongguk Univ Dept Elect Engn Seoul 100715 South Korea

In this paper, we propose the M = 9 run-length-limited (d, k) = (1, 3) code for multilevel recording channels. The code rate is 5/3 (bits/symbol), and the code has a simple 3-state encoder and a sliding block decoder. During the decoding process, the maximum error propagation of input data is seven bits. The structures of the encoder and decoder of the proposed code are very simple, so it may be easily implemented for high-density multilevel recording systems.

关键词： run-length-limited code multilevel code optical recording channel state-splitting algorithm sliding block decoder

来源：评论

学校读者我要写书评

暂无评论

Set partitioning for multilevel codes on a Rayleigh-fading channel

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1998年第2期46卷 161-163页

作者： Gu, YM Lee, CW Seoul Natl Univ Sch Elect Engn Commun Syst Lab Seoul South Korea

On a Rayleigh-fading channel, multilevel codes achieve larger Hamming distances than single-level codes at comparable decoder complexity and bandwidth efficiency by employing a multistage decoder, Typically, multilevel codes are designed using Ungerboeck's set partitioning, This results in a large path multiplicity that degrades the code performance significantly, In this letter, in order to overcome the performance degradation, we propose a set partitioning method that greatly reduces the path multiplicity.

关键词： multilevel code multistage decoder path multiplicity set partitioning,

来源：评论

学校读者我要写书评

暂无评论

Improved multistage decoding of multilevel codes for digital radio mondiale (DRM)

Improved multistage decoding of multilevel codes for digital...

引用

IEEE International Symposium on Consumer Electronics

作者： Fischer, V Kurpiers, A Kulla, F Tech Univ Darmstadt Inst Commun Technol Darmstadt Germany

ISBN: (纸本)0780385268

The new digital radio standard Digital Radio Mondiale (DRM) uses multilevel coding as channel coding. A very effective decoding algorithm is the iterative multistage decoder (MSD). In our paper we analyze different implementations of the MSD utilizing hard-decision with different metrics. The performance of these implementations is evaluated by computer simulations. Additionally, an MSD with soft-decision (Max-Log-MAP) is investigated and serves as a benchmark for the hard-decision algorithms.

关键词： Digital Radio Mondiale multilevel code multistage decoding

来源：评论

学校读者我要写书评

暂无评论

A new 9-level run-length-limited (1,3) code for multilevel optical recording channels

引用

JAPANESE JOURNAL OF APPLIED PHYSICS PART 1-REGULAR PAPERS BRIEF COMMUNICATIONS & REVIEW PAPERS 2005年第5B期44卷 3457-3461页

作者： Lee, JY Hong, YP Lee, JJ Dongguk Univ Dept Elect Engn Seoul 100715 South Korea

关键词： run-length-limited code multilevel code optical recording channel state-splitting algorithm sliding block decoder

来源：评论

学校读者我要写书评

暂无评论

multilevel turbo coding with short interleavers

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1998年第2期16卷 303-309页

作者： Herzberg, H Globespan Technol Inc Red Bank NJ 07701 USA

In this paper, the impact of the interleaver, embedded in the encoder for a parallel concatenated code, called the turbo code, is studied. The known turbo codes consist of long random interleavers, whose purpose is to reduce the value of the error coefficients, It is shown here that an increased minimum Hamming distance can be obtained by using a structured interleaver, For low bit-error rates (BER's), we show that the performance of turbo codes with a structured interleaver is better than that obtained with a random interleaver, Another important advantage of the structured interleaver is the short length required, which yields a short decoding delay and reduced decoding complexity (in terms of memory), We also consider the use of turbo codes as component codes in multilevel codes, Powerful coding structures that consist of two component codes are suggested, Computer simulations are performed in order to evaluate the reduction in coding gain due to suboptimal iterative decoding, From the results of these simulations we deduce that the degradation in the performance (due to suboptimal decoding) is very small.

关键词： interleaver iterative decoder multilevel code multistage decoder turbo code

来源：评论

学校读者我要写书评

暂无评论

Coding for a channel with quantization in the presence of an estimable interference

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1997年第1期45卷 45-51页

作者： Herzberg, H Saltzberg, BR Lucent Technologies Bell Laboratories Middletown NJ USA

Encoding and decoding schemes presented in this paper are aimed at enabling transfer of data through a channel in which two types of interference are added to the transmitted signal and the sum is quantized. One of these interferences is known (or can be estimated), whereas the second is an additive white Gaussian noise (AWGN). Since the input of the quantizer is not accessible, the known interference can not be removed from the received signal, We will. show that the error rate for an uncoded transmission through this channel is unacceptably large, even for low noise levels and linear quantization. It will be shown that the problem becomes even more severe when a nonlinear quantization is present. Therefore, coding is essential and huge coding gain is achievable in this application, An upper-bound on the error rate, contributed by the component codes of a multilevel code, has been developed for multistage decoding, Results of computer simulations of a practical case with optimal and suboptimal decoding algorithms, both developed in this paper, are presented here.

关键词： bit-error rate multilevel code multistage decoder quantization

来源：评论

学校读者我要写书评

暂无评论

Grouped multilevel Space-Time Trellis codes

引用

IEEE COMMUNICATIONS LETTERS 2010年第3期14卷 232-234页

作者： Baghaie A, Marjan Martin, Philippa A. Taylor, Desmond P. Univ Canterbury Dept Elect & Comp Engn Christchurch 1 New Zealand

Space-time trellis codes (STTCs) generally provide coding and diversity gains, but only transmit one data symbol per time slot. Using higher order modulations incurs high decoding complexity and lengthy code searches. Multi-layer schemes using multiple STTCs over subgroups of antennas provide higher throughput, but require as many receive as transmit antennas and have reduced diversity gains. Here, we develop grouped multilevel STTCs that can provide the high throughput of multi-layered schemes while realizing larger diversity gains. Any number of receive antennas can be used. An example is shown that achieves 6 bits/sec/Hz using 16-QAM and 4 transmit antennas.

关键词： multilevel code space time trellis code Rayleigh fading channel MIMO

来源：评论

学校读者我要写书评

暂无评论

Binary component codes construction of multilevel block modulation codes with a large minimum Euclidean distance

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1998年第7期E81A卷 1521-1528页

作者： Tanabe, H Salam, MA Mitamura, M Umeda, H Fukui Univ Fac Engn Fukui 9100017 Japan

In multilevel block modulation codes for QPSK and 8-PSK modulation, a construction of binary component codes is given. These codes have a good minimum Euclidean distance by using different forms of the dependency properties of the binary component codes. Interdependency among component codes is formed by using the binary component subcodes which are derived by the coset decomposition of the binary component codes. The algebraic structures of the codes are investigated to find out how interdependency among component codes gives a good minimum Euclidean distance. First, it is shown that cyclic codes over Z(M) For M-PSK (M = 4, 8), where the coding scheme is given by Piret, can be constructed by forming specific interdependency among binary component codes for proposed multilevel coding method. Furthermore, it is shown that better minimum Euclidean distance than above can be obtained by modifying the composition of interdependency among binary component codes. These proposed multilevel codes have algebraic structure of additive group and cyclic property over GF(M). Finally, error performances are compared with those of some code's reference modulation scheme for transmitting the same number of information bits.

关键词： multilevel code Euclidean distance coset decomposition cyclic code

来源：评论

学校读者我要写书评

暂无评论

A multilevel construction of permutation codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2001年第10期E84A卷 2518-2522页

作者： Wadayama, T Vinck, AJH Okayama Prefectural Univ Fac Comp Sci & Syst Engn Soja 7191197 Japan Univ Essen Gesamthsch Inst Expt Math Essen Germany

A novel multilevel construction for permutation codes is presented. A permutation code of length n is a subset of all the vectors obtained from coordinate permutations on the vector (0, 1,..., n - 1). We would like to construct a permutation code with cardinality as large as possible for a given code length n and a minimum distance. The proposed construction is available when n = 2(m) (m is a positive integer). We exploit m-constant weight binary codes as component codes and combine them in a multilevel way. Permutation codes with various parameters can be constructed by selecting appropriate combination of component codes. Furthermore, multi-stage decoding is available for decoding the permutation codes constructed by the proposed construction.

关键词： permutation code multilevel code multi-stage decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：