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

10th International Conference on Digital Information Management ICDIM

作者： Park, Cheol Young Laskey, Kathryn Backmond Costa, Paulo C. G. Matsumoto, Shou George Mason Univ Sensor Fus Lab MS 4B5 Fairfax VA 22030 USA George Mason Univ Ctr Excellence C4I Fairfax VA 22030 USA

ISBN: (纸本)9781467391528

Hybrid Bayesian Networks (HBNs), which contain both discrete and continuous variables, arise naturally in many application areas (e.g., artificial intelligence, data fusion, medical diagnosis, fraud detection, etc). This paper concerns inference in an important subclass of HBNs, the conditional Gaussian (CG) networks. Inference in CG networks can be NP-hard even for special-case structures, such as poly-trees, where inference in discrete Bayesian networks can be performed in polynomial time. This paper presents an extension to the Hybrid message passing inference algorithm for general CG networks (Le., networks with loops and many discrete parents). The extended algorithm uses Gaussian mixture reduction to prevent an exponential increase in the number of Gaussian mixture components. Experimental results compare performance of the new algorithm with existing algorithms.

关键词： Artificial Intelligence Bayesian Decision Theory Hybrid Bayesian Network message passing algorithm Gaussian Mixture Reduction

来源：评论

学校读者我要写书评

暂无评论

VLSI Implementation of a Rate Decoder for Structural LDPC Channel Codes

引用

Procedia Computer Science 2016年 79卷 765-771页

作者： Sandeep Kakde Atish Khobragade Department of Electronics Engineering Y C College of Engineering Nagpur 441 110 India Department of Electronics Engineering Rajiv Gandhi College of Engineering Nagpur441 110 India

This paper proposes a low complexity low-density parity check decoder (LDPC) design. The design mainly accomplishes a message passing algorithm and systolic high throughput architecture. The typical mathematical calculations are based on the observation that nodes with high log likelihood ratio provide almost same information in every iteration and can be considered as stationary, we propose an algorithm in which the parity check matrix H is updated to a reduced complexity form every time a stationary node is encountered which results in lesser number of numerical computations in subsequent iterations. In this paper, we contemplately focuses on computational complexity and the decoder design significantly benefits from the high throughput point of view and the various improvisations introduced at various levels of abstraction in the decoder design. Threshold Controlled Min Sum algorithm implements the LDPC decoder design for a code compliant with wired and wireless applications. A high performance LDPC decoder has been designed that achieves a throughput of 0.890 Gbps. The whole design of LDPC Decoder is designed, simulated and synthesized using Xilinx ISE 13.1 EDA Tool.

关键词： High Throughput LDPC Decoder message passing algorithm Low Complexity.

来源：评论

学校读者我要写书评

暂无评论

Joint sparse graph over GF(q) for code division multiple access systems

引用

IET COMMUNICATIONS 2015年第5期9卷 707-718页

作者： Wen, Lei Su, Man Univ Surrey Ctr Commun Syst Res Guildford GU2 7XH Surrey England Natl Univ Def Technol Coll Elect Sci & Engn Guangzhou 410073 Guangdong Peoples R China

Low-density signature code division multiple access (LDS-CDMA) and low-density parity-check (LDPC) code can both be represented by a single sparse graph. In this study, the authors propose a joint sparse graph (JSG) over GF(q) which combines LDS-CDMA and non-binary LDPC codes, namely JSG-CDMA. On the JSG, multiple accessing and channel coding are well-linked together, in addition, joint detection and decoding are performed by message passing algorithm. Two schedules for message updating on the JSG, that is, flooding and serial schedules, are, respectively, presented. To predict the convergence behaviour of the joint detection and decoding, they depict the iterative structure of the JSG-CDMA receiver and analyse its extrinsic information transfer chart. Key factors of JSG-CDMA include message passing schedule, maximum iteration number and Galois field order. Simulation results show that JSG-CDMA performs much better than conventional CDMA, in addition, compared with LDS-CDMA and turbo structured LDS-CDMA, at a bit error rate of 3 x 10(-4), JSG-CDMA brings about 1.9 and 1.1 dB gain, respectively.

