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

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Farhoodi, Ahmad A. Banihashemi, Amir H. Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

ISBN: (纸本)9781424492688

In this paper, the problem of MIMO signal detection based on the belief propagation (BP) algorithm has been addressed in the presence of channel and noise uncertainties at the receiver. We propose a robust detection approach that works on the basis of message passing algorithm on the best tree approximation of the posterior distribution of the received signal. Our approach to make the detector robust is to formulate a worst-case detector design as a min-max optimization problem with imperfect channel and noise knowledge at the receiver.

关键词： Belief propagation Detectors MIMO MIMO communication MIMO signal detection Noise Receivers Robustness Vectors belief propagation imperfect channel message passing algorithm noise knowledge radio receivers received signal posterior distribution robust MIMO receiver tree approximation trees (mathematics) worst-case detector design

来源：评论

学校读者我要写书评

暂无评论

Lossy Source Compression of Non-Uniform Binary Sources Using GQ-LDGM Codes

Lossy Source Compression of Non-Uniform Binary Sources Using...

引用

IEEE Information Theory Workshop (ITW)

作者： Cappellari, Lorenzo Univ Padua Dept Informat Engn I-35100 Padua Italy

ISBN: (纸本)9781424482641

In this paper, we study the use of GF(q)-quantized LDGM codes for binary source coding. By employing quantization, it is possible to obtain binary codewords with a non-uniform distribution. The obtained statistics is hence suitable for optimal, direct quantization of non-uniform Bernoulli sources. We employ a message-passing algorithm combined with a decimation procedure in order to perform compression. The experimental results based on GF(q)-LDGM codes with regular degree distributions yield performances quite close to the theoretical rate-distortion bounds.

关键词： GQ-LDGM codes binary codes binary codeword binary source coding decimation procedure direct quantization lossy source compression low density generator matrix codes message passing algorithm non-uniform Bernoulli source non-uniform binary source non-uniform distribution source coding

来源：评论

学校读者我要写书评

暂无评论

Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions

引用

THEORY OF COMPUTING SYSTEMS 2009年第4期45卷 926-942页

作者： Onsjoe, Mikael Watanabe, Osamu Tokyo Inst Technol Dept Math & Comput Sci Tokyo 152 Japan

As a framework for simple but basic statistical inference problems we introduce the genetic Most Likely Solution problem, the task of finding a most likely solution (MLS in short) for a given problem instance under some given probability model. Although many MLS problems are NP-hard, we propose for these problems, to study their average-case complexity under their assumed probability models. We show three examples of MLS problems, and show that "message passing algorithms" (e.g., belief propagation) work reasonably well for these problems. Some of the technical results of this paper are from the author's recent work (Watanabe and Yamamoto in Lecture Notes in Computer Science, vol. 4142, pp. 277-282, 2006, and Onsjo and Watanabe in Lecture Notes in Computer Science, vol. 4288, pp. 507-516, 2006).

关键词： Most-likely solution Planted solution model Average-case analysis message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

CRC Assisted High Rate Single Parity Check Product Codes

CRC Assisted High Rate Single Parity Check Product Codes

引用

9th IEEE Africon Conference

作者： Xu, Hongjun

ISBN: (纸本)9781424439188

The single parity check (SPC) product code is one of the most popular error detection codes because it is easy to implement. But there are unrecoverable errors in the conventional two dimensional SPC product codes. To further improve the performance we propose Cyclic Redundancy Check (CRC) assisted SPC product codes in this paper. The proposed CRC assisted SPC product codes can detect most of unrecoverable errors in the SPC product codes by use of the Chase-like algorithm, and then improve the BER performance. This is verified through simulation. Simulation of rate 0.923 CRC assisted SPC 11 product codes also yields a BER of 10(-5) at 4.9 dB and only 1.3 dB away from Shannon limit. That is a very good result for frame size of 1024 bits.

关键词： Product codes single parity check codes message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

