Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
O
OpenXG-RAN
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lizhongxiao
OpenXG-RAN
Commits
d062af10
Commit
d062af10
authored
11 years ago
by
Raymond Knopp
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
git-svn-id:
http://svn.eurecom.fr/openair4G/trunk@5312
818b1a75-f10b-46b9-bf7c-635c3b92a50f
parent
6f5c0332
Branches unavailable
2024.w06
2024.w05
2024.w04
2024.w03
2024.w02
2024.w01
2023.w51
2023.w50
2023.w49
2023.w48
2023.w47
2023.w45
2023.w43
2023.w42
2023.w41
2023.w40
2023.w39
2023.w38
2023.w37
2023.w36
2023.w34
2023.w33
2023.w32
2023.w31
2023.w30
2023.w29
2023.w28
2023.w27
2023.w26
2023.w25
2023.w24
2023.w23
2023.w22
2023.w21
2023.w20
2023.w19
2023.w18
2023.w18b
2023.w16
2023.w15
2023.w14
2023.w13
2023.w12
2023.w11
2023.w11b
2023.w10
2023.w10b
2023.w09
2023.w08
2023.w08b
2023.w07
2023.w06
2023.w05
2023.w03
2023.w02
2022.42
2022.41
2022.w51
2022.w50
2022.w49
2022.w48
2022.w47
2022.w46
2022.w45
2022.w43
2022.w42
2022.w42b
2022.w41
2022.w40
2022.w39
2022.w38
2022.w37
2022.w37b
2022.w36
2022.w35
2022.w33
2022.w32
2022.w31
2022.w31b
2022.w30
2022.w29
2022.w26
2022.w25
2022.w24
2022.w24b
2022.w23
2022.w22
2022.w21
2022.w20
2022.w19
2022.w18
2022.w17
2022.w15
2022.w15b
2022.w14a
2022.w13
2022.w13b
2022.w13a
2022.w12
2022.w10
2022.w09
2022.w09b
2022.w08
2022.w08b
2022.w07
2022.w07b
2022.w06
2022.w06a
2022.w05
2022.w05b
2022.w03_hotfix
2022.w03_b
2022.w02
2022.w01
2021.wk46
2021.wk14_a
2021.wk13_d
2021.wk13_c
2021.w51_c
2021.w51_a
2021.w50_a
2021.w49_b
2021.w49_a
2021.w48
2021.w47
2021.w46
2021.w46-powder
2021.w45
2021.w45_b
2021.w44
2021.w43
2021.w42
2021.w37
2021.w36
2021.w35
2021.w34
2021.w33
2021.w32
2021.w31
2021.w30
2021.w29
2021.w28
2021.w27
2021.w26
2021.w25
2021.w24
2021.w23
2021.w22
2021.w20
2021.w19
2021.w18_b
2021.w18_a
2021.w17_b
2021.w16
2021.w15
2021.w14
2021.w13_a
2021.w12
2021.w11
2021.w10
2021.w09
2021.w08
2021.w06
2021.w05
2021.w04
2021.w02
2020.w51_2
2020.w51
2020.w50
2020.w49
2020.w48_2
2020.w48
2020.w47
2020.w46_2
2020.w46
2020.w45_2
2020.w45
2020.w44
2020.w42_2
2020.w42
2020.w41
2020.w39
2020.w38
2020.w37
2020.w36
2020.w34
2020.w33
2020.w31
2020.w30
2020.w29
2020.w28
2020.w26
2020.w25
2020.w24
2020.w23
2020.w22
2020.w19
2020.w17
2020.w16
2020.w15
2020.w11
2020.w09
2020.w06
2020.w05
2020.w04
2020.w03
2019.w51
2019.w44
2019.w41
2019.w36
2019.w30
2019.w28
2019.w27
2019.w25
2019.w23
2019.w21
2019.w17
2019.w15
2019.w13
2019.w11
2019.w10
2019.w09
2019.w08
2019.w07
2019.w06
2019.w04
2019.w03
2018.w51
2018.w48
2018.w47
2018.w46
2018.w44
2018.w41
2018.w40
2018.w39
2018.w36
2018.w33
2018.w31
2018.w29
2018.w25
2018.w19
2018.w15
2018.w12
2018.w11
2018.w10
2018.w09
2018.w08
2018.w07
2018.w06
2018.w05
2018.w04
2018.w03
2018.w02
2017.w48
2017.w46
2017.w43
2017.w42
2017.w34
2017.w30
2017.w25
2017.w24
2017.w22
2017.w20
2017.w19
2017.w15
2017.w14
2017.w13
2017.w12
2017.w11
2017.w10
2017.w09
2017.w08
2017.w07
2017.w06
2017.w05
2017.w04
2017.w03
2017.w02
2017.w01
2016.w50
2016.w49
v2.1.0
v2.0.0
v1.2.2
v1.2.1
v1.2.0
v1.1.1
v1.1.0
v1.0.3
v1.0.2
v1.0.1
v1.0.0
v1B0.8
v1B0.7
v1B0.6
v1B0.5
v1B0.4
v1B0.3
v1B0.2
v1B0.1
v0.6.1
v0.6.1_tdd
v0.6
v0.5.2
v0.5.1_tdd
v0.5
v0.4
v0.3
v0.2
v0.1
testing-cmw500
setparam
osa-etsi-ws-ue
osa-etsi-ws-try2
osa-etsi-ws-try1
osa-etsi-ws-gNB
oai_nr_sync
nr-ip-over-lte
nr-ip-over-lte-v.1.5
nr-ip-over-lte-v.1.4
nr-ip-over-lte-v.1.3
nr-ip-over-lte-v.1.2
nr-ip-over-lte-v.1.1
nr-ip-over-lte-v.1.0
flexran-eol
develop-nr-pdcch
develop-nr-2020w03
develop-nr-2020w02
develop-nr-2019w51
develop-nr-2019w50
develop-nr-2019w48
develop-nr-2019w47
develop-nr-2019w45
develop-nr-2019w43
develop-nr-2019w42
develop-nr-2019w40
develop-nr-2019w28
develop-nr-2019w23
benetel_phase_rotation
benetel_gnb_rel_2.0
benetel_gnb_rel_1.0
benetel_enb_rel_2.0
benetel_enb_rel_1.0
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
0 additions
and
740 deletions
+0
-740
openair1/PHY/TOOLS/FFTTEST/COPYING
openair1/PHY/TOOLS/FFTTEST/COPYING
+0
-340
openair1/PHY/TOOLS/FFTTEST/Makefile
openair1/PHY/TOOLS/FFTTEST/Makefile
+0
-22
openair1/PHY/TOOLS/FFTTEST/ffttest.c
openair1/PHY/TOOLS/FFTTEST/ffttest.c
+0
-378
No files found.
openair1/PHY/TOOLS/FFTTEST/COPYING
deleted
100644 → 0
View file @
6f5c0332
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; 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 2 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
MERCHANTABILITY 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; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
This diff is collapsed.
Click to expand it.
openair1/PHY/TOOLS/FFTTEST/Makefile
deleted
100644 → 0
View file @
6f5c0332
CC
=
gcc-4
TOP_DIR
=
../../..
CFLAGS
=
-Wall
-O2
-fno-common
-mpreferred-stack-boundary
=
4
-DNODE_RG
-DUSER_MODE
-DPC_TARGET
-DPC_DSP
-DNB_ANTENNAS_RX
=
2
-DNB_ANTENNAS_TXRX
=
2
-DNB_ANTENNAS_TX
=
2
-DMAX_MODULES
=
1
-DPHY_CONTEXT
=
1
-DBIT8_TXMUX
-DBIT8_TX
-g
-msse2
-mmmx
-msse
PHY_OBJS
+=
$(TOP_DIR)
/PHY/TOOLS/fft.o
$(TOP_DIR)
/SIMULATION/TOOLS/rangen_double.o
$(TOP_DIR)
/SIMULATION/TOOLS/taus.o
$(TOP_DIR)
/PHY/TOOLS/file_output.o
OBJ
=
$(PHY_OBJS)
all
:
ffttest
$(OBJ)
:
%.o : %.c
$(CC)
-c
$(CFLAGS)
-Wall
-I
$(TOP_DIR)
-o
$@
$<
ffttest
:
$(OBJ) ffttest.c
$(CC)
ffttest.c
-I
$(TOP_DIR)
-o
ffttest
$(CFLAGS)
$(PHY_OBJS)
-lm
clean
:
rm
-f
$(TOP_DIR)
/PHY/TOOLS/
*
.o
rm
-f
$(TOP_DIR)
/SIMULATION/TOOLS/
*
.o
rm
-f
ffttest
rm
-f
*
.m
This diff is collapsed.
Click to expand it.
openair1/PHY/TOOLS/FFTTEST/ffttest.c
deleted
100755 → 0
View file @
6f5c0332
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <sys/time.h>
#include "PHY/defs.h"
#include "PHY/TOOLS/defs.h"
#include "PHY/TOOLS/twiddle64.h"
#include "PHY/TOOLS/twiddle256.h"
#include "PHY/TOOLS/twiddle1024.h"
#include "PHY/TOOLS/twiddle4096.h"
#define PI 3.14159265359
#define MAXPOW 24
extern
double
gaussdouble
(
double
,
double
);
extern
unsigned
int
taus
();
extern
void
randominit
();
int
pow_2
[
MAXPOW
];
int
pow_4
[
MAXPOW
];
void
twiddle
(
struct
complex
*
W
,
int
N
,
double
stuff
)
{
W
->
r
=
cos
(
stuff
*
2
.
0
*
PI
/
(
double
)
N
);
W
->
i
=-
sin
(
stuff
*
2
.
0
*
PI
/
(
double
)
N
);
}
void
bit_r4_reorder
(
struct
complex
*
W
,
// Final output
int
N
)
// size of FFT
{
int
bits
=
0
,
i
,
j
,
k
;
double
tempr
,
tempi
;
for
(
i
=
0
;
i
<
MAXPOW
;
i
++
)
if
(
pow_2
[
i
]
==
N
)
bits
=
i
;
for
(
i
=
0
;
i
<
N
;
i
++
)
{
j
=
0
;
for
(
k
=
0
;
k
<
bits
;
k
+=
2
)
{
if
(
i
&
pow_2
[
k
])
j
+=
pow_2
[
bits
-
k
-
2
];
if
(
i
&
pow_2
[
k
+
1
])
j
+=
pow_2
[
bits
-
k
-
1
];
}
if
(
j
>
i
)
/** Only make "up" swaps */
{
tempr
=
W
[
i
].
r
;
tempi
=
W
[
i
].
i
;
W
[
i
].
r
=
W
[
j
].
r
;
W
[
i
].
i
=
W
[
j
].
i
;
W
[
j
].
r
=
tempr
;
W
[
j
].
i
=
tempi
;
}
}
}
/** RADIX-4 FFT ALGORITHM */
/* Double precision*/
void
radix4
(
struct
complex
*
x
,
int
N
)
{
int
n2
,
k1
,
N1
,
N2
;
struct
complex
W
,
bfly
[
4
];
N1
=
4
;
N2
=
N
/
4
;
/** Do 4 Point DFT */
for
(
n2
=
0
;
n2
<
N2
;
n2
++
)
{
/** Radix 4 butterfly */
bfly
[
0
].
r
=
(
x
[
n2
].
r
+
x
[
N2
+
n2
].
r
+
x
[
2
*
N2
+
n2
].
r
+
x
[
3
*
N2
+
n2
].
r
);
bfly
[
0
].
i
=
(
x
[
n2
].
i
+
x
[
N2
+
n2
].
i
+
x
[
2
*
N2
+
n2
].
i
+
x
[
3
*
N2
+
n2
].
i
);
bfly
[
1
].
r
=
(
x
[
n2
].
r
+
x
[
N2
+
n2
].
i
-
x
[
2
*
N2
+
n2
].
r
-
x
[
3
*
N2
+
n2
].
i
);
bfly
[
1
].
i
=
(
x
[
n2
].
i
-
x
[
N2
+
n2
].
r
-
x
[
2
*
N2
+
n2
].
i
+
x
[
3
*
N2
+
n2
].
r
);
bfly
[
2
].
r
=
(
x
[
n2
].
r
-
x
[
N2
+
n2
].
r
+
x
[
2
*
N2
+
n2
].
r
-
x
[
3
*
N2
+
n2
].
r
);
bfly
[
2
].
i
=
(
x
[
n2
].
i
-
x
[
N2
+
n2
].
i
+
x
[
2
*
N2
+
n2
].
i
-
x
[
3
*
N2
+
n2
].
i
);
bfly
[
3
].
r
=
(
x
[
n2
].
r
-
x
[
N2
+
n2
].
i
-
x
[
2
*
N2
+
n2
].
r
+
x
[
3
*
N2
+
n2
].
i
);
bfly
[
3
].
i
=
(
x
[
n2
].
i
+
x
[
N2
+
n2
].
r
-
x
[
2
*
N2
+
n2
].
i
-
x
[
3
*
N2
+
n2
].
r
);
/** In-place results */
for
(
k1
=
0
;
k1
<
N1
;
k1
++
)
{
twiddle
(
&
W
,
N
,
(
double
)
k1
*
(
double
)
n2
);
x
[
n2
+
N2
*
k1
].
r
=
bfly
[
k1
].
r
*
W
.
r
-
bfly
[
k1
].
i
*
W
.
i
;
x
[
n2
+
N2
*
k1
].
i
=
bfly
[
k1
].
i
*
W
.
r
+
bfly
[
k1
].
r
*
W
.
i
;
}
}
/** Don't recurse if we're down to one butterfly */
if
(
N2
!=
1
)
for
(
k1
=
0
;
k1
<
N1
;
k1
++
)
{
radix4
(
&
x
[
N2
*
k1
],
N2
);
}
}
void
QAM_input
(
struct
complex
*
data
,
double
amp
,
int
N
,
int
Nu
,
char
M
)
{
int
i
,
rv
;
int
FCO
=
(
N
-
(
Nu
>>
1
));
// First non-zero carrier offset
for
(
i
=
0
;
i
<
N
;
i
++
)
{
data
[
i
].
r
=
0
.
0
;
data
[
i
].
i
=
0
.
0
;
}
for
(
i
=
0
;
i
<
Nu
;
i
++
)
{
rv
=
taus
();
switch
(
M
)
{
case
0
:
// QPSK
data
[(
i
+
FCO
)
%
N
].
r
=
((
rv
&
1
)
?
-
amp
:
amp
)
/
sqrt
(
2
.
0
);
data
[(
i
+
FCO
)
%
N
].
r
=
(((
rv
>>
1
)
&
1
)
?
-
amp
:
amp
)
/
sqrt
(
2
.
0
);
break
;
case
1
:
// 16QAM
data
[(
i
+
FCO
)
%
N
].
r
=
(
2
*
(
rv
&
3
)
-
3
)
*
amp
/
sqrt
(
10
);
data
[(
i
+
FCO
)
%
N
].
i
=
(
2
*
((
rv
>>
2
)
&
3
)
-
3
)
*
amp
/
sqrt
(
10
);
break
;
default:
break
;
}
}
}
void
fft_distortion_test
(
int
N
,
// dimension of FFT under test
char
test
,
// type of test
double
input_dB
,
// strength of input
struct
complex
*
data
,
// pointer to floating point data vector
struct
complex16
*
data16
,
// pointer to Q15 data vector
struct
complex16
*
data16_out
,
unsigned
short
*
rev
)
// pointer to Q15 data vector
{
double
mean_in
=
0
.
0
,
mean_error
=
0
.
0
,
SNR
;
int
i
;
short
*
twiddle
;
unsigned
char
log2N
,
log2N_over2
;
srand
(
1
);
randominit
();
for
(
i
=
0
;
i
<
N
;
i
++
)
{
data
[
i
].
r
=
0
.
0
;
data
[
i
].
i
=
0
.
0
;
data16
[
i
].
r
=
0
;
data16
[
i
].
i
=
0
;
}
switch
(
test
)
{
case
0
:
/** Generate complex exponential **/
for
(
i
=
0
;
i
<
N
;
i
++
){
data
[
i
].
r
=
pow
(
10
,.
05
*
input_dB
)
*
cos
(
2
.
0
*
PI
*
.
1
*
i
);
data
[
i
].
i
=
pow
(
10
,.
05
*
input_dB
)
*
sin
(
2
.
0
*
PI
*
.
1
*
i
);
}
break
;
case
1
:
// QPSK
QAM_input
(
data
,
pow
(
10
,.
05
*
input_dB
),
N
,
N
,
0
);
break
;
case
2
:
// 16-QAM
QAM_input
(
data
,
pow
(
10
,.
05
*
input_dB
),
N
,
N
,
1
);
break
;
case
3
:
/** Generate cosine **/
for
(
i
=
0
;
i
<
N
;
i
++
)
{
data
[
i
].
r
=
sqrt
(.
5
)
*
pow
(
10
,.
05
*
input_dB
)
*
gaussdouble
(
0
.
0
,
1
.
0
);
data
[
i
].
i
=
sqrt
(.
5
)
*
pow
(
10
,.
05
*
input_dB
)
*
gaussdouble
(
0
.
0
,
1
.
0
);
}
break
;
default:
break
;
}
// Make fixed-point versions of data
for
(
i
=
0
;
i
<
N
;
i
++
)
{
data16
[
i
].
r
=
(
short
)(
data
[
i
].
r
*
32767
);
data16
[
i
].
i
=
(
short
)(
data
[
i
].
i
*
32767
);
}
// Do Floating-point FFT
radix4
(
data
,
N
);
for
(
i
=
0
;
i
<
N
;
i
++
)
{
data
[
i
].
r
/=
sqrt
(
N
);
data
[
i
].
i
/=
sqrt
(
N
);
}
bit_r4_reorder
(
data
,
N
);
switch
(
N
)
{
case
64
:
twiddle
=
twiddle_fft64
;
log2N
=
6
;
log2N_over2
=
3
;
break
;
case
256
:
twiddle
=
twiddle_fft256
;
log2N
=
8
;
log2N_over2
=
4
;
break
;
case
1024
:
twiddle
=
twiddle_fft1024
;
log2N
=
10
;
log2N_over2
=
5
;
break
;
case
4096
:
log2N
=
12
;
log2N_over2
=
6
;
twiddle
=
twiddle_fft4096
;
break
;
default:
twiddle
=
twiddle_fft256
;
log2N
=
8
;
log2N_over2
=
4
;
break
;
}
// Do Q15 FFT
fft
((
short
*
)
data16
,
(
short
*
)
data16_out
,
twiddle
,
rev
,
log2N
,
log2N_over2
,
0
);
// Compute Distortion statistics
mean_error
=
0
.
0
;
mean_in
=
0
.
0
;
for
(
i
=
0
;
i
<
N
;
i
++
)
{
mean_in
+=
data
[
i
].
r
*
data
[
i
].
r
+
data
[
i
].
i
*
data
[
i
].
i
;
mean_error
+=
pow
((
data
[
i
].
r
-
((
double
)
data16_out
[
2
*
i
].
r
/
32767
.
0
)),
2
)
+
pow
((
data
[
i
].
i
-
((
double
)
data16_out
[
2
*
i
].
i
/
32767
.
0
)),
2
);
}
SNR
=
10
*
log10
(
mean_in
/
mean_error
);
printf
(
"Input %f -> SNR: %f (amp %f, %f)
\n
"
,
input_dB
,
SNR
,
pow
(
10
,.
05
*
input_dB
),
32767
*
pow
(
10
,.
05
*
input_dB
));
}
#define SCALE64 0x0006
#define SCALE256 0x0016
#define SCALE1024 0x0056
#define SCALE4096 0x0156
void
main
(
int
argc
,
char
*
argv
[])
{
int
N
,
test
,
log2N
;
int
i
;
double
maxSNR
,
input_dB
;
struct
complex
*
data
;
struct
complex16
*
data16
;
struct
complex16
*
data16_out
;
unsigned
short
local_rev
[
4096
];
char
fname
[
100
],
vname
[
100
];
if
(
argc
!=
3
)
{
printf
(
"fft size(16-4096) test(0-3)!!
\n
"
);
exit
(
-
1
);
}
N
=
atoi
(
argv
[
1
]);
test
=
atoi
(
argv
[
2
]);
if
((
N
&
1
)
==
1
)
{
printf
(
"Size must be a power of 4!
\n
"
);
exit
(
-
1
);
}
if
((
test
>
3
)
||
(
test
<
0
))
{
printf
(
"test must be in (0-3)
\n
"
);
exit
(
-
1
);
}
switch
(
N
)
{
case
64
:
log2N
=
6
;
break
;
case
256
:
log2N
=
8
;
break
;
case
1024
:
log2N
=
10
;
break
;
case
4096
:
log2N
=
12
;
break
;
default:
printf
(
"Illegal fft size
\n
"
);
exit
(
-
1
);
break
;
}
init_fft
(
N
,
log2N
,
local_rev
);
set_taus_seed
(
3
);
/** Set up power of two arrays */
pow_2
[
0
]
=
1
;
for
(
i
=
1
;
i
<
MAXPOW
;
i
++
)
pow_2
[
i
]
=
pow_2
[
i
-
1
]
*
2
;
pow_4
[
0
]
=
1
;
for
(
i
=
1
;
i
<
MAXPOW
;
i
++
)
pow_4
[
i
]
=
pow_4
[
i
-
1
]
*
4
;
if
((
data
=
(
struct
complex
*
)
malloc
(
sizeof
(
struct
complex
)
*
(
size_t
)
N
))
==
NULL
)
{
fprintf
(
stderr
,
"Out of memory!
\n
"
);
exit
(
1
);
}
if
((
data16
=
(
struct
complex16
*
)
malloc16
(
sizeof
(
struct
complex16
)
*
(
size_t
)
N
))
==
NULL
)
{
fprintf
(
stderr
,
"Out of memory!
\n
"
);
exit
(
1
);
}
if
((
data16_out
=
(
struct
complex16
*
)
malloc16
(
2
*
sizeof
(
struct
complex16
)
*
(
size_t
)
N
))
==
NULL
)
{
fprintf
(
stderr
,
"Out of memory!
\n
"
);
exit
(
1
);
}
printf
(
"res_%d = [
\n
"
,
N
);
for
(
input_dB
=-
60
;
input_dB
<
0
;
input_dB
++
)
{
maxSNR
=
-
1000
;
fft_distortion_test
(
N
,
test
,
input_dB
,
data
,
data16
,
data16_out
,
local_rev
);
sprintf
(
fname
,
"fftoutput_m%d.m"
,(
int
)
abs
(
input_dB
));
sprintf
(
vname
,
"fftout_m%d"
,(
int
)
abs
(
input_dB
));
write_output
(
fname
,
vname
,
(
int16_t
*
)
data16_out
,
N
*
2
,
2
,
1
);
sprintf
(
fname
,
"fftinput_m%d.m"
,(
int
)
abs
(
input_dB
));
sprintf
(
vname
,
"fftin_m%d"
,(
int
)
abs
(
input_dB
));
write_output
(
fname
,
vname
,
(
int16_t
*
)
data16
,
N
,
1
,
1
);
}
}
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment