Preview

Joke

Satisfactory Essays
Open Document
Open Document
462 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Joke
CS2403 DIGITAL SIGNAL PROCESSING

UNIT I SIGNALS AND SYSTEMS

Basic elements of DSP – concepts of frequency in Analog and Digital Signals – sampling theorem – Discrete – time signals, systems – Analysis of discrete time LTI systems – Z transform – Convolution (linear and circular) – Correlation.

UNIT II FREQUENCY TRANSFORMATIONS

Introduction to DFT – Properties of DFT – Filtering methods based on DFT – FFT Algorithms Decimation – in – time Algorithms, Decimation – in – frequency Algorithms – Use of FFT in Linear Filtering – DCT.

UNIT III IIR FILTER DESIGN

Structures of IIR – Analog filter design – Discrete time IIR filter from analog filter – IIR filter design by Impulse Invariance, Bilinear transformation, Approximation of derivatives – (HPF, BPF, BRF) filter design using frequency translation

UNIT IV FIR FILTER DESIGN

Structures of FIR – Linear phase FIR filter – Filter design using windowing techniques, Frequency sampling techniques – Finite word length effects in digital Filters

UNIT V APPLICATIONS

Multirate signal processing – Speech compression – Adaptive filter – Musical sound processing – Image enhancement.

TEXT BOOKS:
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fourth edition, Pearson education / Prentice Hall, 2007.
2. Emmanuel C..Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second edition, Pearson Education / Prentice Hall, 2002.

REFERENCES:
1. Alan V.Oppenheim, Ronald W. Schafer & Hohn. R.Back, “Discrete Time Signal Processing”, Pearson Education, 2nd edition, 2005.
2. Andreas Antoniou, “Digital Signal Processing”, Tata McGraw Hill, 2001

IT2303 INFORMATION THEORY AND CODING 3 0 0 3

UNIT I INFORMATION THEORY 9
Information – Entropy, Information rate, classification of codes, Kraft McMillan inequality, Source coding theorem, Shannon-Fano coding, Huffman coding, Extended Huffman coding - Joint



