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

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Castanheira, Daniel Gameiro, Atilio Univ Aveiro Inst Telecomunicacoes P-3810193 Aveiro Portugal

ISBN: (纸本)9781424480166

This paper focus on the lossy compression of a binary symmetric source. We propose a new algorithm for binary quantization over low density generator matrix (LDGM) codes. The proposed algorithm is a modified version of the belief propagation (BP) algorithm used in the channel coding framework and has linear complexity in the code block length. We also provide a common framework under which the proposed algorithm and some previously proposed algorithms fit. Simulation results show that our scheme achieves close to state-of-the-art performance with reduced complexity.

关键词： belief propagation algorithm binary codes binary symmetric source block codes channel coding framework linear complexity lossy compression lossy source coding low density generator matrix codes parity check codes soft decimation over LDGM code source coding

来源：评论

学校读者我要写书评

暂无评论

GaussianSource Coding Based on P-LDPC Code

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第4期71卷 1970-1981页

作者： Song, Dan Ren, Jinkai Wang, Lin Chen, Guanrong Xiamen Univ Dept Informat & Commun Engn Xiamen 361005 Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China

A lossy source coding system based on the protograph low-density parity-check (P-LDPC) code is proposed for Gaussian source compression. In the proposed system, the conventional belief propagation (BP) algorithm is modified to be a concatenated BP-inverse BP (BP-iBP) for encoding and decoding, where the iBP is constructed by a fully-connected layer of a neural network. Compared to the existing approximate message passing algorithm, the proposed BP-iBP realizes a float to-bit compression with low complexity for arbitrary Gaussian sources. The BP-iBP is implemented based on the linking relation of the protograph;therefore, it is necessary to optimally design the protograph to obtain better rate-distortion function (RDF) performance. Regarding the coding optimal procedure, a mutual information iteration convergence (MIIC) algorithm is designed as the optimal criterion to determine the source P-LDPC code with minimum distortion. Inspired by the plane construction of quantum stabilizer code, a lattice topological splicing (LTS) algorithm is proposed for regularly building the protograph to reduce the code searching complexity. By using the MIIC and the LTS algorithms, the BP-iBP based on the designed P-LDPC code maintains good distortion performance close to the RDF limit.

关键词： Codes Source coding Encoding Distortion Open area test sites Decoding Resource description framework Lossy source coding P-LDPC code belief propagation algorithm rate-distortion function optimal coding algorithm

来源：评论

学校读者我要写书评

暂无评论

Practical iterative decoding scheme using Reed-Solomon codes for magnetic recording channels

引用

IEEE TRANSACTIONS ON MAGNETICS 2004年第1期40卷 219-224页

作者： Mita, S Matsui, H Izumita, M Sawaguchi, H Toyota Technol Inst Nagoya Aichi 4688511 Japan Hitachi Global Storage Technol Japan Ltd Kanagawa 2568510 Japan Hitachi Ltd Storage Technol Res Ctr Kanagawa 2568510 Japan

The short-term iterative decoding implementation proposed in this paper not only uses conventional long-distance Reed-Solomon codes (RS codes), but also uses short-distance RS codes consisting of redundant symbols P and Q periodically inserted into the data in 512-byte sectors. A single parity matrix composed of redundant symbol P is decoded by using a belief propagation algorithm (BPA) such as low density parity check (LDPC) decoding. The Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is used for EEPR4 channel decoding. Serial iterative decoding is done by using log likelihood ratios produced by both algorithms. Simulations of the use of 28 redundant symbols of the short-distance RS codes and 30 symbols of the long-distance RS codes have confirmed that at a block error rate of about 10(-1) (bit-error rate) approximate to 10(-3) the proposed system can reduce the block error rate more than tenfold. Consequently, one block erasure correction including 30 symbols per sector can be achieved at the same error rate.

关键词： Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm belief propagation algorithm low density parity check (LDPC) magnetic recording channels Reed-Solomon codes turbo code

来源：评论

学校读者我要写书评

暂无评论

CORDIC instructions for LDPC decoding on SDR platforms

引用

ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING 2011年第2-3期69卷 191-206页

作者： Senthilvelan, Murugappan Yu, Meng Iancu, Daniel Sima, Mihai Schulte, Michael Optimum Semicond Technol Inc Tarrytown NY USA Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA Tampere Univ Technol Tampere 33720 Finland Univ Victoria Dept Elect & Comp Engn Victoria BC Canada Adv Micro Devices Inc AMD Res Austin TX USA

