Algorithm Collections for Digital Signal Processing Applications Using MATLAB
Home > Technology & Engineering > Energy technology & engineering > Electrical engineering > Power generation & distribution > Algorithm Collections for Digital Signal Processing Applications Using MATLAB
Algorithm Collections for Digital Signal Processing Applications Using MATLAB

Algorithm Collections for Digital Signal Processing Applications Using MATLAB


     0     
5
4
3
2
1



International Edition


About the Book

Preface. Acknowledgments. Chapter 1 ARTIFICIAL INTELLIGENCE. 1 Particle Swarm Algorithm. 1-1 How are the values for the variables 'x' and 'y' are updated in every Iteration? 1-2 PSO Algorithm to maximize the function F(X, Y, Z). 1-3 m-Program for PSO Algorithm. 1-4 Program Illustration. 2 Genetic Algorithm. 2-1 Roulette Wheel Selection Rule. 2-2 Example. 2-2-1 m-Program for Genetic Algorithm. 2-2-2 Program Illustration. 2-3 Classification of Genetic Operators. 2-3-1 Simple Crossover. 2-3-2 Heuristic Crossover. 2-3-3 Arith crossover. 3 Simulated Annealing. 3-1 Simulated Annealing algorithm. 3-2 Example. 3-3 m-program for simulated Annealing. 4 Back propagation Neural Network. 4-1 Single Neuron architecture. 4-2 Algorithm. 4-3 Example. 4-4 m-program for training the Artificial Neural Network for the problem proposed in the previous section. 5 Fuzzy Logic Systems. 5-1 Union and Intersection of two fuzzy sets. 5-2 Fuzzy logic systems. 5-2-1 Algorithm. 5-3 Why Fuzzy logic systems? 5-4 Example. 5-5 m-program for the realization of fuzzy logic system for the Specifications given in section 5-4. 6 Ant Colony Optimization. 6-1 Algorithm. 6-2 Example. 6-3 m-program for finding the optimal order using Ant colony technique for the specifications given in the section 6-2. Chapter 2 PROBABILITY AND RANDOM PROCESS. 1 Independent Component Analysis. 1-1 ICA for tow mixed signals. 1-1-1 ICA Algorithm. 1-2 m-program for Independent Component Analysis. 2 Gaussian Mixture Model. 2-1 Expectation-Maximization Algorithm. 2-1-1 Expectation stage. 2-1-2 Maximization stage. 2-2 Example. 2-3 m-program for Gaussian Mixture model. 3 K-means Algorithm for Pattern recognition. 3-1 K-means Algorithm. 3-2 Example. 3-3 m-program for the k-means Algorithm applied for the example given in section 3-2. 4 Fuzzy K-means Algorithm for Pattern recognition. 4-1 Fuzzy k-means Algorithm. 4-2 Example. 4-3 m-program for the Fuzzy k-means algorithm applied for the example given in section 4-2. 5 Mean and Variance Normalization. 5-1 Algorithm. 5-2 Example. 5-3 m-program for Mean and Variance Normalization. Chapter 3 NUMERICAL LINEAR ALGEBRA. 1 Hotelling Transformation. 1-1 Diagonalization of the matrix 'CM'. 1-2 Example. 1-3 m-program for Hotelling Transformation. 2 Eigen Basis. 2-1 Example. 3 Singular Value Decomposition. 3-1 Example. 4 Projection Matrix. 4-1 Projection of the vector 'a' on the vector 'b'. 4-2 Projection of the vector on the plane described by the two columns of the matrix 'X'. 4-2-1 Example 1. 4-2-2 Example 2. 5 Orthonormal Vectors. 5-1 Gram-Schmidt Orthogonalization procedure. 5-2 Example. 5-3 Need for orthonormal basis. 5-4 m-program for Gram-Schmidt Orthogonalization procedure. 6 Computation of the powers of the matrix 'A'. 7 Determination of Kth element in the sequence. 8 Computation of Exponential of the matrix 'A'. 9 Solving Differential equation using Eigen decomposition. 10 Computation of Pseudo Inverse of the matrix 'A'. 11 Computation of Transformation matrices. 11-1 Transformation matrix for Fourier transformation. 11-2 Transformation matrix for Basis co-efficient transformation. 11-3 Transformation matrix for obtaining co-efficient of Eigen basis. 11-4 Transformation matrix for obtaining co-efficient of Wavelet Basis. 12 System stability test using Eigen values. 13 Positive definite matrix test for minimal location of the function f(x1, x2, x3, x4...xn) 14 Wavelet transformation using matrix method. 14-1 Haar Transformation. 14-1-1 Example. 14-1-2 m-program for Haar forward and inverse transformation. 14-2 Daubechies-4 Transformation. 14-2-1 Example. 14-2-2 m-program for Daubechies-4 forward and inverse transformation. Chapter 4 SELECTED APPLICATIONS. 1 Ear Pattern
About the Author: Dr. E.S. Gopi: 7 Years of Professional experience in academia.

Lecturer since April 2005 - National Institute of Technology, Tiruchi-15 (Formerly called as Regional Engineering College, Government of India).

Senior Lecturer: 2001 -April 2005 Sri Venkateswara College of Engineering, Chennai

1999-2001- Sri Muthukumuran Institute of Technology, Chennai

1998-1999 - Raja Rajeswari Engineering College


Best Sellers



Product Details
  • ISBN-13: 9781402064098
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Depth: 13
  • Height: 234 mm
  • No of Pages: 190
  • Series Title: English
  • Weight: 517 gr
  • ISBN-10: 1402064098
  • Publisher Date: 20 Sep 2007
  • Binding: Hardback
  • Edition: 2007 ed.
  • Language: English
  • Returnable: N
  • Spine Width: 13 mm
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Algorithm Collections for Digital Signal Processing Applications Using MATLAB
Springer -
Algorithm Collections for Digital Signal Processing Applications Using MATLAB
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.

Algorithm Collections for Digital Signal Processing Applications Using MATLAB

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!