A High Performance Partially-Parallel Irregular LDPC Decoder Based on Sum-Delta message passing Schedule

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年第12期E91A卷 3622-3629页

作者： Ji, Wen Abe, Yuta Ikenaga, Takeshi Goto, Satoshi Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan

In this paper, we propose a partially-parallel irregular LDPC decoder based on IEEE 802.1 In standard targeting high throughput and small area applications. The design is based on a novel sum-delta message passing algorithm characterized as follows: (i) Decoding throughput is greatly improved by utilizing the difference value between the updated and the original value to remove redundant computations. (H) Registers and memory are optimized to store only the frequently used messages to decrease the hardware cost. (iii) Techniques such as binary sorting, parallel column operation, high performance pipelining are used to further speed lip the message passing procedure. The synthesis result in TSMC 0.18 CMOS technology demonstrates that for (648,324) irregular LDPC code, our decoder achieves 7.5X improvement in throughput, which reaches 402 Mbps at the frequency of 200 MHz, with 11% area reduction. The synthesis result also demonstrates the competitiveness to the fully-parallel regular LDPC decoders in terms of the tradeoff between throughput, area and power.

关键词： LDPC message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Novel low-density signature for synchronous CDMA systems over AWGN channel

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2008年第4期56卷 1616-1626页

作者： Hoshyar, Reza Wathan, Perry P. Tafazolli, Rahim Univ Surrey Ctr Commun Syst Res Mobile Commun Res Grp Guildford GU2 5XH Surrey England

Novel low-density signature (LDS) structure is proposed for transmission and detection of symbol-synchronous communication over memoryless Gaussian channel. Given N as the processing gain, under this new arrangement, users' symbols are spread over N chips but virtually only d(v) < N chips that contain nonzero-values. The spread symbol is then so uniquely interleaved as the sampled, at chip rate, received signal contains the contribution from only d(c) < K number of users, where K denotes the total number of users in the system. Furthermore, a near-optimum chip-level iterative soft-in-soft-out (SISO) multiuser decoding (MUD), which is based on message passing algorithm (MPA) technique, is proposed to approximate optimum detection by efficiently exploiting the LDS structure. Given beta = K/N as the system loading, our simulation suggested that the proposed system alongside the proposed detection technique, in AWGN channel, can achieve an overall performance that is close to single-user performance, even when the system has 200% loading, i.e., when beta = 2. Its robustness against near-far effect and its performance behavior that is very similar to optimum detection are demonstrated in this paper. In addition, the complexity required for detection is now exponential to d(c) instead of K as in conventional code division multiple access (CDMA) structure employing optimum multiuser detector.

关键词： chip-level iterative SISO MUD Gaussian channel low-density signature message passing algorithm overloaded condition

来源：评论

学校读者我要写书评

暂无评论

Decentralized Target Tracking Based on a Weighted Extended Kalman Filter for Wireless Sensor Networks

Decentralized Target Tracking Based on a Weighted Extended K...

引用

IEEE Global Telecommunications Conference (GLOBECOM 08)

作者： Wang, Chin-Liang Wu, Dong-Shing Natl Tsing Hua Univ Dept Elect Engn Hsinchu 30013 Taiwan Natl Tsing Hua Univ Inst Commun Engn Hsinchu 30013 Taiwan

ISBN: (纸本)9781424423248

This paper presents a weighted extended Kalman filter (WEKF) for target tracking in wireless sensor networks, where the location estimation is formulated as a weighted least squares (WLS) problem by taking weights of the local estimates based on the reliability of distance estimation and the WLS problem is solved in an iterative, decentralized manner based on the WEKF. We adopt a message passing (MP) algorithm for inter-sensornode communication and for adaptively selecting the participating sensor nodes as the target moves around the area. During each iteration, a participating sensor node computes a target's location estimate and passes it on to the next participating sensor node for processing to generate a new location estimate. The update process is circulated among the participating sensor nodes in the close vicinity of the target. To show the convergence behavior of the WEKF-based method, a convergence analysis is given. Computer simulation results demonstrate that the proposed scheme has better location accuracy and tracking performance than previous related methods.

