Blind Identification and Separation of Complex-valued Signals
Home > Science, Technology & Agriculture > Electronics and communications engineering > Communications engineering / telecommunications > Signal processing > Blind Identification and Separation of Complex-valued Signals
Blind Identification and Separation of Complex-valued Signals

Blind Identification and Separation of Complex-valued Signals


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Blind identification consists of estimating a multi-dimensional system only through the use of its output, and source separation, the blind estimation of the inverse of the system. Estimation is generally carried out using different statistics of the output. The authors of this book consider the blind identification and source separation problem in the complex-domain, where the available statistical properties are richer and include non-circularity of the sources – underlying components. They define identifiability conditions and present state-of-the-art algorithms that are based on algebraic methods as well as iterative algorithms based on maximum likelihood theory. Contents 1. Mathematical Preliminaries. 2. Estimation by Joint Diagonalization. 3. Maximum Likelihood ICA. About the Authors Eric Moreau is Professor of Electrical Engineering at the University of Toulon, France. His research interests concern statistical signal processing, high order statistics and matrix/tensor decompositions with applications to data analysis, telecommunications and radar. Tülay Adali is Professor of Electrical Engineering and Director of the Machine Learning for Signal Processing Laboratory at the University of Maryland, Baltimore County, USA. Her research interests concern statistical and adaptive signal processing, with an emphasis on nonlinear and complex-valued signal processing, and applications in biomedical data analysis and communications. Blind identification consists of estimating a multidimensional system through the use of only its output. Source separation is concerned with the blind estimation of the inverse of the system. The estimation is generally performed by using different statistics of the outputs. The authors consider the blind estimation of a multiple input/multiple output (MIMO) system that mixes a number of underlying signals of interest called sources. They also consider the case of direct estimation of the inverse system for the purpose of source separation. They then describe the estimation theory associated with the identifiability conditions and dedicated algebraic algorithms. The algorithms depend critically on (statistical and/or time frequency) properties of complex sources that will be precisely described.

Table of Contents:
Preface ix Acknowledgments xi Chapter 1. Mathematical Preliminaries 1 1.1. Introduction 1 1.2. Linear mixing model 1 1.3. Problem definition 3 1.4. Statistics 4 1.4.1. Statistics of random variables and random vectors 4 1.4.2. Differential entropy of complex random vectors 7 1.4.3. Statistics of random processes 7 1.4.4. Complex matrix decompositions 11 1.5. Optimization: Wirtinger calculus 13 1.5.1. Scalar case 14 1.5.2. Vector case 18 1.5.3. Matrix case 23 1.5.4. Summary 25 Chapter 2. Estimation By Joint Diagonalization 27 2.1. Introduction 27 2.2. Normalization, dimension reduction and whitening 27 2.2.1. Dimension reduction 28 2.2.2. Whitening 30 2.3. Exact joint diagonalization of two matrices 31 2.3.1. After the whitening stage 31 2.3.2. Without explicit whitening 33 2.4. Unitary approximate joint diagonalization 35 2.4.1. Considered problem 35 2.4.2. The 2 × 2 Hermitian case 38 2.4.3. The 2 × 2 complex symmetric case 40 2.5. General approximate joint diagonalization 42 2.5.1. Considered problem 42 2.5.2. A relative gradient algorithm 44 2.6. Summary 45 Chapter 3. Maximum Likelihood ICA 47 3.1. Introduction 47 3.2. Cost function choice 48 3.2.1. Mutual information and mutual information rate minimization 49 3.2.2. Maximum likelihood 52 3.2.3. Identifiability of the complex ICA model 53 3.3. Algorithms 57 3.3.1. ML ICA: unconstrained W 57 3.3.2. Complex maximization of non-Gaussianity: ML ICA with unitary W 63 3.3.3. Density matching 67 3.3.4. A flexible complex ICA algorithm: Entropy bound minimization 75 3.4. Summary 81 Bibliography 83 Index 93

About the Author :
Eric Moreau is Professor, University of Sud Toulon Var, France. Ms. Tulay Adali is Professor at University of Maryland, Baltimore County, USA.


Best Sellers


Product Details
  • ISBN-13: 9781848214590
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Height: 241 mm
  • No of Pages: 112
  • Returnable: N
  • Weight: 345 gr
  • ISBN-10: 1848214596
  • Publisher Date: 27 Sep 2013
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 15 mm
  • Width: 165 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Blind Identification and Separation of Complex-valued Signals
ISTE Ltd and John Wiley & Sons Inc -
Blind Identification and Separation of Complex-valued Signals
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Blind Identification and Separation of Complex-valued Signals

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!