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

RBF-based decision feedback aided turbo equalisation of convolutional and spacetime trellis-coded systems

ELECTRONICS LETTERS 2001年第21期37卷 1298-1299页

作者： Yee, MS Yeap, BL Hanzo, L Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England

A reduced-complexity Jacobian radial basis function aided turbo equalisation (TEQ) scheme is proposed, which was found to provide a bit error ratio performance similar to that of the conventional trellis-based TEQ benchmarker at a 14-fold reduced complexity for a serially concatenated systematic convolutional coded and systematic space-time trellis-coded arrangement.

关键词： Communication channel equalisation and identification turbo codes concatenated codes codes trellis codes decision feedback equalisers decision feedback turbo equalisation convolutional codes computational complexity serial concatenated code bit error ratio space-time trellis code convolutional code Jacobian radial basis function

来源：评论

学校读者我要写书评

暂无评论

Near-Maximum-Likelihood Decoding for convolutionally coded Physical-Layer Network Coding Over the Full-Duplex Two-Way Relay Channel

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第9期67卷 8944-8948页

作者： Wang, Xiaokang Qian, Bin Mow, Wai Ho Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China Shenzhen Univ Coll Informat Engn Shenzhen 518060 Peoples R China

The full duplex (FD) two-way relay channel (TWRC) has recently been shown to be a feasible way to improve the network throughput in practical communications. In this correspondence, we consider the convolutionally coded physical-layer network coding over the TWRC in which two sources work in the FD mode and there exists a direct link between them. Every source receives two packets, one packet from the other source and one network coded packet from the relay. A near-maximum-likelihood decoding algorithm for the sources is proposed. A salient feature of the proposed algorithm is that it exploits the code structure to mitigate the error propagation induced by the relay. Furthermore, we derive the near maximum-likelihood decoding bound on end-to-end BER for the system. Simulation results indicate that the performance of the proposed algorithm matches well the bound.

关键词： Two-way relay channel full duplex error propagation physical-layer network coding convolutional code

来源：评论

学校读者我要写书评

暂无评论

Medical image transmission over a GSM cellular system

引用

ELECTRONICS LETTERS 2000年第16期36卷 1367-1368页

作者： Perez-Sevilla, JJ McLernon, DC Univ Leeds Sch Elect & Elect Engn Inst Integrated Informat Syst Leeds LS2 9JT W Yorkshire England

This authors report on an investigation of possible source/channel coders for medical image transmission over a GSM cellular link. Two source coders (JPEG and EZW) and two channel coders (convolutional and turbo codes) are used. Analysis of the results indicates that EZW with convolutional coding gives the best performance, but some kind of automtic repeat on request (ARQ) is also needed.

关键词： turbo code source coder JPEG automatic repeat on request source coding medical image processing channel coding Biomedical communication medical image transmission Mobile radio systems turbo codes visual communication cellular radio GSM cellular system EZW channel coder image coding convolutional codes automatic repeat request Image and video coding biomedical communication convolutional code

来源：评论

学校读者我要写书评

暂无评论

On Cyclic codes of Composite Length and the Minimum Distance

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第9期64卷 6305-6314页

作者： Xiong, Maosheng Hong Kong Univ Sci & Technol Dept Math Clear Water Bay Hong Kong Peoples R China

In an interesting paper, Prof. C. Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper, we explain some of the numerical data by developing a general method on cyclic codes of composite length and on estimating the minimum distance. We also provide a general construction of cyclic codes of composite length which are related to Ding's constructions. Numerical data shows that it produces many best cyclic codes as well. Finally, we point out how these cyclic codes can be used to construct convolutional codes with large free distance.

关键词： Quadratic residue code cyclic code of composite length minimum distance convolutional code

来源：评论

学校读者我要写书评

暂无评论

A LINEAR ALGEBRA APPROACH TO MINIMAL convolutional ENcodeRS

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1993年第4期39卷 1219-1233页

作者： JOHANNESSON, R WAN, ZX CHINESE ACAD SCI INST SYST SCI BEIJING 100080 PEOPLES R CHINA

This semitutorial paper starts with a review of some of Forney's contributions on the algebraic structure of convolutional encoders on which some new results on minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a minimal number of memory elements neither in controller canonical form nor in observer canonical form. Thus, this encoding matrix is not minimal according to Forney's definition of a minimal encoder. To resolve this difficulty, the following three minimality criteria are introduced: minimal-basic encoding matrix (minimal overall constraint length over equivalent basic encoding matrices), minimal encoding matrix (minimal number of abstract states over equivalent encoding matrices), and minimal encoder (realization of a minimal encoding matrix with a minimal number of memory elements over all realizations). Among other results, it is shown that all minimal-basic encoding matrices are minimal, but that there exist (basic) minimal encoding matrices that are not minimal-basic! Several equivalent conditions are given for an encoding matrix to be minimal. It is also proven that the constraint lengths of two equivalent minimal-basic encoding matrices are equal one by one up to a rearrangement. All results are proven using only elementary linear algebra. Most important among the new results are a simple minimality test, the surprising fact that there exist basic encoding matrices that are minimal but not minimal-basic, the existence of basic encoding matrices that are nonminimal, and a recent result, due to Forney, that states exactly when a basic encoding matrix is minimal.