关键词： code division multiple access parity check codes channel coding graph theory message passing radio receivers Galois fields turbo codes error statistics iterative decoding joint sparse graph low density signature code division multiple access low density parity check code nonbinary LDPC code channel coding message passing algorithm message updating iterative structure JSG-CDMA receiver turbo structured LDS-CDMA bit error rate GF decoding Galois field order

来源：评论

学校读者我要写书评

暂无评论

Simplified Trellis Min-Max Decoder Architecture for Nonbinary Low-Density Parity-Check Codes

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2015年第9期23卷 1783-1792页

作者： Lacruz, Jesus O. Garcia-Herrero, Francisco Declercq, David Valls, Javier Univ Los Andes Dept Elect Engn Merida 5101 Venezuela Univ Politecn Valencia Inst Telecomun & Aplicaciones Multimedia Gandia 46730 Spain Univ Cergy Pontoise ETIS Lab F-95000 Cergy Pontoise France

Nonbinary low-density parity-check (NB-LDPC) codes have become an efficient alternative to their binary counterparts in different scenarios, such as moderate codeword lengths, high-order modulations, and burst error correction. Unfortunately, the complexity of NB-LDPC decoders is still too high for practical applications, especially for the check node (CN) processing, which limits the maximum achievable throughput. Although a great effort has been made in the recent literature to overcome this disadvantage, the proposed decoders are still not ready for high-speed implementations for high-order fields. In this paper, a simplified trellis min-max algorithm is proposed, where the CN messages are computed in a parallel way using only the most reliable information. The proposed CN algorithm is implemented using a horizontal layered schedule. The overall decoder architecture has been implemented in a 90-nm CMOS process for a (N = 837 and K = 726) NB-LDPC code over GF(32), achieving a throughput of 660 Mb/s at nine iterations based on postlayout results. This decoder increases hardware efficiency compared with the existing recent solutions for the same code.

关键词： Layered decoder message passing algorithm nonbinary low-density parity-check (NB-LDPC) trellis min-max (TMM)

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Overloaded LDPC-Optimum Combinied System Over Rayleigh Fading Channel

引用

WIRELESS PERSONAL COMMUNICATIONS 2015年第2期83卷 1331-1339页

作者： Sharma, Surbhi Khanna, Rajesh Thapar Univ Dept Elect & Commun Engn Patiala 147004 Punjab India

In this paper a closed form expression for the bit error rate of LDPC-OC system in the presence of interferers is derived over an i.i.d Rayleigh fading channel using message passing algorithm. All interferers are assumed to have equal power. The analysis is done for the case when the number of interferes is more than the number of receive antenna elements. In this paper, analytical results showed that for a BER of 10(-2), the LDPC-OC system provides an additional gain of 6.3 dB over OC system alone. Both the systems provide identical diversity gain of 1.2 dB when the number of receive antennas are increased from 5 to 6.

关键词： Optimum combining Irregular low-density parity check codes message passing algorithm Gaussian approximation approach

来源：评论

学校读者我要写书评

暂无评论

A Low Complexity SCMA Decoder Based on List Sphere Decoding

A Low Complexity SCMA Decoder Based on List Sphere Decoding

引用

Global Communications Conference

作者： Fan Wei Wen Chen Department of Electronic Engineering Shanghai Jiao Tong University China

Non-orthogonal multiple access is one of the key techniques developed for the future 5G communication systems among which, the recent proposed sparse code multiple access (SCMA) has attracted a lots of researchers' interests. By exploring the shaping gain of the multi-dimensional complex codewords, SCMA is shown to have a better performance compared with some other non-orthogonal schemes such as low density signature (LDS). However, although the sparsity of the codewords makes the near optimal message passing algorithm (MPA) possible, the decoding complexity is still very high. In this paper, we propose a low complexity decoding algorithm based on list sphere decoding. Complexity analysis and simulation results show that the proposed algorithm can reduce the computational complexity substantially while achieve the near maximum likelihood (ML) performance.

关键词： 5G Non-orthogonal multiple access SCMA message passing algorithm list sphere decoder

来源：评论

学校读者我要写书评

暂无评论