Wireless protocols strive to increase spectral efficiency and achieve high data throughput. Low-density parity-check (LDPC) codes are advanced forward error correction (FEC) codes that use iterative decoding techniques to achieve close to the Shannon capacity. Due to their superior performance, state-of-art wireless protocols, such as WiMAX and LTE Advanced, are adopting LDPC codes. LDPC codes come with the high cost of drastically increased computational effort for decoding. Among the proposed decoding algorithms, the belief propagation (BP) algorithm leads to a good approximation of an optimal decoder;however, it uses compute-intensive hyperbolic trigonometric functions. To reduce the computational complexity, typical LDPC decoder implementations use simplified algorithms, such as the min-sum algorithm, at the expense of reduced signal processing performance. Efficient and accurate methods to compute hyperbolic trigonometric functions can facilitate the use of the BP algorithm in real-time LDPC decoder implementations. This paper investigates hyperbolic COordinate Rotation DIgital Computer (CORDIC) instruction set architecture (ISA) extensions for software-defined radio (SDR) processors to compute the hyperbolic trigonometric functions for LDPC decoding efficiently. The CORDIC ISA extensions are evaluated on the low-power multi-threaded Sandbridge Sandblaster (TM) SB3000 platform. The computational performance, numerical accuracy, hardware estimates, power consumption estimates, and memory requirements with the CORDIC ISA extensions are compared to a baseline implementation without these extensions on the SB3000.

关键词： LDPC decoding belief propagation algorithm Hyperbolic tangents CORDIC SDR ISA extensions

来源：评论

学校读者我要写书评

暂无评论

Reducing the Complexity of the Layer Scheduled LDPC Decoder Based on the Information Bottleneck Method

引用

PROBLEMS OF INFORMATION TRANSMISSION 2024年第3期60卷 199-208页

作者： Melnikov, I. A. Uglovskii, A. Yu. Kreshchuk, A. A. Kureev, A. A. Khorov, E. M. Russian Acad Sci Kharkevich Inst Informat Transmiss Problems Moscow Russia Natl Res Univ Moscow Inst Phys & Technol Moscow Russia

The complexity of belief propagation algorithms for decoding LDPC codes can be significantly reduced by storing the precomputed sum of messages in variable nodes. This optimization is particularly useful for layered schedule decoders, where it also simplifies the hardware implementation. To reduce the requirement for the amount of information to be processed during decoding, the information bottleneck method is used, which reduces the bit width of all updated messages. However, under this approach, re-calculation of the sum when excluding one of messages becomes complicated. The paper is devoted to development of an algorithm for construction of a discrete binary function corresponding to such subtraction. When using this algorithm, the number of stored and used lookup tables for variable nodes is reduced.

关键词： belief propagation algorithm iterative decoding low-density parity-check (LDPC) codes information bottleneck method sequential decoding

来源：评论

学校读者我要写书评

暂无评论

A Physical Probabilistic Network Model for Distribution Network Topology Recognition Using Smart Meter Data

引用

IEEE TRANSACTIONS ON SMART GRID 2019年第6期10卷 6965-6973页

作者： Jiang, Wei Chen, Jinming Tang, Haibo Cheng, Shu Hu, Qinran Cai, Mengmeng Rahman, Saifur Southeast Univ Sch Elect Engn Nanjing 210096 Peoples R China Virginia Tech Adv Res Inst Arlington VA 22203 USA

Given the considerable scale of distribution networks in urban and rural areas, as well as the lack of management records, adjustments of switches during the distribution system operation are poorly documented. Such deficiency results in the inaccuracy of models stored in the distribution network automation system, and thus misleads the state estimation. With the emergence of information and communication technology, a large number of the feeder and residential smart meter data are accumulated. Such data can help recognize the operation modes of distribution networks by analyzing the relationships between the on/off states of switches and the voltage correlations among buses. However, the limited quantity and quality of the sampling data restrict the implementation of data-driven recognition. In this paper, a physical-probabilistic-network (PPN) model applied for inferring overall operation mode of distribution networks is proposed. Based on which, a belief propagation-based algorithm is proposed for the inference even under situations when there are only partial bus voltages data available. Meanwhile, the required variable for inference can be reduced from the active trail analysis. Experiment results are used to compare its performance with classic methods and to prove its effectiveness and advantages.

关键词： Distribution network topology recognition probabilistic graphical model belief propagation algorithm

来源：评论

学校读者我要写书评

暂无评论

Inference in hybrid Bayesian networks with large discrete and continuous domains

引用

EXPERT SYSTEMS WITH APPLICATIONS 2016年 49卷 1-19页

作者： Mori, Junichi Mahalec, Vladimir Nippon Steel & Sumitomo Met Corp Dept Comp Syst Kimitsu Works Kimitsu City Chiba 2991141 Japan McMaster Univ Dept Chem Engn Hamilton ON L8S 4L7 Canada

