URL https://opencores.org/ocsvn/dblclockfft/dblclockfft/trunk

Subversion Repositories dblclockfft

[/] [dblclockfft/] [trunk/] [bench/] [cpp/] [fft_tb.cpp] - Blame information for rev 14

Go to most recent revision | Details | Compare with Previous | View Log


//
// Filename:    fft_tb.cpp
//
// Project:     A Doubletime Pipelined FFT
//
// Purpose:     A test-bench for the main program, fftmain.v, of the double
//              clocked FFT.  This file may be run autonomously  (when
//              fully functional).  If so, the last line output will either
//              read "SUCCESS" on success, or some other failure message
//              otherwise.
//
//              This file depends upon verilator to both compile, run, and
//              therefore test fftmain.v
//
// Creator:     Dan Gisselquist, Ph.D.
//              Gisselquist Tecnology, LLC
//
///////////////////////////////////////////////////////////////////////////
//
// Copyright (C) 2015, Gisselquist Technology, LLC
//
// This program is free software (firmware): you can redistribute it and/or
// modify it under the terms of  the GNU General Public License as published
// by the Free Software Foundation, either version 3 of the License, or (at
// your option) any later version.
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or
// FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
// for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program.  (It's in the $(ROOT)/doc directory, run make with no
// target there if the PDF file isn't present.)  If not, see
// <http://www.gnu.org/licenses/> for a copy.
//
// License:     GPL, v3, as defined and found on www.gnu.org,
//              http://www.gnu.org/licenses/gpl.html
//
//
///////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <math.h>
#include <fftw3.h>
 
#include "verilated.h"
#include "Vfftmain.h"
 
#define LGWIDTH 11
#define IWIDTH  16
#define OWIDTH  22
 
#define FFTLEN  (1<<LGWIDTH)
 
class   FFT_TB {
public:
        Vfftmain        *m_fft;
        long            m_data[FFTLEN], m_log[4*FFTLEN];
        int             m_iaddr, m_oaddr, m_ntest;
        FILE            *m_dumpfp;
        fftw_plan       m_plan;
        double          *m_fft_buf;
        bool            m_syncd;
 
        FFT_TB(void) {
                m_fft = new Vfftmain;
                m_iaddr = m_oaddr = 0;
                m_dumpfp = NULL;
 
                m_fft_buf = (double *)fftw_malloc(sizeof(fftw_complex)*(FFTLEN));
                m_plan = fftw_plan_dft_1d(FFTLEN, (fftw_complex *)m_fft_buf,
                                (fftw_complex *)m_fft_buf,
                                FFTW_FORWARD, FFTW_MEASURE);
                m_syncd = false;
                m_ntest = 0;
        }
 
        void    tick(void) {
                m_fft->i_clk = 0;
                m_fft->eval();
                m_fft->i_clk = 1;
                m_fft->eval();
        }
 
        void    reset(void) {
                m_fft->i_ce  = 0;
                m_fft->i_rst = 1;
                tick();
                m_fft->i_rst = 0;
                tick();
 
                m_iaddr = m_oaddr = 0;
                m_syncd = false;
        }
 
        long    twos_complement(const long val, const int bits) {
                long    r;
 
                r = val & ((1l<<bits)-1);
                if (r & (1l << (bits-1)))
                        r |= (-1l << bits);
                return r;
        }
 
        void    checkresults(void) {
                double  *dp, *sp; // Complex array
                double  vout[FFTLEN*2];
                double  isq=0.0, osq = 0.0;
                long    *lp;
 
                // Fill up our test array from the log array
                printf("%3d : CHECK: %8d %5x\n", m_ntest, m_iaddr, m_iaddr);
                dp = m_fft_buf; lp = &m_log[(m_iaddr-FFTLEN*3)&((4*FFTLEN-1)&(-FFTLEN))];
                for(int i=0; i<FFTLEN; i++) {
                        long    tv = *lp++;
 
                        dp[0] = twos_complement(tv >> IWIDTH, IWIDTH);
                        dp[1] = twos_complement(tv, IWIDTH);
 
                        printf("IN[%4d = %4x] = %9.1f %9.1f\n",
                                i+((m_iaddr-FFTLEN*3)&((4*FFTLEN-1)&(-FFTLEN))),
                                i+((m_iaddr-FFTLEN*3)&((4*FFTLEN-1)&(-FFTLEN))),
                                dp[0], dp[1]);
                        dp += 2;
                }
 
                // Let's measure ... are we the zero vector?  If not, how close?
                dp = m_fft_buf;
                for(int i=0; i<FFTLEN; i++)
                        isq += (*dp) * (*dp);
 
                fftw_execute(m_plan);
 
                // Let's load up the output we received into vout
                dp = vout;
                for(int i=0; i<FFTLEN; i++) {
                        long    tv = m_data[i];
 
                        printf("OUT[%4d = %4x] = ", i, i);
                        printf("%12lx = ", tv);
                        *dp = twos_complement(tv >> OWIDTH, OWIDTH);
                        printf("%10.1f + ", *dp);
                        osq += (*dp) * (*dp); dp++;
                        *dp = twos_complement(tv, OWIDTH);
                        printf("%10.1f j", *dp);
                        osq += (*dp) * (*dp); dp++;
                        printf(" <-> %12.1f %12.1f\n", m_fft_buf[2*i], m_fft_buf[2*i+1]);
                }
 
 
                // Let's figure out if there's a scale factor difference ...
                double  scale = 0.0, wt = 0.0;
                sp = m_fft_buf;  dp = vout;
                for(int i=0; i<FFTLEN*2; i++) {
                        scale += (*sp) * (*dp++);
                        wt += (*sp) * (*sp); sp++;
                } scale = scale / wt;
 
                if (wt == 0.0) scale = 1.0;
 
                double xisq = 0.0;
                sp = m_fft_buf;  dp = vout;
                for(int i=0; i<FFTLEN*2; i++) {
                        double vl = (*sp++) * scale - (*dp++);
                        xisq += vl * vl;
                }
 
                printf("%3d : SCALE = %12.6f, WT = %18.1f, ISQ = %15.1f, ",
                        m_ntest, scale, wt, isq);
                printf("OSQ = %18.1f, ", osq);
                printf("XISQ = %18.1f\n", xisq);
                m_ntest++;
        }
 
