東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Algorithms for blind equalization ba...

Wu, Zhengwei.

Linked to FindBook

Google Book

Amazon

博客來

Algorithms for blind equalization based on relative gradient and toeplitz constraints.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms for blind equalization based on relative gradient and toeplitz constraints./
Author:	Wu, Zhengwei.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2016,
Description:	244 p.
Notes:	Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
Contained By:	Dissertation Abstracts International78-04B(E).
Subject:	Electrical engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10190226
ISBN:	9781369339697

Algorithms for blind equalization based on relative gradient and toeplitz constraints.
Wu, Zhengwei.

Algorithms for blind equalization based on relative gradient and toeplitz constraints. - Ann Arbor : ProQuest Dissertations & Theses, 2016 - 244 p.

Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.

Thesis (Ph.D.)--University of Pennsylvania, 2016.

This item is not available from ProQuest Dissertations & Theses.

Blind Equalization (BE) refers to the problem of recovering the source symbol sequence from a signal received through a channel in the presence of additive noise and channel distortion, when the channel response is unknown and a training sequence is not accessible. To achieve BE, statistical or constellation properties of the source symbols are exploited. In BE algorithms, two main concerns are convergence speed and computational complexity.

ISBN: 9781369339697Subjects--Topical Terms:

649834
Electrical engineering.

Algorithms for blind equalization based on relative gradient and toeplitz constraints.
LDR:03233nmm a2200325 4500 001 2118034
005 20170531095047.5
008 180830s2016 ||||||||||||||||| ||eng d
020 $a 9781369339697
035 $a (MiAaPQ)AAI10190226
035 $a AAI10190226
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wu, Zhengwei. $3 3279844
245 1 0 $a Algorithms for blind equalization based on relative gradient and toeplitz constraints.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2016
300 $a 244 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-04(E), Section: B.
500 $a Adviser: Saleem A. Kassam.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2016.
506 $a This item is not available from ProQuest Dissertations & Theses.
520 $a Blind Equalization (BE) refers to the problem of recovering the source symbol sequence from a signal received through a channel in the presence of additive noise and channel distortion, when the channel response is unknown and a training sequence is not accessible. To achieve BE, statistical or constellation properties of the source symbols are exploited. In BE algorithms, two main concerns are convergence speed and computational complexity.
520 $a In this dissertation, we explore the application of relative gradient for equalizer adaptation with a structure constraint on the equalizer matrix, for fast convergence without excessive computational complexity. We model blind equalization with symbol-rate sampling as a blind source separation (BSS) problem and study two single-carrier transmission schemes, specifically block transmission with guard intervals and continuous transmission. Under either scheme, blind equalization can be achieved using independent component analysis (ICA) algorithms with a Toeplitz or circulant constraint on the structure of the separating matrix. We also develop relative gradient versions of the widely used Bussgang-type algorithms. Processing the equalizer outputs in sliding blocks, we are able to use the relative gradient for adaptation of the Toeplitz constrained equalizer matrix. The use of relative gradient makes the Bussgang condition appear explicitly in the matrix adaptation and speeds up convergence.
520 $a For the ICA-based and Bussgang-type algorithms with relative gradient and matrix structure constraints, we simplify the matrix adaptations to obtain equivalent equalizer vector adaptations for reduced computational cost. Efficient implementations with fast Fourier transform, and approximation schemes for the cross-correlation terms used in the adaptation, are shown to further reduce computational cost.
520 $a We also consider the use of a relative gradient algorithm for channel shortening in orthogonal frequency division multiplexing (OFDM) systems. The redundancy of the cyclic prefix symbols is used to shorten a channel with a long impulse response. We show interesting preliminary results for a shortening algorithm based on relative gradient.
590 $a School code: 0175.
650 4 $a Electrical engineering. $3 649834
690 $a 0544
710 2 $a University of Pennsylvania. $b Electrical and Systems Engineering. $3 3169654
773 0 $t Dissertation Abstracts International $g 78-04B(E).
790 $a 0175
791 $a Ph.D.
792 $a 2016
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10190226