关键词： convolutional code BASIC ENCODING MATRIX MINIMAL-BASIC ENCODING MATRIX MINIMAL ENCODING MATRIX MINIMAL ENcodeR

来源：评论

学校读者我要写书评

暂无评论

Blind recovery of k/n rate convolutional encoders in a noisy environment

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2011年第1期2011卷 1-9页

作者： Marazin, Melanie Gautier, Roland Burel, Gilles Univ Europeenne Bretagne Rennes France Univ Brest CNRS UMR Lab STICC 3192 ISSTB F-29238 Brest 3 France

In order to enhance the reliability of digital transmissions, error correcting codes are used in every digital communication system. To meet the new constraints of data rate or reliability, new coding schemes are currently being developed. Therefore, digital communication systems are in perpetual evolution and it is becoming very difficult to remain compatible with all standards used. A cognitive radio system seems to provide an interesting solution to this problem: the conception of an intelligent receiver able to adapt itself to a specific transmission context. This article presents a new algorithm dedicated to the blind recognition of convolutional encoders in the general k/n rate case. After a brief recall of convolutional code and dual code properties, a new iterative method dedicated to the blind estimation of convolutional encoders in a noisy context is developed. Finally, case studies are presented to illustrate the performances of our blind identification method.

关键词： intelligent receiver cognitive radio blind identification convolutional code dual code

来源：评论

学校读者我要写书评

暂无评论

convolutional spectral shaping

引用

IEEE COMMUNICATIONS LETTERS 1999年第1期3卷 9-11页

作者： Kim, D Eyuboglu, MV Motorola Informat Syst Grp Mansfield MA 02048 USA

A new spectral shaping technique, convolutional spectral shaping (CSS), is introduced. In CSS, equivalence classes of possible sign bit sequences are represented by a coset of a convolutional code and a search through the trellis of the code is used to pick a sequence from the selected coset to approximate a target spectral shape for transmission. Simulation results are included to illustrate the performance of CSS, A version of CSS has recently been adopted by the International Telecommunication Union (ITU) in the pulse code modulation (PCM) modem standard V.90.

关键词： PCM modem V.90 convolutional code spectral shaping

来源：评论

学校读者我要写书评

暂无评论

Numerically Efficient Algorithm for Modified Trellis Approaches

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2010年第2期58卷 385-389页

作者： Moon, Hichan Yoon, Sungroh Samsung Elect Co Telecom R&D Ctr Suwon South Korea Korea Univ Sch Elect Engn Seoul South Korea

In this letter, a numerically efficient algorithm is presented to compute the performance upper bounds for terminated convolutional codes based on a modified trellis diagram. A weight enumerator of one variable is def... 详细信息

关键词： Upper bound convolutional code weight enumerator semiring

来源：评论

学校读者我要写书评

暂无评论

RANGE OF METRICS IN THE VITERBI ALGORITHM

引用

ANNALS OF TELECOMMUNICATIONS 1990年第7-8期45卷 377-383页

作者： TORTELIER, P DUPONTEIL, D net/pab/shm/smc Issy-les-Moulineaux

Les auteurs s’intéressent à l’évaluation de la dynamique des métriques de nœud dans l’algorithme de Viterbi. Ils démontrent, dans le cas d’une modulation mdp4, l’existence d’une dynamique maximale qui dépend du codeur considéré. Ce résultat est utile pour dimensionner un circuit vlsi mettant en œuvre cet algorithme de décodage. En effet, la complexité d’un tel circuit est fonction croissante du nombre de bits nécessaires pour représenter les métriques de nœud.

关键词： convolutional code Metrics Variability Viterbi decoding

来源：评论

学校读者我要写书评

暂无评论

The predictable degree property and minimality in multidimensional convolutional coding

引用

DISCRETE MATHEMATICS 2019年第3期342卷 784-792页

作者： Lomadze, Vakhtang I Javakhishvili State Univ Math Dept A Razmadze Math Inst Tbilisi Georgia

convolutional codes inherit from polynomials a natural structure of a filtered module, which is a fundamental structure and therefore should be taken into account. Pursuing this idea, we define higher-dimensional analogs of the predictable degree property, Forney's indices and overall constraint length;also, we address the important issue of minimality. (C) 2018 Elsevier B.V. All rights reserved.

关键词： convolutional code Filtered module PD property Proper representation Minimality Graded module

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：