{"id":2177,"date":"2019-11-20T04:23:00","date_gmt":"2019-11-20T04:23:00","guid":{"rendered":"https:\/\/bvcoend.ac.in\/?page_id=2177"},"modified":"2019-11-20T04:24:09","modified_gmt":"2019-11-20T04:24:09","slug":"digital-signal-processing-lab-c-102","status":"publish","type":"page","link":"https:\/\/bvcoend.ac.in\/index.php\/digital-signal-processing-lab-c-102\/","title":{"rendered":"DIGITAL SIGNAL PROCESSING LAB (C-102)"},"content":{"rendered":"[vc_row][vc_column width=”1\/4″][vc_wp_custommenu title=”Imp Links” nav_menu=”66″][\/vc_column][vc_column width=”3\/4″][vc_column_text]\n

DIGITAL SIGNAL PROCESSING\u00a0LAB (C-102)\u00a0<\/strong><\/span><\/span><\/h2>\n

Lab Incharge :\u00a0\u00a0Ms Sarita Yadav<\/strong><\/span><\/p>\n

Lab Attendant:\u00a0\u00a0Ms Savita Dutonde<\/strong><\/span><\/p>\n

Digital signal processing (DSP) is concerned with the representation of signals as a sequence of numbers and the algorithmic operations carried out on the signals to extract specific information contained in them. In barely 40 years the field of digital signal processing has matured considerably due to the phenomenal growth in both research and applications, and almost every university is now offering at least one or more courses at the upper division and\/or first-year graduate level on this subject. With the increasing availability of powerful personal computers and workstations at affordable prices, it has become easier to provide the student with a practical environment to verify the concepts and the algorithms learned in a lecture course.<\/span><\/p>\n

Software Installed: C, C++, MATLAB<\/span><\/p>\n

Hardware:\u00a0Texas Instruments Kits-DSK 6713, CRO<\/strong><\/span><\/p>\n

DIGITAL SIGNAL PROCESSING LAB<\/strong><\/span><\/p>\n

\n
\n
\n

Software Experiments:\u00a0<\/strong><\/span><\/p>\n<\/div>\n<\/div>\n

\n
\n
    \n
  1. Generation of basic signals sine, cosine, ramp, step, impulse and exponential in continuous and discrete domains using user defined functions.\u00a0<\/span><\/li>\n
  2. Write a MATLAB program to find convolution (linear\/circular) and correlation of two discrete signals.\u00a0<\/span><\/li>\n
  3. Perform linear convolution using circular convolution and vice versa.\u00a0<\/span><\/li>\n
  4. Write a MA TLAB program to\u00a0<\/span>\n
      \n
    1. Find 8 point DFT, its magnitude and phase plot and inverse DFT.\u00a0<\/span><\/li>\n
    2. Find 16 point DFT, its magnitude and phase plot and inverse DFT.\u00a0<\/span><\/li>\n<\/ol>\n<\/li>\n
    3. Perform the following properties of DFT-\u00a0<\/span>\n
        \n
      1. Circular shift of a sequence.\u00a0<\/span><\/li>\n
      2. Circular fold of a sequence.\u00a0<\/span><\/li>\n<\/ol>\n<\/li>\n
      3. Write a MATLAB Program to design FIR Low pass filter using\u00a0<\/span>\n
          \n
        1. Rectangular window\u00a0<\/span><\/li>\n
        2. Hanning window\u00a0<\/span><\/li>\n
        3. Hamming window\u00a0<\/span><\/li>\n
        4. Bartlett window\u00a0<\/span><\/li>\n<\/ol>\n<\/li>\n
        5. Write a MA TLAB program to\u00a0<\/span>\n
            \n
          1. Implement a Low pass \/ High pass \/ Band pass \/ Band stop IIR Filter using\u00a0<\/span>Butterworth Approximation.\u00a0<\/span><\/li>\n
          2. Implement a Low pass \/ High pass \/ Band pass \/ Band stop IIR Filter using\u00a0<\/span>Chebyshev Approximation.\u00a0<\/span><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n

            Hardware Experiments using Texas Instruments Kits-DSK 6713:\u00a0<\/strong><\/span><\/p>\n

              \n
            1. Introduction to Code composer Studio.\u00a0<\/span><\/li>\n
            2. Write a program to generate a sine wave and see the output on CRO\u00a0<\/span><\/li>\n
            3. Write a Program to Generate ECHO to give audio file.\u00a0<\/span><\/li>\n
            4. Write a program to demonstrate Band Stop filter by FIR.\u00a0<\/span><\/li>\n<\/ol>\n

              Additional Experiments:\u00a0<\/strong><\/span><\/p>\n

              12.\u00a0Write a program to generate a cos wave and see the output on CRO\u00a013.\u00a0Write a program to blink the LED<\/span>
              \n14.\u00a0Write a program to display a string on LCD.\u00a0<\/span><\/p>\n

              Text Books:\u00a0<\/strong><\/span><\/p>\n

              [T1] Oppenheim & Schafer, Digital Signal Processing, PHI-latest edition.\u00a0<\/span><\/p>\n

              [T2] Proakis and Manolakis, Digital Signal Processing, PHI Publication\u00a0<\/span><\/p>\n

              Reference Books:\u00a0<\/strong><\/span><\/p>\n

              [R1] S. K. Mitra, Digital Signal Processing, TMH edition 2006\u00a0<\/span><\/p>\n

              [R2] Johny. R. Johnson, Introduction to Digital Signal Processing, PHI-latest edition<\/span><\/p>\n

              ALGORITHMS DESIGN AND ANALYSIS LAB<\/strong><\/span><\/p>\n

                \n
              1. \n

                To implement following algorithm using array as a data structure and analyse its time complexity.<\/span><\/p>\n<\/li>\n<\/ol>\n

                  \n
                • Bubble sort<\/span><\/li>\n
                • Insertion sort<\/span><\/li>\n
                • Selection sort Bucket sort e. Radix sort f. Shell sort g. Selection sort h. Heap sort\u00a0<\/span><\/li>\n<\/ul>\n

                  \u00a0 \u00a0 \u00a02. \u00a0To implement following algorithm using divide and conquer strategy.<\/span><\/p>\n

                    \n
                  • \n

                    Merge sort\u00a0<\/span><\/p>\n<\/li>\n

                  • \n

                    Quick sort<\/span><\/p>\n<\/li>\n<\/ul>\n

                      \n
                    1. \n

                      To implement following algorithm using divide and conquer strategy.<\/span><\/p>\n<\/li>\n<\/ol>\n

                        \n
                      • \n

                        Heap sort<\/span><\/p>\n<\/li>\n

                      • \n

                        Bucket sort<\/span><\/p>\n<\/li>\n

                      • \n

                        Radix sort\u00a0<\/span><\/p>\n<\/li>\n<\/ul>\n

                          \n
                        1. \n

                          To implement strassen\u2019s matrix multiplication using divide and conquer strategy.<\/span><\/p>\n<\/li>\n

                        2. \n

                          To implement Matrix Multiplication and analyse its time complexity.<\/span><\/p>\n<\/li>\n

                        3. \n

                          To implement Longest Common Subsequence problem and analyse its time complexity.\u00a0<\/span><\/p>\n<\/li>\n

                        4. \n

                          To implement Optimal Binary Search Tree problem and analyse its time complexity.\u00a0<\/span><\/p>\n<\/li>\n

                        5. \n

                          To implement Huffman Coding and analyse its time complexity.\u00a0<\/span><\/p>\n<\/li>\n

                        6. \n

                          To implement Prim\u2019s and Kruskal\u2019s algorithm for MST.<\/span><\/p>\n<\/li>\n

                        7. \n

                          To implement Dijkstra\u201fs algorithm and analyse its time complexity.<\/span><\/p>\n<\/li>\n

                        8. \n

                          To implement na\u00efve String Matching algorithm, Rabin Karp algorithm and Knuth Morris Pratt algorithm and analyse its time complexity<\/span><\/p>\n<\/li>\n<\/ol>\n

                          Suggested Books:<\/strong><\/span><\/p>\n

                            \n
                          • \n

                            T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, \u201cIntroduction to Algorithms\u201d, 3rd Ed., PHI, 2013.\u00a0<\/span><\/p>\n<\/li>\n

                          • \n

                            Jon Klenberg,Eva Tardos,\u201dAlgorithm Design\u201d, Pearson Publications,2014<\/span><\/p>\n<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<\/div>\n[\/vc_column_text][\/vc_column][\/vc_row]\n","protected":false},"excerpt":{"rendered":"

                            [vc_row][vc_column width=”1\/4″][vc_wp_custommenu title=”Imp Links” nav_menu=”66″][\/vc_column][vc_column width=”3\/4″][vc_column_text] DIGITAL SIGNAL PROCESSING\u00a0LAB (C-102)\u00a0 Lab Incharge :\u00a0\u00a0Ms Sarita Yadav Lab Attendant:\u00a0\u00a0Ms Savita Dutonde Digital signal processing (DSP) is concerned with the representation of signals as a sequence of numbers and the algorithmic operations carried out on the signals to extract specific information contained in them. In barely 40 years…<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2177"}],"collection":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/comments?post=2177"}],"version-history":[{"count":2,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2177\/revisions"}],"predecessor-version":[{"id":2179,"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/pages\/2177\/revisions\/2179"}],"wp:attachment":[{"href":"https:\/\/bvcoend.ac.in\/index.php\/wp-json\/wp\/v2\/media?parent=2177"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}