東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

The capacity of communication channe...

Yang, Shaohua.

Linked to FindBook

Google Book

Amazon

博客來

The capacity of communication channels with memory.

Record Type:	Electronic resources : Monograph/item
Title/Author:	The capacity of communication channels with memory./
Author:	Yang, Shaohua.
Description:	115 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-05, Section: B, page: 2565.
Contained By:	Dissertation Abstracts International65-05B.
Subject:	Engineering, Electronics and Electrical. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3132033
ISBN:	0496792730

The capacity of communication channels with memory.
Yang, Shaohua.

The capacity of communication channels with memory. - 115 p.

Source: Dissertation Abstracts International, Volume: 65-05, Section: B, page: 2565.

Thesis (Ph.D.)--Harvard University, 2004.

For an inter-symbol-interference state-machine channel, a simple form of the feedback-capacity-achieving source distribution is revealed. A Markov source, whose memory length equals the channel memory length, achieves the feedback capacity. Given the posterior channel-state distribution, the optimal source Markov transition probabilities become independent of the whole history of past channel outputs. Further, when the feedback is delayed, the delayed feedback capacity is achieved by a Markov source whose memory length equals the sum of the channel memory length and the feedback delay. The Markov source optimization is formulated as a standard stochastic control problem and is solved by dynamic programming. The (delayed) feedback capacity is an upper-bound on the feed-forward channel capacity, and this bound can be made tight by increasing the feedback delay.

ISBN: 0496792730Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

The capacity of communication channels with memory.
LDR:02955nmm 2200289 4500 001 1840802
005 20050822101740.5
008 130614s2004 eng d
020 $a 0496792730
035 $a (UnM)AAI3132033
035 $a AAI3132033
040 $a UnM $c UnM
100 1 $a Yang, Shaohua. $3 1929122
245 1 4 $a The capacity of communication channels with memory.
300 $a 115 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-05, Section: B, page: 2565.
500 $a Adviser: Aleksandar Kavcic.
502 $a Thesis (Ph.D.)--Harvard University, 2004.
520 $a For an inter-symbol-interference state-machine channel, a simple form of the feedback-capacity-achieving source distribution is revealed. A Markov source, whose memory length equals the channel memory length, achieves the feedback capacity. Given the posterior channel-state distribution, the optimal source Markov transition probabilities become independent of the whole history of past channel outputs. Further, when the feedback is delayed, the delayed feedback capacity is achieved by a Markov source whose memory length equals the sum of the channel memory length and the feedback delay. The Markov source optimization is formulated as a standard stochastic control problem and is solved by dynamic programming. The (delayed) feedback capacity is an upper-bound on the feed-forward channel capacity, and this bound can be made tight by increasing the feedback delay.
520 $a The linear Gaussian channel with an average input power constraint can be equivalently modelled as a state machine channel. When the channel has feedback, by following similar procedures as developed for the state machine channel, it is shown that Gauss-Markov sources achieve the feedback capacity and a Kalman-Bucy filter is optimal for processing the feedback. By introducing an auxiliary shadow price variable, the average signal power constraint is eliminated from the optimization problem. The source optimization and capacity computation problem becomes a standard stochastic control problem and is solved by dynamic programming. Dynamic programming further reveals the structure of the optimal signal, i.e., Xt=dTt St-1 -ESt-1&vbm0; yt-11, s0 +etVt, Kalman filterinnovation where vector d&barbelow;t and scaler et are coefficients and random variable Vt represents new information. When the optimal Kalman-Bucy filter for processing the feedback is asymptotically stationary, the asymptotic feedback capacity exists and is determined by simple non-linear programming. The non-linear programming problem is explicitly solved for first-order autoregressive moving-average Gaussian noise channels.
590 $a School code: 0084.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Engineering, System Science. $3 1018128
690 $a 0544
690 $a 0790
710 2 0 $a Harvard University. $3 528741
773 0 $t Dissertation Abstracts International $g 65-05B.
790 1 0 $a Kavcic, Aleksandar, $e advisor
790 $a 0084
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3132033