Factor Graph Approach for Joint Passive Localization and Receiver Synchronization in Wireless Sensor Networks

Factor Graph Approach for Joint Passive Localization and Rec...

引用

IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications

作者： Weijie Yuan Nan Wu Hua Wang Jingming Kuang School of Information and Electronics Beijing Institute of Technology

ISBN: (纸本)9781509032556

Obtaining the location of a "passive" target in wireless sensor networks has attracted numerous interest in recent years. This paper considers the passive localization based on time-of-arrival measurements in an asynchronous sensor network where the receivers are with both clock skew and offset. Based on the factor graph model, the beliefs (approximated marginal) of target location and clock parameters can be obtained by executing iterative message passing algorithms. To reduce the huge complexity of particle based method, we propose two approximate approaches to determine parametric Gaussian message passing. Simulation results show that the proposed low complexity algorithm performs close to the particle-based method and attain the Cramer-Rao bound.

关键词： Passive localization Wireless sensor networks Clock skew and offset Factor graph message passing algorithm Cramer-Rao bound

来源：评论

学校读者我要写书评

暂无评论

Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding

引用

IEEE COMMUNICATIONS LETTERS 2015年第3期19卷 459-462页

作者： Lee, Sang Hyun Sohn, Illsoo Sejong Univ Dept Informat & Commun Engn Seoul 143747 South Korea Gachon Univ Dept Elect Engn Songnam 461701 South Korea

This letter develops a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios, where each node can delegate a fraction of its allocated resources to a neighboring node as an incentive for relaying. Determining the relay pairs that maximize the overall network utility yields a non-bipartite matching problem, which incurs a considerable computational load when implemented in a centralized way. To resolve this challenge, we use a message-passing framework to develop an efficient distributed solution. Simulation results verify that the proposed algorithm outperforms existing approaches.

关键词： Affinity propagation bandwidth exchange cooperative forwarding message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

message passing algorithms for MLS-3LIN Problem

引用

algorithmICA 2013年第4期66卷 848-868页

作者： Watanabe, Osamu Tokyo Inst Technol Dept Math & Comp Sci Meguro Ku Tokyo 1528552 Japan

MLS-3LIN problem is a problem of finding a most likely solution for a given system of perturbed 3LIN-equations under a certain planted solution model. This problem is essentially the same as MAX-3LIN problem. We consider simple and efficient message passing algorithms for this problem, and investigate their success probability, where input instances are generated under the planted solution model with equation probability p and perturbation probability q. For some variant of a typical message passing algorithm, we prove that p=I similar to(1/(nlnn)) is the threshold for the algorithm to work w.h.p. for any fixed constant q < 1/2.

关键词： MAX-3XORSAT Planted solution model message passing algorithm Spectral analysis

来源：评论

学校读者我要写书评

暂无评论

Analysis of Hard Decision and Soft Decision Decoding algorithms of LDPC Codes in AWGN 5

Analysis of Hard Decision and Soft Decision Decoding Algorit...

引用

IEEE International Advance Computing Conference (IACC 2015)

作者： Jose, Rinu Pe, Ameenudeen St Josephs Coll Engn & Technol Dept Elect & Commun Engn Palai Kerala India

ISBN: (纸本)9781479980475

This article compares the Bit Error Rate (BER) performance of soft and hard decision decoding algorithms of LDPC codes on AWGN channel at different code rates and Signal to Noise Ratio (SNR) levels. Even though, hard decision decoding algorithm is computationally simple, its BER performance is not appreciable. Devising soft decision decoding algorithms which are simple and good in BER performance requires comparison of probabilistic and log domain methods. Towards this, a code word is generated through modulo(2) addition between message bits and generator matrix. After Binary Phase Shift Keying (BPSK) modulation the AWGN noise is introduced to the modulated code word. BER performance is computed by comparing the message decoded by soft and hard decision algorithms with the transmitted message. The experiment is conducted in MATLAB. Soft decision decoding algorithm in log domain provides better BER performance than hard decision decoding algorithm regardless of the SNR level.

关键词： LDPC FEC LBC iterative decoding BER Sum product decoding message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：