        bool    test(int lft, int rht) {
                m_fft->i_ce    = 1;
                m_fft->i_rst   = 0;
                m_fft->i_left  = lft;
                m_fft->i_right = rht;
 
                m_log[(m_iaddr++)&(4*FFTLEN-1)] = (long)lft;
                m_log[(m_iaddr++)&(4*FFTLEN-1)] = (long)rht;
 
                tick();
 
                if (m_fft->o_sync) {
                        m_oaddr &= (-1<<LGWIDTH);
                        m_syncd = true;
                } else m_oaddr += 2;
 
                printf("%8x,%5d: %08x,%08x -> %011lx,%011lx"
                        // "\t%011lx,%011lx"
                        // "\t%011lx,%011lx"
                        // "\t%06x,%06x"
                        // "\t%06x,%06x"
                        "\t%011lx,%06x,%06x"
                        "\t%011lx,%06x,%06x"
                        " %s%s%s%s%s%s%s%s%s%s %s%s\n",
                        m_iaddr, m_oaddr,
                        lft, rht, m_fft->o_left, m_fft->o_right,
                        // m_fft->v__DOT__stage_e2048__DOT__ib_a,
                        // m_fft->v__DOT__stage_e2048__DOT__ib_b,
                        // m_fft->v__DOT__stage_e512__DOT__ib_a,
                        // m_fft->v__DOT__stage_e512__DOT__ib_b,
                        // m_fft->v__DOT__stage_e256__DOT__ib_a,
                        // m_fft->v__DOT__stage_e256__DOT__ib_b,
                        // m_fft->v__DOT__stage_e128__DOT__ib_a,
                        // m_fft->v__DOT__stage_e128__DOT__ib_b,
                        // m_fft->v__DOT__stage_e64__DOT__ib_a,
                        // m_fft->v__DOT__stage_e64__DOT__ib_b,
                        // m_fft->v__DOT__stage_e32__DOT__ib_a,
                        // m_fft->v__DOT__stage_e32__DOT__ib_b,
                        // m_fft->v__DOT__stage_e16__DOT__ib_a,
                        // m_fft->v__DOT__stage_e16__DOT__ib_b,
                        // m_fft->v__DOT__stage_e8__DOT__ib_a,
                        // m_fft->v__DOT__stage_e8__DOT__ib_b,
                        // m_fft->v__DOT__stage_o8__DOT__ib_a,
                        // m_fft->v__DOT__stage_o8__DOT__ib_b,
                        // m_fft->v__DOT__stage_e4__DOT__sum_r,
                        // m_fft->v__DOT__stage_e4__DOT__sum_i,
                        // m_fft->v__DOT__stage_o4__DOT__sum_r,
                        // m_fft->v__DOT__stage_o4__DOT__sum_i,
                        m_fft->v__DOT__stage_e4__DOT__ob_a,
                        m_fft->v__DOT__stage_e4__DOT__ob_b_r,
                        m_fft->v__DOT__stage_e4__DOT__ob_b_i,
                        m_fft->v__DOT__stage_o4__DOT__ob_a,
                        m_fft->v__DOT__stage_o4__DOT__ob_b_r,
                        m_fft->v__DOT__stage_o4__DOT__ob_b_i,
//                      m_fft->v__DOT__stage_2__DOT__out_0r,
//                      m_fft->v__DOT__stage_2__DOT__out_0i,
//                      m_fft->v__DOT__stage_2__DOT__out_1r,
//                      m_fft->v__DOT__stage_2__DOT__out_1i,
                        (m_fft->v__DOT__w_s2048)?"S":"-",
                        (m_fft->v__DOT__w_s1024)?"S":"-",
                        (m_fft->v__DOT__w_s512)?"S":"-",
                        (m_fft->v__DOT__w_s256)?"S":"-",
                        (m_fft->v__DOT__w_s128)?"S":"-",
                        (m_fft->v__DOT__w_s64)?"S":"-",
                        (m_fft->v__DOT__w_s32)?"S":"-",
                        (m_fft->v__DOT__w_s16)?"S":"-",
                        (m_fft->v__DOT__w_s8)?"S":"-",
                        (m_fft->v__DOT__w_s4)?"S":"-",
                //      (m_fft->v__DOT__w_s2)?"S":"-", // doesn't exist
                        (m_fft->o_sync)?"\t(SYNC!)":"",
                        (m_fft->o_left | m_fft->o_right)?"  (NZ)":"");
 
                m_data[(m_oaddr  )&(FFTLEN-1)] = m_fft->o_left;
                m_data[(m_oaddr+1)&(FFTLEN-1)] = m_fft->o_right;
 
                if ((m_syncd)&&((m_oaddr&(FFTLEN-1)) == FFTLEN-2)) {
                        dumpwrite();
                        checkresults();
                }
 
                return (m_fft->o_sync);
        }
 