关键词： message passing algorithm positioning target tracking weighted extended Kalman filters wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Reliability-based hybrid ARQ scheme with encoded parity bit retransmissions and message passing decoding

Reliability-based hybrid ARQ scheme with encoded parity bit ...

引用

29th Symposium on Information Theory and Its Applications (SITA2006)

作者： Koizumi, Daiki Kobayashi, Naoto Matsushima, Toshiyasu Hirasawa, Shigeichi Waseda Univ Res Inst Sci & Engn Tokyo Japan Waseda Univ Media Network Ctr Tokyo 1698050 Japan Waseda Univ Sch Fundamental Sci & Engn Dept Appl Math Tokyo 1698555 Japan Waseda Univ Sch Creat Sci & Engn Dept Ind & Management Syst Engn Tokyo 1698555 Japan Waseda Univ Grad Sch Sci & Engn Tokyo 1698555 Japan

Reliability-based hybrid ARQ (RB-HARQ) is a kind of incremental-redundancy ARQ recently introduced. In the RB-HARQ, the receiver returns both NAK signal and set of unreliable bit indices if the received sequence is not accepted. Since each unreliable bit index is determined by the bitwise posterior probability, better approximation of that probability becomes crucial as the number of retransmissions increases. Assuming the systematic code for the initial transmission, the proposed RB-HARQ scheme has the following two features: (a) the sender retransmits newly encoded and interleaved parity bits corresponding to the unreliable information bits;(b) the retransmitted parity bits as well as the initial received sequence are put all together to perform the message passing decoding i.e. the suboptimal MAP decoding. Finally, simulation results are shown to evaluate the above two features.

关键词： reliability-based hybrid ARQ bitwise MAP decoding message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED NEW STRUCTURE OF SINGLE PARITY CHECK PRODUCT CODES

引用

SAIEE AFRICA RESEARCH JOURNAL 2006年第2期97卷 132-135页

作者： Xu, H. Takawira, F. Univ KwaZulu Natal Sch Elect Elect & Comp Engn Howard Coll CampusKing George V Ave ZA-4041 Durban South Africa

This paper proposes an improved new structure of Single Parity Check (SPC) product codes with an embedded interleaver. The complexity of decoding the new SPC product codes is the same as the one of the existing single parity check product codes by use of the message passing algorithm. Simulation results and bound analysis demonstrate a significant bite error rate (BER) performance improvement compared to the existing single parity check product codes for high code rates at medium signal-to-noise ratios (SNRs).

关键词： Product codes single parity check codes message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Diagnosis based on Trellis Processes

Distributed Diagnosis based on Trellis Processes

引用

44th IEEE Conference on Decision Control/European Control Conference (CCD-ECC)

作者： Fabre, Eric INRIA IRISA Distribcom Grp F-35042 Rennes France

ISBN: (纸本)0780395670

Distributed or networked systems become rapidly intractable as their size augments. This is due to the combinatorial explosion taking place in the state space, but also in the trajectory space. The latter is reinforced by the amount of concurrency in the system (the fact that several non related events can occur simultaneously). We describe a triple strategy to extend standard monitoring approaches to such systems. We first use a true concurrency semantics to represent trajectories of the system. We then describe a very compact data structure to handle sets of trajectories, that we call the trellis of the system. This notion generalizes to distributed systems the standard notion of trellis of an automaton, where one dimension is time, and the other dimension encodes possible states at each time. Finally, we show that trellises have nice factorization properties, that allow the design of distributed monitoring approaches. In other words, a problem like state estimation for example, can be solved by parts, component per component, provided interactions between components are properly handled. We illustrate the approach on a distributed diagnosis problem.

关键词： distributed system concurrency trellis modular/distributed diagnosis message passing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：