東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Synchronization in low duty cycle UW...

Zhu, Mingrui.

Linked to FindBook

Google Book

Amazon

博客來

Synchronization in low duty cycle UWB systems using iterative message passing.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Synchronization in low duty cycle UWB systems using iterative message passing./
Author:	Zhu, Mingrui.
Description:	136 p.
Notes:	Source: Dissertation Abstracts International, Volume: 67-06, Section: B, page: 3369.
Contained By:	Dissertation Abstracts International67-06B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3219858
ISBN:	9780542718076

Synchronization in low duty cycle UWB systems using iterative message passing.
Zhu, Mingrui.

Synchronization in low duty cycle UWB systems using iterative message passing. - 136 p.

Source: Dissertation Abstracts International, Volume: 67-06, Section: B, page: 3369.

Thesis (Ph.D.)--University of Southern California, 2005.

Iterative message passing algorithms (MPAs) on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near optimal performance and significant complexity reduction.

ISBN: 9780542718076Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Synchronization in low duty cycle UWB systems using iterative message passing.
LDR:02729nmm 2200301 4500 001 1833268
005 20071001080746.5
008 130610s2005 eng d
020 $a 9780542718076
035 $a (UMI)AAI3219858
035 $a AAI3219858
040 $a UMI $c UMI
100 1 $a Zhu, Mingrui. $3 1921976
245 1 0 $a Synchronization in low duty cycle UWB systems using iterative message passing.
300 $a 136 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-06, Section: B, page: 3369.
500 $a Adviser: Keith M. Chugg.
502 $a Thesis (Ph.D.)--University of Southern California, 2005.
520 $a Iterative message passing algorithms (MPAs) on graphs, which are generalized from the well-known turbo decoding algorithm, have been studied intensively in recent years because they can provide near optimal performance and significant complexity reduction.
520 $a The goal of the first part of this work is to apply message passing techniques to the pseudo random code acquisition problems. To do that, good pseudo-noise patterns are represented by sparse graphical models, and the standard iterative MPAs are applied over the graphs to approximate maximum likelihood synchronization. Simulation results show that the iterative MPAs can achieve better performance than the traditional serial search in the sense that they work at low signal-to-noise ratios and are much faster. Compared to full parallel search, this approach typically provides significant complexity reduction.
520 $a However, the proposed algorithm does not perform well enough when the number of observations is relatively large, and we believe that the main reason for this is that the underlying graphical representation is not good enough. This motivates the second part of this work, specifically, understanding and analyzing the performance of iterative MPAs on bi-partite loopy graphs.
520 $a Using techniques of eigenvalue analysis, we derive bounds on the variable expansions of Tanner graphs. These bounds lead to bounds on stopping distance and stopping redundancy, which are critical parameters of the Tanner graphs that can determine the performance of iterative decoding for binary erasure channels. Based on these results, we will also propose two criteria in an attempt to relate variable expansions of Tanner graphs with the performance of the associated iterative MPAs for binary symmetric channels and additive white Gaussian channels.
590 $a School code: 0208.
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 67-06B.
790 1 0 $a Chugg, Keith M., $e advisor
790 $a 0208
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3219858