        bool    test(double lft_r, double lft_i, double rht_r, double rht_i) {
                int     ilft, irht, ilft_r, ilft_i, irht_r, irht_i;
 
                ilft_r = (int)(lft_r) & ((1<<IWIDTH)-1);
                ilft_i = (int)(lft_i) & ((1<<IWIDTH)-1);
                irht_r = (int)(rht_r) & ((1<<IWIDTH)-1);
                irht_i = (int)(rht_i) & ((1<<IWIDTH)-1);
 
                ilft = (ilft_r << IWIDTH) | ilft_i;
                irht = (irht_r << IWIDTH) | irht_i;
 
                return test(ilft, irht);
        }
 
        double  rdata(int addr) {
                long    ivl = m_data[addr & (FFTLEN-1)];
 
                ivl = twos_complement(ivl >> OWIDTH, OWIDTH);
                return (double)ivl;
        }
 
        double  idata(int addr) {
                long    ivl = m_data[addr & (FFTLEN-1)];
 
                ivl = twos_complement(ivl, OWIDTH);
                return (double)ivl;
        }
 
        void    dump(FILE *fp) {
                m_dumpfp = fp;
        }
 
        void    dumpwrite(void) {
                if (!m_dumpfp)
                        return;
 
                double  *buf;
 
                buf = new double[FFTLEN * 2];
                for(int i=0; i<FFTLEN; i++) {
                        buf[i*2] = rdata(i);
                        buf[i*2+1] = idata(i);
                }
 
                fwrite(buf, sizeof(double), FFTLEN*2, m_dumpfp);
                delete[] buf;
        }
};
 
 
int     main(int argc, char **argv, char **envp) {
        Verilated::commandArgs(argc, argv);
        FFT_TB *fft = new FFT_TB;
        FILE    *fpout;
 
        fpout = fopen("fft_tb.dbl", "w");
        if (NULL == fpout) {
                fprintf(stderr, "Cannot write output file, fft_tb.dbl\n");
                exit(-1);
        }
 
        fft->reset();
        fft->dump(fpout);
 
        //     1 -> 0x0001 
        //     2 -> 0x0002 
        //     4 -> 0x0004 
        //     8 -> 0x0008 
        //    16 -> 0x0010 
        //    32 -> 0x0020 
        //    64 -> 0x0040 
        //   128 -> 0x0080 
        //   256 -> 0x0100 
        //   512 -> 0x0200 
        //  1024 -> 0x0400 
        //  2048 -> 0x0800
        //  4096 -> 0x1000
        //  8192 -> 0x2000
        // 16384 -> 0x4000
        for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)
                fft->test((double)v,0.0,(double)v,0.0);
        //     1 -> 0xffff      
        //     2 -> 0xfffe
        //     4 -> 0xfffc
        //     8 -> 0xfff8
        //    16 -> 0xfff0
        //    32 -> 0xffe0
        //    64 -> 0xffc0
        //   128 -> 0xff80
        //   256 -> 0xff00
        //   512 -> 0xfe00
        //  1024 -> 0xfc00
        //  2048 -> 0xf800
        //  4096 -> 0xf000
        //  8192 -> 0xe000
        // 16384 -> 0xc000
        // 32768 -> 0x8000
        for(int v=1; v<=32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)
                fft->test(-(double)v,0.0,-(double)v,0.0);
        //     1 -> 0x000040    CORRECT!!
        //     2 -> 0x000080 
        //     4 -> 0x000100 
        //     8 -> 0x000200
        //    16 -> 0x000400
        //    32 -> 0x000800
        //    64 -> 0x001000
        //   128 -> 0x002000
        //   256 -> 0x004000
        //   512 -> 0x008000
        //  1024 -> 0x010000
        //  2048 -> 0x020000
        //  4096 -> 0x040000
        //  8192 -> 0x080000
        // 16384 -> 0x100000
        for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,(double)v,0.0,(double)v);
        //     1 -> 0x3fffc0
        //     2 -> 0x3fff80
        //     4 -> 0x3fff00
        //     8 -> 0x3ffe00
        //    16 -> 0x3ffc00
        //    32 -> 0x3ff800
        //    64 -> 0x3ff000
        //   128 -> 0x3fe000
        //   256 -> 0x3fc000
        //   512 -> 0x3f8000
        //  1024 -> 0x3f0000
        //  2048 -> 0x3e0000
        //  4096 -> 0x3c0000
        //  8192 -> 0x380000
        // 16384 -> 0x300000
        for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,-(double)v,0.0,-(double)v);
 
        // 61. Now, how about the smallest alternating real signal
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(2.0,0.0,0.0,0.0); // Don't forget to expect a bias!
        // 62. Now, how about the smallest alternating imaginary signal
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,2.0,0.0,0.0); // Don't forget to expect a bias!
        // 63. Now, how about the smallest alternating real signal,2nd phase
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,0.0,2.0,0.0); // Don't forget to expect a bias!
        // 64.Now, how about the smallest alternating imaginary signal,2nd phase
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,0.0,0.0,2.0); // Don't forget to expect a bias!
 
        // 65.
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(32767.0,0.0,-32767.0,0.0);
        // 66.
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,-32767.0,0.0,32767.0);
        // 67.
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(-32768.0,-32768.0,-32768.0,-32768.0);
        // 68.
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,-32767.0,0.0,32767.0);
        // 69.
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(0.0,32767.0,0.0,-32767.0);
        // 70. 
        for(int k=0; k<FFTLEN/2; k++)
                fft->test(-32768.0,-32768.0,-32768.0,-32768.0);
 
        // 71. Now let's go for an impulse (SUCCESS)
        fft->test(16384.0, 0.0, 0.0, 0.0);
        for(int k=0; k<FFTLEN/2-1; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 72. And another one on the next clock (FAILS, ugly)
        fft->test(0.0, 0.0, 16384.0, 0.0);
        for(int k=0; k<FFTLEN/2-1; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 73. And an imaginary one on the second clock
        fft->test(0.0, 0.0, 0.0, 16384.0);
        for(int k=0; k<FFTLEN/2-1; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 74. Likewise the next clock
        fft->test(0.0,0.0,0.0,0.0);
        fft->test(16384.0, 0.0, 0.0, 0.0);
        for(int k=0; k<FFTLEN/2-2; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 75. And it's imaginary counterpart
        fft->test(0.0,0.0,0.0,0.0);
        fft->test(0.0, 16384.0, 0.0, 0.0);
        for(int k=0; k<FFTLEN/2-2; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 76. Likewise the next clock
        fft->test(0.0,0.0,0.0,0.0);
        fft->test(0.0, 0.0, 16384.0, 0.0);
        for(int k=0; k<FFTLEN/2-2; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
        // 77. And it's imaginary counterpart
        fft->test(0.0,0.0,0.0,0.0);
        fft->test(0.0, 0.0, 0.0, 16384.0);
        for(int k=0; k<FFTLEN/2-2; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
 
        // 78. Now let's try some exponentials
        for(int k=0; k<FFTLEN/2; k++) {
                double cl, cr, sl, sr, W;
                W = - 2.0 * M_PI / FFTLEN;
                cl = cos(W * (2*k  )) * 16383.0;
                sl = sin(W * (2*k  )) * 16383.0;
                cr = cos(W * (2*k+1)) * 16383.0;
                sr = sin(W * (2*k+1)) * 16383.0;
                fft->test(cl, sl, cr, sr);
        }
 
        // 72.
        for(int k=0; k<FFTLEN/2; k++) {
                double cl, cr, sl, sr, W;
                W = - 2.0 * M_PI / FFTLEN * 5;
                cl = cos(W * (2*k  )) * 16383.0;
                sl = sin(W * (2*k  )) * 16383.0;
                cr = cos(W * (2*k+1)) * 16383.0;
                sr = sin(W * (2*k+1)) * 16383.0;
                fft->test(cl, sl, cr, sr);
        }
 
        // 73.
        for(int k=0; k<FFTLEN/2; k++) {
                double cl, cr, sl, sr, W;
                W = - 2.0 * M_PI / FFTLEN * 8;
                cl = cos(W * (2*k  )) * 8190.0;
                sl = sin(W * (2*k  )) * 8190.0;
                cr = cos(W * (2*k+1)) * 8190.0;
                sr = sin(W * (2*k+1)) * 8190.0;
                fft->test(cl, sl, cr, sr);
        }
 
        // 74.
        for(int k=0; k<FFTLEN/2; k++) {
                double cl, cr, sl, sr, W;
                W = - 2.0 * M_PI / FFTLEN * 25;
                cl = cos(W * (2*k  )) * 4.0;
                sl = sin(W * (2*k  )) * 4.0;
                cr = cos(W * (2*k+1)) * 4.0;
                sr = sin(W * (2*k+1)) * 4.0;
                fft->test(cl, sl, cr, sr);
        }
 
        // 19.--24. And finally, let's clear out our results / buffer
        for(int k=0; k<(FFTLEN/2) * 5; k++)
                fft->test(0.0,0.0,0.0,0.0);
 
 
 
        fclose(fpout);
}
 
 

Line No.	Rev	Author	Line
1	7	dgisselq	`//`
2	9	dgisselq	`// Filename: fft_tb.cpp`
3	7	dgisselq	`//`
4			`// Project: A Doubletime Pipelined FFT`
5			`//`
6	14	dgisselq	`// Purpose: A test-bench for the main program, fftmain.v, of the double`
7	9	dgisselq	`// clocked FFT. This file may be run autonomously (when`
8			`// fully functional). If so, the last line output will either`
9			`// read "SUCCESS" on success, or some other failure message`
10			`// otherwise.`
11	7	dgisselq	`//`
12			`// This file depends upon verilator to both compile, run, and`
13	9	dgisselq	`// therefore test fftmain.v`
14	7	dgisselq	`//`
15			`// Creator: Dan Gisselquist, Ph.D.`
16			`// Gisselquist Tecnology, LLC`
17			`//`
18			`///////////////////////////////////////////////////////////////////////////`
19			`//`
20			`// Copyright (C) 2015, Gisselquist Technology, LLC`
21			`//`
22			`// This program is free software (firmware): you can redistribute it and/or`
23			`// modify it under the terms of the GNU General Public License as published`
24			`// by the Free Software Foundation, either version 3 of the License, or (at`
25			`// your option) any later version.`
26			`//`
27			`// This program is distributed in the hope that it will be useful, but WITHOUT`
28			`// ANY WARRANTY; without even the implied warranty of MERCHANTIBILITY or`
29			`// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License`
30			`// for more details.`
31			`//`
32			`// You should have received a copy of the GNU General Public License along`
33			`// with this program. (It's in the $(ROOT)/doc directory, run make with no`
34			`// target there if the PDF file isn't present.) If not, see`
35			`// <http://www.gnu.org/licenses/> for a copy.`
36			`//`
37			`// License: GPL, v3, as defined and found on www.gnu.org,`
38			`// http://www.gnu.org/licenses/gpl.html`
39			`//`
40			`//`
41			`///////////////////////////////////////////////////////////////////////////`
42			`#include <stdio.h>`
43	9	dgisselq	`#include <math.h>`
44			`#include <fftw3.h>`
45	7	dgisselq
46			`#include "verilated.h"`
47			`#include "Vfftmain.h"`
48
49			`#define LGWIDTH 11`
50			`#define IWIDTH 16`
51			`#define OWIDTH 22`
52
53			`#define FFTLEN (1<<LGWIDTH)`
54
55			`class FFT_TB {`
56			`public:`
57			`Vfftmain *m_fft;`
58	9	dgisselq	`long m_data[FFTLEN], m_log[4*FFTLEN];`
59			`int m_iaddr, m_oaddr, m_ntest;`
60	7	dgisselq	`FILE *m_dumpfp;`
61	9	dgisselq	`fftw_plan m_plan;`
62			`double *m_fft_buf;`
63			`bool m_syncd;`
64	7	dgisselq
65			`FFT_TB(void) {`
66			`m_fft = new Vfftmain;`
67	9	dgisselq	`m_iaddr = m_oaddr = 0;`
68	7	dgisselq	`m_dumpfp = NULL;`
69	9	dgisselq
70			`m_fft_buf = (double )fftw_malloc(sizeof(fftw_complex)(FFTLEN));`
71			`m_plan = fftw_plan_dft_1d(FFTLEN, (fftw_complex *)m_fft_buf,`
72			`(fftw_complex *)m_fft_buf,`
73			`FFTW_FORWARD, FFTW_MEASURE);`
74			`m_syncd = false;`
75			`m_ntest = 0;`
76	7	dgisselq	`}`
77
78			`void tick(void) {`
79			`m_fft->i_clk = 0;`
80			`m_fft->eval();`
81			`m_fft->i_clk = 1;`
82			`m_fft->eval();`
83			`}`
84
85			`void reset(void) {`
86			`m_fft->i_ce = 0;`
87			`m_fft->i_rst = 1;`
88			`tick();`
89			`m_fft->i_rst = 0;`
90			`tick();`
91	9	dgisselq
92			`m_iaddr = m_oaddr = 0;`
93			`m_syncd = false;`
94	7	dgisselq	`}`
95
96	9	dgisselq	`long twos_complement(const long val, const int bits) {`
97			`long r;`
98
99			`r = val & ((1l<<bits)-1);`
100			`if (r & (1l << (bits-1)))`
101			`r \|= (-1l << bits);`
102			`return r;`
103			`}`
104
105			`void checkresults(void) {`
106			`double dp, sp; // Complex array`
107			`double vout[FFTLEN*2];`
108			`double isq=0.0, osq = 0.0;`
109			`long *lp;`
110
111			`// Fill up our test array from the log array`
112			`printf("%3d : CHECK: %8d %5x\n", m_ntest, m_iaddr, m_iaddr);`
113			`dp = m_fft_buf; lp = &m_log[(m_iaddr-FFTLEN3)&((4FFTLEN-1)&(-FFTLEN))];`
114			`for(int i=0; i<FFTLEN; i++) {`
115			`long tv = *lp++;`
116
117			`dp[0] = twos_complement(tv >> IWIDTH, IWIDTH);`
118			`dp[1] = twos_complement(tv, IWIDTH);`
119
120			`printf("IN[%4d = %4x] = %9.1f %9.1f\n",`
121			`i+((m_iaddr-FFTLEN3)&((4FFTLEN-1)&(-FFTLEN))),`
122			`i+((m_iaddr-FFTLEN3)&((4FFTLEN-1)&(-FFTLEN))),`
123			`dp[0], dp[1]);`
124			`dp += 2;`
125			`}`
126
127			`// Let's measure ... are we the zero vector? If not, how close?`
128			`dp = m_fft_buf;`
129			`for(int i=0; i<FFTLEN; i++)`
130			`isq += (dp) (*dp);`
131
132			`fftw_execute(m_plan);`
133
134			`// Let's load up the output we received into vout`
135			`dp = vout;`
136			`for(int i=0; i<FFTLEN; i++) {`
137			`long tv = m_data[i];`
138
139			`printf("OUT[%4d = %4x] = ", i, i);`
140	14	dgisselq	`printf("%12lx = ", tv);`
141	9	dgisselq	`*dp = twos_complement(tv >> OWIDTH, OWIDTH);`
142	14	dgisselq	`printf("%10.1f + ", *dp);`
143	9	dgisselq	`osq += (dp) (*dp); dp++;`
144			`*dp = twos_complement(tv, OWIDTH);`
145	14	dgisselq	`printf("%10.1f j", *dp);`
146	9	dgisselq	`osq += (dp) (*dp); dp++;`
147			`printf(" <-> %12.1f %12.1f\n", m_fft_buf[2i], m_fft_buf[2i+1]);`
148			`}`
149
150
151			`// Let's figure out if there's a scale factor difference ...`
152			`double scale = 0.0, wt = 0.0;`
153			`sp = m_fft_buf; dp = vout;`
154			`for(int i=0; i<FFTLEN*2; i++) {`
155			`scale += (sp) (*dp++);`
156			`wt += (sp) (*sp); sp++;`
157			`} scale = scale / wt;`
158
159			`if (wt == 0.0) scale = 1.0;`
160
161			`double xisq = 0.0;`
162			`sp = m_fft_buf; dp = vout;`
163			`for(int i=0; i<FFTLEN*2; i++) {`
164			`double vl = (sp++) scale - (*dp++);`
165			`xisq += vl * vl;`
166			`}`
167
168			`printf("%3d : SCALE = %12.6f, WT = %18.1f, ISQ = %15.1f, ",`
169			`m_ntest, scale, wt, isq);`
170			`printf("OSQ = %18.1f, ", osq);`
171			`printf("XISQ = %18.1f\n", xisq);`
172			`m_ntest++;`
173			`}`
174
175	7	dgisselq	`bool test(int lft, int rht) {`
176			`m_fft->i_ce = 1;`
177			`m_fft->i_rst = 0;`
178			`m_fft->i_left = lft;`
179			`m_fft->i_right = rht;`
180
181	9	dgisselq	`m_log[(m_iaddr++)&(4*FFTLEN-1)] = (long)lft;`
182			`m_log[(m_iaddr++)&(4*FFTLEN-1)] = (long)rht;`
183
184	7	dgisselq	`tick();`
185
186			`if (m_fft->o_sync) {`
187	9	dgisselq	`m_oaddr &= (-1<<LGWIDTH);`
188			`m_syncd = true;`
189			`} else m_oaddr += 2;`
190	7	dgisselq
191	9	dgisselq	`printf("%8x,%5d: %08x,%08x -> %011lx,%011lx"`
192			`// "\t%011lx,%011lx"`
193			`// "\t%011lx,%011lx"`
194			`// "\t%06x,%06x"`
195			`// "\t%06x,%06x"`
196			`"\t%011lx,%06x,%06x"`
197			`"\t%011lx,%06x,%06x"`
198			`" %s%s%s%s%s%s%s%s%s%s %s%s\n",`
199			`m_iaddr, m_oaddr,`
200	7	dgisselq	`lft, rht, m_fft->o_left, m_fft->o_right,`
201	9	dgisselq	`// m_fft->v__DOT__stage_e2048__DOT__ib_a,`
202			`// m_fft->v__DOT__stage_e2048__DOT__ib_b,`
203			`// m_fft->v__DOT__stage_e512__DOT__ib_a,`
204			`// m_fft->v__DOT__stage_e512__DOT__ib_b,`
205			`// m_fft->v__DOT__stage_e256__DOT__ib_a,`
206			`// m_fft->v__DOT__stage_e256__DOT__ib_b,`
207			`// m_fft->v__DOT__stage_e128__DOT__ib_a,`
208			`// m_fft->v__DOT__stage_e128__DOT__ib_b,`
209			`// m_fft->v__DOT__stage_e64__DOT__ib_a,`
210			`// m_fft->v__DOT__stage_e64__DOT__ib_b,`
211			`// m_fft->v__DOT__stage_e32__DOT__ib_a,`
212			`// m_fft->v__DOT__stage_e32__DOT__ib_b,`
213			`// m_fft->v__DOT__stage_e16__DOT__ib_a,`
214			`// m_fft->v__DOT__stage_e16__DOT__ib_b,`
215			`// m_fft->v__DOT__stage_e8__DOT__ib_a,`
216			`// m_fft->v__DOT__stage_e8__DOT__ib_b,`
217			`// m_fft->v__DOT__stage_o8__DOT__ib_a,`
218			`// m_fft->v__DOT__stage_o8__DOT__ib_b,`
219			`// m_fft->v__DOT__stage_e4__DOT__sum_r,`
220			`// m_fft->v__DOT__stage_e4__DOT__sum_i,`
221			`// m_fft->v__DOT__stage_o4__DOT__sum_r,`
222			`// m_fft->v__DOT__stage_o4__DOT__sum_i,`
223			`m_fft->v__DOT__stage_e4__DOT__ob_a,`
224			`m_fft->v__DOT__stage_e4__DOT__ob_b_r,`
225			`m_fft->v__DOT__stage_e4__DOT__ob_b_i,`
226			`m_fft->v__DOT__stage_o4__DOT__ob_a,`
227			`m_fft->v__DOT__stage_o4__DOT__ob_b_r,`
228			`m_fft->v__DOT__stage_o4__DOT__ob_b_i,`
229			`// m_fft->v__DOT__stage_2__DOT__out_0r,`
230			`// m_fft->v__DOT__stage_2__DOT__out_0i,`
231			`// m_fft->v__DOT__stage_2__DOT__out_1r,`
232			`// m_fft->v__DOT__stage_2__DOT__out_1i,`
233	7	dgisselq	`(m_fft->v__DOT__w_s2048)?"S":"-",`
234			`(m_fft->v__DOT__w_s1024)?"S":"-",`
235			`(m_fft->v__DOT__w_s512)?"S":"-",`
236			`(m_fft->v__DOT__w_s256)?"S":"-",`
237			`(m_fft->v__DOT__w_s128)?"S":"-",`
238			`(m_fft->v__DOT__w_s64)?"S":"-",`
239			`(m_fft->v__DOT__w_s32)?"S":"-",`
240	9	dgisselq	`(m_fft->v__DOT__w_s16)?"S":"-",`
241	7	dgisselq	`(m_fft->v__DOT__w_s8)?"S":"-",`
242	9	dgisselq	`(m_fft->v__DOT__w_s4)?"S":"-",`
243			`// (m_fft->v__DOT__w_s2)?"S":"-", // doesn't exist`
244			`(m_fft->o_sync)?"\t(SYNC!)":"",`
245			`(m_fft->o_left \| m_fft->o_right)?" (NZ)":"");`
246	7	dgisselq
247	9	dgisselq	`m_data[(m_oaddr )&(FFTLEN-1)] = m_fft->o_left;`
248			`m_data[(m_oaddr+1)&(FFTLEN-1)] = m_fft->o_right;`
249	7	dgisselq
250	9	dgisselq	`if ((m_syncd)&&((m_oaddr&(FFTLEN-1)) == FFTLEN-2)) {`
251	7	dgisselq	`dumpwrite();`
252	9	dgisselq	`checkresults();`
253			`}`
254	7	dgisselq
255			`return (m_fft->o_sync);`
256			`}`
257
258			`bool test(double lft_r, double lft_i, double rht_r, double rht_i) {`
259			`int ilft, irht, ilft_r, ilft_i, irht_r, irht_i;`
260
261	9	dgisselq	`ilft_r = (int)(lft_r) & ((1<<IWIDTH)-1);`
262			`ilft_i = (int)(lft_i) & ((1<<IWIDTH)-1);`
263			`irht_r = (int)(rht_r) & ((1<<IWIDTH)-1);`
264			`irht_i = (int)(rht_i) & ((1<<IWIDTH)-1);`
265	7	dgisselq
266			`ilft = (ilft_r << IWIDTH) \| ilft_i;`
267			`irht = (irht_r << IWIDTH) \| irht_i;`
268
269			`return test(ilft, irht);`
270			`}`
271
272			`double rdata(int addr) {`
273			`long ivl = m_data[addr & (FFTLEN-1)];`
274
275	14	dgisselq	`ivl = twos_complement(ivl >> OWIDTH, OWIDTH);`
276	7	dgisselq	`return (double)ivl;`
277			`}`
278
279			`double idata(int addr) {`
280			`long ivl = m_data[addr & (FFTLEN-1)];`
281
282	14	dgisselq	`ivl = twos_complement(ivl, OWIDTH);`
283	7	dgisselq	`return (double)ivl;`
284			`}`
285
286			`void dump(FILE *fp) {`
287			`m_dumpfp = fp;`
288			`}`
289
290			`void dumpwrite(void) {`
291			`if (!m_dumpfp)`
292			`return;`
293
294			`double *buf;`
295
296			`buf = new double[FFTLEN * 2];`
297			`for(int i=0; i<FFTLEN; i++) {`
298			`buf[i*2] = rdata(i);`
299			`buf[i*2+1] = idata(i);`
300			`}`
301
302			`fwrite(buf, sizeof(double), FFTLEN*2, m_dumpfp);`
303			`delete[] buf;`
304			`}`
305			`};`
306
307	9	dgisselq
308	7	dgisselq	`int main(int argc, char argv, char envp) {`
309			`Verilated::commandArgs(argc, argv);`
310			`FFT_TB *fft = new FFT_TB;`
311			`FILE *fpout;`
312
313			`fpout = fopen("fft_tb.dbl", "w");`
314			`if (NULL == fpout) {`
315			`fprintf(stderr, "Cannot write output file, fft_tb.dbl\n");`
316			`exit(-1);`
317			`}`
318
319			`fft->reset();`
320			`fft->dump(fpout);`
321
322	9	dgisselq	`// 1 -> 0x0001`
323			`// 2 -> 0x0002`
324			`// 4 -> 0x0004`
325			`// 8 -> 0x0008`
326			`// 16 -> 0x0010`
327			`// 32 -> 0x0020`
328			`// 64 -> 0x0040`
329			`// 128 -> 0x0080`
330			`// 256 -> 0x0100`
331			`// 512 -> 0x0200`
332			`// 1024 -> 0x0400`
333			`// 2048 -> 0x0800`
334			`// 4096 -> 0x1000`
335			`// 8192 -> 0x2000`
336			`// 16384 -> 0x4000`
337			`for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)`
338			`fft->test((double)v,0.0,(double)v,0.0);`
339			`// 1 -> 0xffff`
340			`// 2 -> 0xfffe`
341			`// 4 -> 0xfffc`
342			`// 8 -> 0xfff8`
343			`// 16 -> 0xfff0`
344			`// 32 -> 0xffe0`
345			`// 64 -> 0xffc0`
346			`// 128 -> 0xff80`
347			`// 256 -> 0xff00`
348			`// 512 -> 0xfe00`
349			`// 1024 -> 0xfc00`
350			`// 2048 -> 0xf800`
351			`// 4096 -> 0xf000`
352			`// 8192 -> 0xe000`
353			`// 16384 -> 0xc000`
354			`// 32768 -> 0x8000`
355			`for(int v=1; v<=32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)`
356			`fft->test(-(double)v,0.0,-(double)v,0.0);`
357			`// 1 -> 0x000040 CORRECT!!`
358			`// 2 -> 0x000080`
359			`// 4 -> 0x000100`
360			`// 8 -> 0x000200`
361			`// 16 -> 0x000400`
362			`// 32 -> 0x000800`
363			`// 64 -> 0x001000`
364			`// 128 -> 0x002000`
365			`// 256 -> 0x004000`
366			`// 512 -> 0x008000`
367			`// 1024 -> 0x010000`
368			`// 2048 -> 0x020000`
369			`// 4096 -> 0x040000`
370			`// 8192 -> 0x080000`
371			`// 16384 -> 0x100000`
372			`for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)`
373			`fft->test(0.0,(double)v,0.0,(double)v);`
374			`// 1 -> 0x3fffc0`
375			`// 2 -> 0x3fff80`
376			`// 4 -> 0x3fff00`
377			`// 8 -> 0x3ffe00`
378			`// 16 -> 0x3ffc00`
379			`// 32 -> 0x3ff800`
380			`// 64 -> 0x3ff000`
381			`// 128 -> 0x3fe000`
382			`// 256 -> 0x3fc000`
383			`// 512 -> 0x3f8000`
384			`// 1024 -> 0x3f0000`
385			`// 2048 -> 0x3e0000`
386			`// 4096 -> 0x3c0000`
387			`// 8192 -> 0x380000`
388			`// 16384 -> 0x300000`
389			`for(int v=1; v<32768; v<<=1) for(int k=0; k<FFTLEN/2; k++)`
390			`fft->test(0.0,-(double)v,0.0,-(double)v);`
391
392			`// 61. Now, how about the smallest alternating real signal`
393	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
394	9	dgisselq	`fft->test(2.0,0.0,0.0,0.0); // Don't forget to expect a bias!`
395			`// 62. Now, how about the smallest alternating imaginary signal`
396	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
397	9	dgisselq	`fft->test(0.0,2.0,0.0,0.0); // Don't forget to expect a bias!`
398			`// 63. Now, how about the smallest alternating real signal,2nd phase`
399	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
400	9	dgisselq	`fft->test(0.0,0.0,2.0,0.0); // Don't forget to expect a bias!`
401			`// 64.Now, how about the smallest alternating imaginary signal,2nd phase`
402	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
403	9	dgisselq	`fft->test(0.0,0.0,0.0,2.0); // Don't forget to expect a bias!`
404
405			`// 65.`
406	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
407	9	dgisselq	`fft->test(32767.0,0.0,-32767.0,0.0);`
408			`// 66.`
409	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
410	9	dgisselq	`fft->test(0.0,-32767.0,0.0,32767.0);`
411			`// 67.`
412	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
413	9	dgisselq	`fft->test(-32768.0,-32768.0,-32768.0,-32768.0);`
414			`// 68.`
415	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
416	9	dgisselq	`fft->test(0.0,-32767.0,0.0,32767.0);`
417			`// 69.`
418	7	dgisselq	`for(int k=0; k<FFTLEN/2; k++)`
419	9	dgisselq	`fft->test(0.0,32767.0,0.0,-32767.0);`
420			`// 70.`
421			`for(int k=0; k<FFTLEN/2; k++)`
422	7	dgisselq	`fft->test(-32768.0,-32768.0,-32768.0,-32768.0);`
423
424	9	dgisselq	`// 71. Now let's go for an impulse (SUCCESS)`
425			`fft->test(16384.0, 0.0, 0.0, 0.0);`
426			`for(int k=0; k<FFTLEN/2-1; k++)`
427	7	dgisselq	`fft->test(0.0,0.0,0.0,0.0);`
428
429	9	dgisselq	`// 72. And another one on the next clock (FAILS, ugly)`
430			`fft->test(0.0, 0.0, 16384.0, 0.0);`
431			`for(int k=0; k<FFTLEN/2-1; k++)`
432			`fft->test(0.0,0.0,0.0,0.0);`
433	7	dgisselq
434	9	dgisselq	`// 73. And an imaginary one on the second clock`
435			`fft->test(0.0, 0.0, 0.0, 16384.0);`
436			`for(int k=0; k<FFTLEN/2-1; k++)`
437			`fft->test(0.0,0.0,0.0,0.0);`
438	7	dgisselq
439	9	dgisselq	`// 74. Likewise the next clock`
440			`fft->test(0.0,0.0,0.0,0.0);`
441			`fft->test(16384.0, 0.0, 0.0, 0.0);`
442			`for(int k=0; k<FFTLEN/2-2; k++)`
443			`fft->test(0.0,0.0,0.0,0.0);`
444	7	dgisselq
445	9	dgisselq	`// 75. And it's imaginary counterpart`
446			`fft->test(0.0,0.0,0.0,0.0);`
447			`fft->test(0.0, 16384.0, 0.0, 0.0);`
448			`for(int k=0; k<FFTLEN/2-2; k++)`
449			`fft->test(0.0,0.0,0.0,0.0);`
450
451			`// 76. Likewise the next clock`
452			`fft->test(0.0,0.0,0.0,0.0);`
453			`fft->test(0.0, 0.0, 16384.0, 0.0);`
454			`for(int k=0; k<FFTLEN/2-2; k++)`
455			`fft->test(0.0,0.0,0.0,0.0);`
456
457			`// 77. And it's imaginary counterpart`
458			`fft->test(0.0,0.0,0.0,0.0);`
459			`fft->test(0.0, 0.0, 0.0, 16384.0);`
460			`for(int k=0; k<FFTLEN/2-2; k++)`
461			`fft->test(0.0,0.0,0.0,0.0);`
462
463
464			`// 78. Now let's try some exponentials`
465			`for(int k=0; k<FFTLEN/2; k++) {`
466			`double cl, cr, sl, sr, W;`
467			`W = - 2.0 * M_PI / FFTLEN;`
468			`cl = cos(W * (2k )) 16383.0;`
469			`sl = sin(W * (2k )) 16383.0;`
470			`cr = cos(W * (2k+1)) 16383.0;`
471			`sr = sin(W * (2k+1)) 16383.0;`
472			`fft->test(cl, sl, cr, sr);`
473			`}`
474
475			`// 72.`
476			`for(int k=0; k<FFTLEN/2; k++) {`
477			`double cl, cr, sl, sr, W;`
478			`W = - 2.0 * M_PI / FFTLEN * 5;`
479			`cl = cos(W * (2k )) 16383.0;`
480			`sl = sin(W * (2k )) 16383.0;`
481			`cr = cos(W * (2k+1)) 16383.0;`
482			`sr = sin(W * (2k+1)) 16383.0;`
483			`fft->test(cl, sl, cr, sr);`
484			`}`
485
486			`// 73.`
487			`for(int k=0; k<FFTLEN/2; k++) {`
488			`double cl, cr, sl, sr, W;`
489			`W = - 2.0 * M_PI / FFTLEN * 8;`
490			`cl = cos(W * (2k )) 8190.0;`
491			`sl = sin(W * (2k )) 8190.0;`
492			`cr = cos(W * (2k+1)) 8190.0;`
493			`sr = sin(W * (2k+1)) 8190.0;`
494			`fft->test(cl, sl, cr, sr);`
495			`}`
496
497			`// 74.`
498			`for(int k=0; k<FFTLEN/2; k++) {`
499			`double cl, cr, sl, sr, W;`
500			`W = - 2.0 * M_PI / FFTLEN * 25;`

Browse

Tools

Subversion Repositories dblclockfft

[/] [dblclockfft/] [trunk/] [bench/] [cpp/] [fft_tb.cpp] - Blame information for rev 14