complex multiplier in divide and combine FFT












1












$begingroup$


I am studying radix 2 algorith from Proakis' book.



But I'm a bit confusied why 1st DFT $G_1$ is not multiplied by complex entity while 2nd DFT $G_2$ is being multiplied by complex entity $W$ as shown highlighted in attached figure.



enter image description here










share|improve this question











$endgroup$








  • 1




    $begingroup$
    Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
    $endgroup$
    – Fat32
    Dec 2 '18 at 17:48
















1












$begingroup$


I am studying radix 2 algorith from Proakis' book.



But I'm a bit confusied why 1st DFT $G_1$ is not multiplied by complex entity while 2nd DFT $G_2$ is being multiplied by complex entity $W$ as shown highlighted in attached figure.



enter image description here










share|improve this question











$endgroup$








  • 1




    $begingroup$
    Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
    $endgroup$
    – Fat32
    Dec 2 '18 at 17:48














1












1








1





$begingroup$


I am studying radix 2 algorith from Proakis' book.



But I'm a bit confusied why 1st DFT $G_1$ is not multiplied by complex entity while 2nd DFT $G_2$ is being multiplied by complex entity $W$ as shown highlighted in attached figure.



enter image description here










share|improve this question











$endgroup$




I am studying radix 2 algorith from Proakis' book.



But I'm a bit confusied why 1st DFT $G_1$ is not multiplied by complex entity while 2nd DFT $G_2$ is being multiplied by complex entity $W$ as shown highlighted in attached figure.



enter image description here







fft complex






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Dec 2 '18 at 19:05









Marcus Müller

11.8k41531




11.8k41531










asked Dec 2 '18 at 17:32









studentstudent

314




314








  • 1




    $begingroup$
    Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
    $endgroup$
    – Fat32
    Dec 2 '18 at 17:48














  • 1




    $begingroup$
    Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
    $endgroup$
    – Fat32
    Dec 2 '18 at 17:48








1




1




$begingroup$
Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
$endgroup$
– Fat32
Dec 2 '18 at 17:48




$begingroup$
Hi! Have you tried wiriting the DFT of x[n] by dividing it into even and odd sampled sequences g1[n] and g2[n] ? The weight will come from that DFT.
$endgroup$
– Fat32
Dec 2 '18 at 17:48










1 Answer
1






active

oldest

votes


















3












$begingroup$

Now as the document says, let $x[n]$ be a length $N$ (even) sequence whose even and odd indexed samples are denoted as $g_1[n]$ and $g_2[n]$ of length $N/2$ each.



Then the $N$-point DFT $X[k]$ of $x[n]$ can be written as folows:



$$begin{align}
X[k] &= sum_{n=0}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} ~~~,~~ k = 0,1,...,N-1 \\
&= sum_{n=0,2,4}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} + sum_{n=1,3,5}^{N-1} x[n] e^{ -j frac{2pi}{N} n k}\\
&= sum_{m=0}^{N/2-1} x[2m] e^{ -j frac{2pi}{N} 2m k} + sum_{m=0}^{N/2-1} x[2m+1] e^{ -j frac{2pi}{N} (2m+1) k}\\
&= sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} + e^{ -j frac{2pi}{N} k} sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} \\
&= left( sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} right) + e^{ -j frac{2pi}{N} k} left( sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} right) \\
&= G_1[k] + W_N^k G_2[k] ~~~,~~ k = 0,1,2...,N-1 \
end{align}$$



Where we have recognized the summations inside the parenthesis as the $N/2$ point DFTs of the sequences $g_1[n]$ and $g_2[n]$ respectively. Note that when $k$ spans the range $k=0,1,...,N-1$, the $N/2$ point DFTs will repeat twice.






share|improve this answer











