語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Graphical models for iterative data ...
~
Thiennviboon, Phunsak.
FindBook
Google Book
Amazon
博客來
Graphical models for iterative data detection.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Graphical models for iterative data detection./
作者:
Thiennviboon, Phunsak.
面頁冊數:
223 p.
附註:
Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2844.
Contained By:
Dissertation Abstracts International64-06B.
標題:
Engineering, Electronics and Electrical. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3094422
ISBN:
0496421231
Graphical models for iterative data detection.
Thiennviboon, Phunsak.
Graphical models for iterative data detection.
- 223 p.
Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2844.
Thesis (Ph.D.)--University of Southern California, 2002.
A graphical modelling is the art of system modelling originally developed in many areas, especially for inference problems in statistics and expert systems. Recently, the connection with decoding/detection algorithms in communications was discovered. Although this method is becoming prevalent tool in the coding community, it has received relatively little attention in many practical communication problems.
ISBN: 0496421231Subjects--Topical Terms:
626636
Engineering, Electronics and Electrical.
Graphical models for iterative data detection.
LDR
:03395nmm 2200313 4500
001
1841532
005
20050915142049.5
008
130614s2002 eng d
020
$a
0496421231
035
$a
(UnM)AAI3094422
035
$a
AAI3094422
040
$a
UnM
$c
UnM
100
1
$a
Thiennviboon, Phunsak.
$3
1929825
245
1 0
$a
Graphical models for iterative data detection.
300
$a
223 p.
500
$a
Source: Dissertation Abstracts International, Volume: 64-06, Section: B, page: 2844.
500
$a
Adviser: Keith M. Chugg.
502
$a
Thesis (Ph.D.)--University of Southern California, 2002.
520
$a
A graphical modelling is the art of system modelling originally developed in many areas, especially for inference problems in statistics and expert systems. Recently, the connection with decoding/detection algorithms in communications was discovered. Although this method is becoming prevalent tool in the coding community, it has received relatively little attention in many practical communication problems.
520
$a
In this thesis, graphical models are represented by junction graphs together with various types of message-passing algorithms (MPAs). The general sufficient conditions for well-defined marginalizing-combining operations of MPAs are proposed to account both continuous and discrete variables and three practical problems involving iterative data detection are considered. First, a full binary tree is introduced to the soft-input/soft-output (SISO) module in order to obtain a low-latency efficient parallel-processing implementation. In other words, the forward-backward-tree (FBT) SISO algorithm provides O(log 2 N) latency as opposed to O(N) latency from the standard forward-backward (FB) algorithm for the SISO module.
520
$a
Next, the general two-dimensional data detection is considered and is proven to be NP hard. Three types of loopy graphical models are investigated including the simple input-output (SIO) model, the serially concatenated (SC) model, and the novel grid model, along with standard and modified MPAs. Simulation results for the page-oriented optical memory system show that these iterative algorithms can provide near-optimal performance while the best performance can be obtained through the SC or grid models. Moreover, a reduced-complexity grid algorithm is proposed and applied to digital image halftoning with complexity and image quality comparable to the best techniques in the literature.
520
$a
Finally, the general structure of trellis-based reduced-state (RS) FB algorithms is proposed. This structured is described from ad hoc intuitive approach and then systematically developed based on the loopy overstructured graph (OSG) and a novel modified MPA. While maintaining the optimality in the absence of state reduction, the modified MPA provides a broad class of existing and novel practical RS-FB algorithms through applications of reduced-state techniques. Extensive numerical simulations are considered and it is demonstrated that in many cases the performance of RS-FB algorithms is close to that of the corresponding full-complexity algorithms.
590
$a
School code: 0208.
650
4
$a
Engineering, Electronics and Electrical.
$3
626636
650
4
$a
Computer Science.
$3
626642
690
$a
0544
690
$a
0984
710
2 0
$a
University of Southern California.
$3
700129
773
0
$t
Dissertation Abstracts International
$g
64-06B.
790
1 0
$a
Chugg, Keith M.,
$e
advisor
790
$a
0208
791
$a
Ph.D.
792
$a
2002
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3094422
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9191046
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入