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

World Congress on Software Engineering

作者： Wang, Jun Yang, Shu-Hui Beijing Informat Technol Univ Coll Photoelect Informat & Commun Engn Beijing Peoples R China

ISBN: (纸本)9780769535708

In this paper, we present a simplification of log-BP algorithm which is able to reduce iterative times of decoding algorithm and save the hardware resource of decoder for LDPC codes. This simplification designs an improved layered-iterative decoding method without reducing the decoding performance, of which speed the updating of check nodes and variable nodes. Simulation results show that the improved layered-iterative log-BP algorithm with six-time iteration exhibits similar decoding performance to the traditional log-BP algorithm with ten-time iteration. When the improved log-BP and traditional log-BP both are simulated in ten-time iteration, the SNR of improved layer-iterative method decreases about 0.25 dB than that of traditional log-BP in the BER of 1e-2.

关键词： LDPC Codes Belief Propagation decoding algorithm Layered-iterative decoding Performance

来源：评论

学校读者我要写书评

暂无评论

Wagner-Like decoding for Noncoherent PPM based Ultra-Low-Power Communications

Wagner-Like Decoding for Noncoherent PPM based Ultra-Low-Pow...

引用

IEEE 24th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Zhang, Peng Willems, Frans M. J. Huang, Li Eindhoven Univ Technol Dept Elect Engn POB 513 NL-5600 MB Eindhoven Netherlands Holst Ctr Imec Eindhoven Netherlands

ISBN: (纸本)9781467362337

Noncoherent pulse-position modulation (PPM) with simple channel codes has the potential to realize ultra-low power (ULP) wireless design. In this paper, we develop a Wagner-like decoding rule for single-parity-check and high-rate Reed-Solomon (RS) coded PPM schemes by simply 'flipping' the most unreliable received PPM symbol(s) to obtain a good balance between performance and coding complexity. The proposed algorithm can be considered as a list decoding algorithm that first generates a candidate codeword list based on the algebraic structure of the code before applying soft decisions to decode. This approach can result in more power-efficient realizations of the studied schemes. It is shown that our decoding approach can achieve near maximum likelihood decoding performance based on the trellis, while having a significantly lower decoding complexity. In addition, by exploiting the inherent advantage of PPM transmission, it is possible to reduce the candidate list to further simplify the decoding for RS-coded PPM without losing coding gain. This makes the proposed scheme more attractive for ULP communications.

关键词： decoding Pulse position modulation Channel coding noncoherent ULP candidate species Communication Research decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

decoding OF MATRIX-PRODUCT CODES

引用

JOURNAL OF ALGEBRA AND ITS APPLICATIONS 2013年第4期12卷 1250185-1250185页

作者： Hernando, Fernando Ruano, Diego Univ Jaume 1 Dept Math Castellon De La Plana 12071 Spain Aalborg Univ Dept Math Sci DK-9220 Aalborg Denmark