Inference in Bayesian networks with large domain of discrete variables requires significant computational effort. In order to reduce the computational effort, current approaches often assume that discrete variables have some bounded number of values or are represented at an appropriate size of clusters. In this paper, we introduce decision-tree structured conditional probability representations that can efficiently handle a large domain of discrete and continuous variables. These representations can partition the large number of values into some reasonable number of clusters and lead to more robust parameter estimation. Very rapid computation and ability to treat both discrete and continuous variables are accomplished via modified belief propagation algorithm. Being able to compute various types of reasoning from a single Bayesian network eliminates development and maintenance issues associated with the use of distinct models for different types of reasoning. Application to real-world steel production process data is presented. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Large domain of discrete and continuous variables Decision tree Hybrid Bayesian network belief propagation algorithm Context-specific independence

来源：评论

学校读者我要写书评

暂无评论

Network calibration method based on a Bayesian approach using frequency modulation communications for wireless systems over additive white Gaussian noise channel

引用

IET SIGNAL PROCESSING 2018年第4期12卷 454-462页

作者： Chaal, Dina Lyhyaoui, Abdelouahid ENSAT LTI Lab BP 1818 Tangier Principal Tangier Morocco

Wireless sensor networks offer flexibility to monitor environmental conditions. However, in some hostile environments with changing propagation occurrences, it is challenging to guarantee a network free from systematic errors (biases), those errors can corrupt the data gathered from the network. The authors intend to address this problem using a Bayesian approach. This study presents a new Bayesian wireless network model based on a belief propagation algorithm over a noisy communication, to seek the calibration of the network for correlated sources. They set up a point-to-point communication model, consisting of a frequency modulation signal at the transmitter and a discrete-time phase-locked loop structure at the receiver over an additive white Gaussian noise channel. Then, they use a Bayesian approach to model the propagation of information, and analyse the noise impact on their system. The simulation results show significant improvement within a few time instants in the mean squared error of the sensors internal states. An evaluation in a noisy environment confirms the robustness of the proposed system.

关键词： calibration Bayes methods frequency modulation AWGN channels wireless channels radiowave propagation radio transmitters phase locked loops radio receivers mean square error methods mean squared error method receiver discrete-time phase-locked loop structure transmitter point-to-point communication model belief propagation algorithm environmental condition monitoring wireless sensor network additive white Gaussian noise channel frequency modulation communication Bayesian approach network calibration method

来源：评论

学校读者我要写书评

暂无评论

Low-density parity check codes and iterative decoding for long-haul optical communication systems

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2003年第2期21卷 438-446页

作者： Vasic, B Djordjevic, IB Kostuk, RK Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA

A forward-error correction (FEC) scheme based on low-density parity check (LDPC) codes and iterative decoding using belief propagation in code graphs is presented in this paper. We show that LDPC codes provide a significant system performance improvement with respect to the state-of-the-art FEC schemes employed in optical communications systems. We present a class of structured codes based on mutually orthogonal Latin rectangles. Such codes have high rates and can lend themselves to very low-complexity encoder/decoder implementations. The system performance is further improved by a code design that eliminates short cycles in a graph employed in iterative decoding.

关键词： balanced incomplete block designs (BIBDs) belief propagation algorithm forward-error correction (FEC) long-haul transmission low-density parity check (LDPC) codes optical communications

来源：评论

学校读者我要写书评

暂无评论

Hybrid Message-Passing algorithm and Architecture for Decoding Cyclic Non-binary LDPC Codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2013年第12期E96A卷 2652-2659页

作者： Lu, Yichao He, Gang Tian, Guifen Goto, Satoshi Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan

Recently, non-binary low-density parity-check (NB-LDPC) codes starts to show their superiority in achieving significant coding gains when moderate codeword lengths are adopted. However, the overwhelming decoding complexity keeps NB-LDPC codes from being widely employed in modern communication devices. This paper proposes a hybrid message-passing decoding algorithm which consumes very low computational complexity. It achieves competitive error performance compared with conventional Min-max algorithm. Simulation result on a (255,174) cyclic code shows that this algorithm obtains at least 0.5 dB coding gain over other state-of-the-art low-complexity NB-LDPC decoding algorithms. A partial-parallel NB-LDPC decoder architecture for cyclic NB-LDPC codes is also developed based on this algorithm. Optimization schemes are employed to cut off hard decision symbols in RAMs and also to store only part of the reliability messages. In addition, the variable node units are redesigned especially for the proposed algorithm. Synthesis results demonstrate that about 24.3% gates and 12% memories can be saved over previous works.

关键词： belief propagation algorithm iterative majority-logic decoding low-density parity-check codes non-binary VLSI

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：