complex multiplier in divide and combine FFT












1














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




















  • 1




    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.
    – Fat32
    Dec 2 '18 at 17:48
















1














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




















  • 1




    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.
    – Fat32
    Dec 2 '18 at 17:48














1












1








1







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















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




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.6k41431




11.6k41431










asked Dec 2 '18 at 17:32









student

314




314








  • 1




    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.
    – Fat32
    Dec 2 '18 at 17:48














  • 1




    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.
    – Fat32
    Dec 2 '18 at 17:48








1




1




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.
– Fat32
Dec 2 '18 at 17:48




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.
– Fat32
Dec 2 '18 at 17:48










1 Answer
1






active

oldest

votes


















3














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























    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














    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




























      3














      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


























        3












        3








        3






        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














        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









        Fat32

        14.3k31129




        14.3k31129






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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

            QoS: MAC-Priority for clients behind a repeater

            Image
            1 1 I've setup a wireless network using a Linksys-Router (DD-WRT) as an AP and a TP-Link repeater for range extension. To manage bandwith for specific users, I've setup QoS-Rules on the AP (DD-WRT) using MAC-Priority: However the AP shows only the Repeater's MAC and the MACs of users inside the AP-Range. The MAC addresses of users behind the Repeater are not listed : The purple MAC is not listed in the AP-Clientlist. Its related to a device connected via the TP-Link repeater. Q: How can I setup MAC-Priority for repeater-clients? Do I simply add the purple MAC in AP-MAC priority list although it's not listed as a client? I want to setup specific priority instead of giving one priority for all clients behind the repeater by adding the repeater's MAC in the MAC priority list in the AP as
            Read more

            Ивакино (Тотемский район)

            Image
            У этого топонима есть и другие значения, см. Ивакино. Деревня Ивакино 59°42′01″ с. ш. 42°01′36″ в. д. H G Я O Страна Россия   Россия Субъект Федерации Вологодская область Муниципальный район Тотемский район Сельское поселение Погореловское История и география Тип климата умеренно-континентальный Часовой пояс UTC+3 Население Население 33 человека ( 2002 ) Национальности русские Цифровые идентификаторы Почтовый индекс 161327 Код ОКАТО 19 246 848 008 Код ОКТМО 19 646 448 136 Прочее Рег. номер 6261 Показать/скрыть карты Ивакино Ивакино Ивакино Ивакино — деревня в Тотемском районе Вологодской области. Входит в состав Погореловского сельского поселения [1] , с точки зрения административно-территориального деления — в Погореловский сельсовет. Расстояние по автодороге до районного центра Тотьмы — 61,5 км, до центра муниципального образования деревни Погорелово — 1,5 км.
            Read more

            Can't locate Autom4te/ChannelDefs.pm in @INC (when it definitely is there)

            Image
            up vote 1 down vote favorite I've been running into trouble running make for a build process that I know works on a 32-bit Ubuntu VM. I am running a 64-bit Ubuntu VM, and I have a feeling that the 64-bit may be the problem, but am not entirely sure. Basically, when I run the make command, I get the following error: Can't locate Autom4te/ChannelDefs.pm in @INC (@INC contains: [...]/staging_dir/host/share/autoconf /etc/perl /usr/local/lib/perl/5.14.2 /usr/local/share/perl/5.14.2 /usr/lib/perl5 /usr/share/perl5 /usr/lib/perl/5.14 /usr/share/perl/5.14 /usr/local/lib/site_perl .) at [...]/staging_dir/host/bin/autoreconf line 40. Now if I navigate to [...]/staging_dir/host/share/autoconf I can see that, contrary to what autoreconf thinks, Autom4te/ChannelDefs.pm definitely exists, so I don't really understand what
            Read more