$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "295"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdsp.stackexchange.com%2fquestions%2f53855%2fcomplex-multiplier-in-divide-and-combine-fft%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    3












    $begingroup$

    Now as the document says, let $x[n]$ be a length $N$ (even) sequence whose even and odd indexed samples are denoted as $g_1[n]$ and $g_2[n]$ of length $N/2$ each.



    Then the $N$-point DFT $X[k]$ of $x[n]$ can be written as folows:



    $$begin{align}
    X[k] &= sum_{n=0}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} ~~~,~~ k = 0,1,...,N-1 \\
    &= sum_{n=0,2,4}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} + sum_{n=1,3,5}^{N-1} x[n] e^{ -j frac{2pi}{N} n k}\\
    &= sum_{m=0}^{N/2-1} x[2m] e^{ -j frac{2pi}{N} 2m k} + sum_{m=0}^{N/2-1} x[2m+1] e^{ -j frac{2pi}{N} (2m+1) k}\\
    &= sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} + e^{ -j frac{2pi}{N} k} sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} \\
    &= left( sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} right) + e^{ -j frac{2pi}{N} k} left( sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} right) \\
    &= G_1[k] + W_N^k G_2[k] ~~~,~~ k = 0,1,2...,N-1 \
    end{align}$$



    Where we have recognized the summations inside the parenthesis as the $N/2$ point DFTs of the sequences $g_1[n]$ and $g_2[n]$ respectively. Note that when $k$ spans the range $k=0,1,...,N-1$, the $N/2$ point DFTs will repeat twice.






    share|improve this answer











    $endgroup$


















      3












      $begingroup$

      Now as the document says, let $x[n]$ be a length $N$ (even) sequence whose even and odd indexed samples are denoted as $g_1[n]$ and $g_2[n]$ of length $N/2$ each.



      Then the $N$-point DFT $X[k]$ of $x[n]$ can be written as folows:



      $$begin{align}
      X[k] &= sum_{n=0}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} ~~~,~~ k = 0,1,...,N-1 \\
      &= sum_{n=0,2,4}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} + sum_{n=1,3,5}^{N-1} x[n] e^{ -j frac{2pi}{N} n k}\\
      &= sum_{m=0}^{N/2-1} x[2m] e^{ -j frac{2pi}{N} 2m k} + sum_{m=0}^{N/2-1} x[2m+1] e^{ -j frac{2pi}{N} (2m+1) k}\\
      &= sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} + e^{ -j frac{2pi}{N} k} sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} \\
      &= left( sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} right) + e^{ -j frac{2pi}{N} k} left( sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} right) \\
      &= G_1[k] + W_N^k G_2[k] ~~~,~~ k = 0,1,2...,N-1 \
      end{align}$$



      Where we have recognized the summations inside the parenthesis as the $N/2$ point DFTs of the sequences $g_1[n]$ and $g_2[n]$ respectively. Note that when $k$ spans the range $k=0,1,...,N-1$, the $N/2$ point DFTs will repeat twice.






      share|improve this answer











      $endgroup$
















        3












        3








        3





        $begingroup$

        Now as the document says, let $x[n]$ be a length $N$ (even) sequence whose even and odd indexed samples are denoted as $g_1[n]$ and $g_2[n]$ of length $N/2$ each.



        Then the $N$-point DFT $X[k]$ of $x[n]$ can be written as folows:



        $$begin{align}
        X[k] &= sum_{n=0}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} ~~~,~~ k = 0,1,...,N-1 \\
        &= sum_{n=0,2,4}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} + sum_{n=1,3,5}^{N-1} x[n] e^{ -j frac{2pi}{N} n k}\\
        &= sum_{m=0}^{N/2-1} x[2m] e^{ -j frac{2pi}{N} 2m k} + sum_{m=0}^{N/2-1} x[2m+1] e^{ -j frac{2pi}{N} (2m+1) k}\\
        &= sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} + e^{ -j frac{2pi}{N} k} sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} \\
        &= left( sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} right) + e^{ -j frac{2pi}{N} k} left( sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} right) \\
        &= G_1[k] + W_N^k G_2[k] ~~~,~~ k = 0,1,2...,N-1 \
        end{align}$$



        Where we have recognized the summations inside the parenthesis as the $N/2$ point DFTs of the sequences $g_1[n]$ and $g_2[n]$ respectively. Note that when $k$ spans the range $k=0,1,...,N-1$, the $N/2$ point DFTs will repeat twice.






        share|improve this answer











        $endgroup$



        Now as the document says, let $x[n]$ be a length $N$ (even) sequence whose even and odd indexed samples are denoted as $g_1[n]$ and $g_2[n]$ of length $N/2$ each.



        Then the $N$-point DFT $X[k]$ of $x[n]$ can be written as folows:



        $$begin{align}
        X[k] &= sum_{n=0}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} ~~~,~~ k = 0,1,...,N-1 \\
        &= sum_{n=0,2,4}^{N-1} x[n] e^{ -j frac{2pi}{N} n k} + sum_{n=1,3,5}^{N-1} x[n] e^{ -j frac{2pi}{N} n k}\\
        &= sum_{m=0}^{N/2-1} x[2m] e^{ -j frac{2pi}{N} 2m k} + sum_{m=0}^{N/2-1} x[2m+1] e^{ -j frac{2pi}{N} (2m+1) k}\\
        &= sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} + e^{ -j frac{2pi}{N} k} sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} \\
        &= left( sum_{m=0}^{N/2-1} g_1[m] e^{ -j frac{2pi}{N/2} m k} right) + e^{ -j frac{2pi}{N} k} left( sum_{m=1}^{N/2-1} g_2[m] e^{ -j frac{2pi}{N/2} m k} right) \\
        &= G_1[k] + W_N^k G_2[k] ~~~,~~ k = 0,1,2...,N-1 \
        end{align}$$



        Where we have recognized the summations inside the parenthesis as the $N/2$ point DFTs of the sequences $g_1[n]$ and $g_2[n]$ respectively. Note that when $k$ spans the range $k=0,1,...,N-1$, the $N/2$ point DFTs will repeat twice.







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Dec 2 '18 at 18:14

























        answered Dec 2 '18 at 18:07









        Fat32Fat32

        14.8k31229




        14.8k31229






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Signal Processing Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdsp.stackexchange.com%2fquestions%2f53855%2fcomplex-multiplier-in-divide-and-combine-fft%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Plaza Victoria

            Puebla de Zaragoza

            Musa