We propose a decoding algorithm for the (u vertical bar u + v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two diffe... 详细信息

关键词： Linear codes matrix-product codes decoding algorithm minimum distance

来源：评论

学校读者我要写书评

暂无评论

decoding Improvement for LT Codes

Decoding Improvement for LT Codes

引用

2013 International Conference on Mechatronics,Applied Mechanics and Energy Engineering(MAMEE 2013)

作者： Lina Wang Wei Tang Department of Communication Engineering School of Computer and Communication EngineeringUniversity of Science and Technology Beijing

In this paper the performance of LT codes is analyzed. And then, for the remaining part of information which can be decoded still exists when decoding failure, an improved message passing decoding algorithm which retains the original algorithm framework is proposed. The simulation results have shown that the improved message passing decoding algorithm improves the decoding rate and reduces decoding overhead on the premise of appropriately increasing decoding complexity.

关键词： LT codes Message passing decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

EXPECTED COMPLEXITY OF SPHERE decoding FOR SPARSE INTEGER LEAST-SQUARE PROBLEMS

EXPECTED COMPLEXITY OF SPHERE DECODING FOR SPARSE INTEGER LE...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Somsubhra Barik Haris Vikalo Department of Electrical and Computer Engineering University of Texas at Austin

ISBN: (纸本)9781479903573

Sparse integer least-squares problems come up in a wide range of applications including wireless communications and genomics. The sphere decoding algorithm can find near-optimal solution to these problems with reduced average complexity if the knowledge of sparsity of the unknown vector is used in decoding. In this paper, we formulate a sphere decoding approach that relies on the l_0-norm constraint on the unknown vector to solve sparse integer least-squares problems. The expected complexity of this algorithm is derived analytically for sparse alphabets associated with common applications such as sparse channel estimation and validated via simulations. The results indicate superior performance and speed compared to the classical sphere decoding algorithm.

关键词： decoding Spheres decoding algorithm channel estimation algorithms CARRIER SYSTEM Complexity Integer

来源：评论

学校读者我要写书评

暂无评论

New decoding algorithms for Matrix C in the 802.16e WiMAX Standard

New Decoding Algorithms for Matrix C in the 802.16e WiMAX St...

引用

IEEE Vehicular Technology Conference

作者： Young Gil Kim Norman C. Beaulieu Department of Electrical and Computer Engineering University of Seoul iCORE Wireless Communications Laboratory University of Alberta

ISBN: (纸本)9781467318808

We examine the decoding of Matrix C in the 802.16e WiMAX standard. An exhaustive search and zero-forcing (ES-ZF) decoder and an exhaustive search and nulling canceling (ES-NC) decoder are proposed for uncoded systems. The computational complexity of Matrix C decoding using the ES-ZF decoder is shown to be the same as the complexity of the ZF decoder for Matrix B decoding with twice the number of receive antennas times the complexity of the maximum likelihood (ML) decoder for Matrix B decoding with twice the number of receive antennas. Matrix C can be implemented in a 2×2 multiple-input multiple-output (MEMO) system using the ES-NC decoder with reduced complexity compared to ML decoding with no performance loss. For coded systems, double pruned trees using a zero-forcing (DPT-ZF) algorithm or nulling canceling (DPT-NC) algorithm are proposed. The DPT-NC decoder can be implemented in a 2×2 MIMO coded system with reduced complexity compared to the Max-Log decoding with no performance loss.

关键词： Matrix C Space-time codes WiMAX standard decoding decoders decoding algorithm exhaustive search Coding systems matrices WiMax Complexity

来源：评论

学校读者我要写书评

暂无评论

A multi-agent control framework for co-adaptation in brain-computer interfaces 13

A multi-agent control framework for co-adaptation in brain-c...

引用

Annual Conference on Neural Information Processing Systems

作者： Josh Merel Roy Fox Tony Jebara Liam Paninski Department of Neurobiology and Behavior Columbia University New York NY 10027 School of Computer Science and Engineering Hebrew University Jerusalem 91904 Israel Department of Computer Science Columbia University New York NY 10027 Department of Statistics Columbia University New York NY 10027

ISBN: (纸本)9781632660244

In a closed-loop brain-computer interface (BCI), adaptive decoders are used to learn parameters suited to decoding the user's neural response. Feedback to the user provides information which permits the neural tuning to also adapt. We present an approach to model this process of co-adaptation between the encoding model of the neural signal and the decoding algorithm as a multi-agent formulation of the linear quadratic Gaussian (LQG) control problem. In simulation we characterize how decoding performance improves as the neural encoding and adaptive decoder optimize, qualitatively resembling experimentally demonstrated closed-loop improvement. We then propose a novel, modified decoder update rule which is aware of the fact that the encoder is also changing and show it can improve simulated co-adaptation dynamics. Our modeling approach offers promise for gaining insights into co-adaptation as well as improving user learning of BCI control in practical settings.

关键词： Brain-Computer Interfaces decoders Computer interfaces decoding algorithm linear quadratic Gaussian control ENCODER model codes decoding simulating Awareness

来源：评论

学校读者我要写书评

暂无评论

A Signal Constellation for Pilotless Communications Over Wiener Phase Noise Channels

A Signal Constellation for Pilotless Communications Over Wie...

引用

IEEE Global Communications Conference

作者： Shachar Shayovitz Dan Raphaeli Dept. of EE-Systems Tel-Aviv University

ISBN: (纸本)9781479913510

In this contribution, we propose a signal constellation for the the phase noise channel which does not require pilots thus increasing the effective information rate in a communication system. This constellation does not present rotational symmetry thus enabling decoding algorithms such as SPA, to converge without the use of pilots. We will provide Bit Error Rate (BER) simulations which show the superiority of this constellation over standard MPSK with pilots. Moreover, we will provide a method to analyze any arbitrary signal constellation and provide a figure of merit for its performance when iterative decoding algorithms are used.

关键词： Phase noise Factor graph Tikhonov Phase slip Directional statistics Asymmetrical constellations Constellation diagram Phase noise Factor Graph Pilots CONSTELLATIONS decoding algorithm Information rates Rotational symmetry Communication Research

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF FINITE-ALPHABET ITERATIVE DECODERS UNDER PROCESSING ERRORS

ANALYSIS OF FINITE-ALPHABET ITERATIVE DECODERS UNDER PROCESS...

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Chu-Hsiang Huang Lara Dolecek EE Department University of California Los Angeles

ISBN: (纸本)9781479903573

It is widely recognized that emerging hardware technologies will be inherently unreliable. In this paper, we study the performance of finite-alphabet iterative decoders when implemented on noisy hardware built out of unreliable components. We derive a recursive expression for the error probability in terms of both the transmission noise and processing errors. We allow different components of the decoding algorithm associated with certain computational units (i.e., bit and check nodes of varying degrees in the underlying graph) to be implemented using a collection of processors with varying levels of processing error rates. Performance analysis and optimal resource allocation of a noisy Gallager E decoder is presented as an application example of our general derivation. Simulations demonstrate that the implementation of a noisy iterative decoder according to the proposed analysis-guided optimal resource allocation outperforms implementations based on uninformed resource allocation under the common resource budget.

关键词： Iterative decoders Inference on Graphs Noisy hardware Optimal resource assignment decoders Resource utilization Error probability management of resources Noise decoding algorithm drive noise PROCESSOR process error

来源：评论

学校读者我要写书评

暂无评论

An efficient joint channel estimation and decoding algorithm for turbo-coded space-time orthogonal frequency division multiplexing receivers

引用

IET COMMUNICATIONS 2008年第7期2卷 886-894页

作者： Dogan, H. Cirpan, H. A. Panayirci, E. Istanbul Univ Dept Elect & Elect Engn TR-34850 Istanbul Turkey Kadir Has Univ Dept Elect Engn TR-34230 Istanbul Turkey

The challenging problem in the design of digital receivers of today's and future high-speed, high data-rate wireless communication systems is to implement the optimal decoding and channel estimation processes jointly in a computationally feasible way. Without realising such a critical function perfectly at receiver, the whole system will not work properly within the desired performance limits. Unfortunately, direct implementation of such optimal algorithms is not possible mainly due to their mathematically intractable and computationally prohibitive nature. A novel algorithm that reaches the performance of the optimal maximum a posteriori (MAP) algorithm with a feasible computational complexity is proposed. The algorithm makes use of a powerful statistical signal processing tool called the expectation-maximisation (EM) technique. It iteratively executes the MAP joint channel estimation and decoding for space-time block-coded orthogonal frequency division multiplexing systems with turbo channel coding in the presence of unknown wireless dispersive channels. The main novelty of the work comes from the facts that the proposed algorithm estimates the channel in a non-data-aided fashion and therefore except a small number of pilot symbols required for initialisation, no training sequence is necessary. Also the approach employs a convenient representation of the discrete multipath fading channel based on the Karhunen-Loeve (KL) orthogonal expansion and finds MAP estimates of the uncorrelated KL series expansion coefficients. Based on such an expansion, no matrix inversion is required in the proposed MAP estimator. Moreover, optimal rank reduction is achieved by exploiting the optimal truncation property of the KL expansion resulting in a smaller computational load on the iterative estimation approach.

关键词： fading channels wireless dispersive channels joint channel estimation radio receivers turbo-codes expectation maximisation technique iterative estimation approach Karhunen'Loeve orthogonal expansion maximum-a posteriori algorithm optimal decoding channel estimation turbo codes space-time orthogonal frequency division multiplexing receivers MAP algorithm EM discrete multipath fading channel channel coding optimal algorithm turbo channel coding space-time codes OFDM modulation data-rate wireless communication systems KL decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：