References: K Sayood, “Introduction to Data Compression” 3/e, Elsevier 2006 S Gravano, “Introduction to Error Control Codes”, Oxford University Press 2007 Amitabha Bhattacharya, “Digital Communication”, TMH 2006

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Cited: Solomon, M., & Kim, D. (2013). Fundamentals of Communications and Networking. Burlington: Jones & Bartlett Learning.…

    • 304 Words
    • 1 Page
    Satisfactory Essays
  • Powerful Essays

    Technical Paper

    • 2659 Words
    • 9 Pages

    Shelly, G., & Rosenblatt, H. J. (2011). Systems Analysis and Design, Ninth Edition. Cengage Learning.…

    • 2659 Words
    • 9 Pages
    Powerful Essays
  • Satisfactory Essays

    NT1110

    • 315 Words
    • 2 Pages

    Chapter two discusses the understanding of computer, math, and measurements. Also, it shows you how we use computer math with computer hardware and systems. Some of these concepts are bits versus bytes, binary versus decimal, Boolean operators, hertz, and data transfer. The chapter two also shows numbering systems used in computers. These are some importance skills that will help you in the computer field.…

    • 315 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    SOCS1010

    • 11828 Words
    • 74 Pages

    The textbook will be used extensively in this course; it will also be a helpful resource in your…

    • 11828 Words
    • 74 Pages
    Satisfactory Essays
  • Powerful Essays

    Aboriginal Customary Law

    • 1594 Words
    • 7 Pages

    This textbook was an excellent source of the various bits of small but crucial information…

    • 1594 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    References: The Fundamentals, by Burk Foster. Published by Prentice-Hall. Copyright © 2006 by Pearson Education, Inc.…

    • 328 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Abstract In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that filters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozda˘i. Digital computation of the fractional Fourier transform. g IEEE Trans. Signal Process., 44:2141–2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O’Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C. Candan. The discrete fractional Fourier transform, ¸ Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform based on orthogonal projections IEEE Trans. Signal Process., 47:1335–1348, 1999. Key words: Fractional Fourier transform…

    • 9669 Words
    • 39 Pages
    Powerful Essays
  • Good Essays

    A signal can be defined as detectable transmitted energy that can be used to carry information. Put in another way, a signal is a time-dependent variation of a characteristic of a physical phenomenon, used to convey information. For example, a signal could be the current flowing through a light dependent resistor (LDR), giving information about the amount of illumination in the LDR's environment. Another signal could be the colour of a methyl orange solution indicating the pH of the solution. Signals discussed in this course will be restricted simply to voltage signals and current signals. Hence, in this course, a signal will be either a voltage or a current.…

    • 3668 Words
    • 15 Pages
    Good Essays
  • Good Essays

    References: [1] Aniansson J. et al, Fouriermetoder, KTH, Stockholm, 1989. [2] Goldberg R. R., Fourier transforms, Cambrige university press, Cambridge. [3] Hahn Stefan L., Hilbert transforms in signal processing, Artech House, Inc., Boston, 1996. [4] Lennart HellstrÄm, LinjÄr analys, HÄgskolan i VÄxjÄ, 1995. o a o a o [5] Henrici Peter, Applied and computational complex analysis, Volume 1, John Wiley & Sons, Inc., New York, 1988. [6] Proakis John G., Salehi Masoud, Communication systems engineering, Prentice-Hall, Inc., New Jersey, 1994. [7] Sa® E. B., Snider A. D., Complex analysis for mathematics, sience and enginering, Prentice-Hall, Inc., New York, 1976.…

    • 1920 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    Fast Fourier Transform

    • 2163 Words
    • 9 Pages

    In 1965, Cooley and Turkey were two persons who discussed the FFT (Fast Fourier Transform) for the first time in history. In past years, researchers believed that a discrete Fourier transform can also be calculated and classified as FFT by using the Danielson-Lanczos lemma theorem. By using this theorem, this process is slower than other, as it is slightly tainted in speed due to the power of N (exponent of N) are not 2. Therefore, if the number of points i.e. N is not a power of two, then the transform will only gives you the sets of points matching to the prime factors of N [1]. FFT (Fast Fourier Transform) is a type of algorithm commonly known as discrete Fourier transform algorithm. This algorithm has much significance in the reduction of number of computations that governs for N points from the arithmetic expressions i.e. 2N2 to (2N log2 N), in this expression the ‘N’ is the number of computations and log2 is the logarithm having base 2. In Fourier analysis, if the above function is about to be transferred, not harmonically associated with the sampling frequency, then at this point, the reaction for this FFT behaves just like a sinc function i.e. commonly known as the sampling function, defined as a function used to rise the frequency in the signal processing and propagation, classified as Fourier transforms[4] . However, the other components such as integrated power and aliasing have different variations as the integrated power still gives you the correct values but aliasing can be reduced by using apodization function. This aliasing reduction will be spent for the expansion of the spectral response [1].…

    • 2163 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    Bibliography: 1. Floyd, Thomas L. , 2006, Digital Fundamentals: Ninth Edition, New Jersey, USA, Pearson Prentice Hall…

    • 3471 Words
    • 14 Pages
    Powerful Essays
  • Better Essays

    [2] C. Sidney Burrus, Ramesh A. Gopinath, Haitato, "Introduction to Wavelets and Wavelet Transforms, Aprimer," Prentice-Hall, New Jersey, 1998.…

    • 1255 Words
    • 6 Pages
    Better Essays
  • Satisfactory Essays

    Filter circuits are used in a wide variety of applications. In the field of telecommunication,…

    • 13782 Words
    • 56 Pages
    Satisfactory Essays
  • Satisfactory Essays

    [2] “The 8051 microcontroller & embedded systems” – 2nd edition by Muhammad Ali Mazidi,Jamice Gillespie, Robin.D.Mckinle…

    • 591 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    signals. This scenario is very inefficient, since most of the signals generated by the human voice are small. Voice quality needs to focus on small signals. To solve this problem, adaptive DPCM is developed.…

    • 951 Words
    • 4 Pages
    Good Essays