Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
B-ASIC - Better ASIC Toolbox
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Computer Engineering
B-ASIC - Better ASIC Toolbox
Merge requests
!462
Add SFG generator for DIF FFT
Code
Review changes
Check out branch
Download
Patches
Plain diff
Merged
Add SFG generator for DIF FFT
add-fft-generator-2
into
master
Overview
1
Commits
3
Pipelines
2
Changes
3
Merged
Simon Bjurek
requested to merge
add-fft-generator-2
into
master
2 months ago
Overview
1
Commits
3
Pipelines
2
Changes
3
Expand
0
0
Merge request reports
Compare
master
version 1
30719d0b
2 months ago
master (base)
and
latest version
latest version
f0a7458a
3 commits,
2 months ago
version 1
30719d0b
2 commits,
2 months ago
3 files
+
260
−
2
Inline
Compare changes
Side-by-side
Inline
Show whitespace changes
Show one file at a time
Files
3
Search (e.g. *.vue) (Ctrl+P)
b_asic/sfg_generators.py
+
123
−
1
Options
@@ -4,12 +4,13 @@ B-ASIC signal flow graph generators.
This module contains a number of functions generating SFGs for specific functions.
"""
from
typing
import
Dict
,
Optional
,
Sequence
,
Union
from
typing
import
TYPE_CHECKING
,
Dict
,
Optional
,
Sequence
,
Union
import
numpy
as
np
from
b_asic.core_operations
import
(
Addition
,
Butterfly
,
ConstantMultiplication
,
Name
,
SymmetricTwoportAdaptor
,
@@ -18,6 +19,9 @@ from b_asic.signal import Signal
from
b_asic.signal_flow_graph
import
SFG
from
b_asic.special_operations
import
Delay
,
Input
,
Output
if
TYPE_CHECKING
:
from
b_asic.port
import
OutputPort
def
wdf_allpass
(
coefficients
:
Sequence
[
float
],
@@ -371,3 +375,121 @@ def direct_form_2_iir(
output
=
Output
()
output
<<=
add
return
SFG
([
input_op
],
[
output
],
name
=
Name
(
name
))
def
radix_2_dif_fft
(
points
:
int
)
->
SFG
:
"""
Generates a radix-2 decimation-in-frequency FFT structure.
Parameters
----------
points : int
Number of points for the FFT, needs to be a positive power of 2.
Returns
-------
SFG
Signal Flow Graph
"""
if
points
<
0
:
raise
ValueError
(
"
Points must be positive number.
"
)
if
points
&
(
points
-
1
)
!=
0
:
raise
ValueError
(
"
Points must be a power of two.
"
)
inputs
=
[]
for
i
in
range
(
points
):
inputs
.
append
(
Input
(
name
=
f
"
Input:
{
i
}
"
))
ports
=
inputs
number_of_stages
=
int
(
np
.
log2
(
points
))
twiddles
=
_generate_twiddles
(
points
,
number_of_stages
)
for
stage
in
range
(
number_of_stages
):
ports
=
_construct_dif_fft_stage
(
ports
,
number_of_stages
,
stage
,
twiddles
[
stage
]
)
ports
=
_get_bit_reversed_ports
(
ports
)
outputs
=
[]
for
i
,
port
in
enumerate
(
ports
):
outputs
.
append
(
Output
(
port
,
name
=
f
"
Output:
{
i
}
"
))
return
SFG
(
inputs
=
inputs
,
outputs
=
outputs
)
def
_construct_dif_fft_stage
(
ports_from_previous_stage
:
list
[
"
OutputPort
"
],
number_of_stages
:
int
,
stage
:
int
,
twiddles
:
list
[
np
.
complex128
],
):
ports
=
ports_from_previous_stage
.
copy
()
number_of_butterflies
=
len
(
ports
)
//
2
number_of_groups
=
2
**
stage
group_size
=
number_of_butterflies
//
number_of_groups
for
group_index
in
range
(
number_of_groups
):
for
bf_index
in
range
(
group_size
):
input1_index
=
group_index
*
2
*
group_size
+
bf_index
input2_index
=
input1_index
+
group_size
input1
=
ports
[
input1_index
]
input2
=
ports
[
input2_index
]
butterfly
=
Butterfly
(
input1
,
input2
)
output1
,
output2
=
butterfly
.
outputs
twiddle_factor
=
twiddles
[
bf_index
]
if
twiddle_factor
!=
1
:
name
=
_get_formatted_complex_number
(
twiddle_factor
,
2
)
twiddle_mul
=
ConstantMultiplication
(
twiddles
[
bf_index
],
output2
,
name
=
name
)
output2
=
twiddle_mul
.
output
(
0
)
ports
[
input1_index
]
=
output1
ports
[
input2_index
]
=
output2
return
ports
def
_get_formatted_complex_number
(
number
:
np
.
complex128
,
digits
:
int
)
->
str
:
real_str
=
str
(
np
.
round
(
number
.
real
,
digits
))
imag_str
=
str
(
np
.
round
(
number
.
imag
,
digits
))
if
number
.
imag
==
0
:
return
real_str
elif
number
.
imag
>
0
:
return
f
"
{
real_str
}
+ j
{
imag_str
}
"
else
:
return
f
"
{
real_str
}
- j
{
str
(
-
np
.
round
(
number
.
imag
,
digits
))
}
"
def
_get_bit_reversed_number
(
number
:
int
,
number_of_bits
:
int
)
->
int
:
reversed_number
=
0
for
i
in
range
(
number_of_bits
):
# mask out the current bit
shift_num
=
number
current_bit
=
(
shift_num
>>
i
)
&
1
# compute the position of the current bit in the reversed string
reversed_pos
=
number_of_bits
-
1
-
i
# place the current bit in that position
reversed_number
|=
current_bit
<<
reversed_pos
return
reversed_number
def
_get_bit_reversed_ports
(
ports
:
list
[
"
OutputPort
"
])
->
list
[
"
OutputPort
"
]:
num_of_ports
=
len
(
ports
)
bits
=
int
(
np
.
log2
(
num_of_ports
))
return
[
ports
[
_get_bit_reversed_number
(
i
,
bits
)]
for
i
in
range
(
num_of_ports
)]
def
_generate_twiddles
(
points
:
int
,
number_of_stages
:
int
)
->
list
[
np
.
complex128
]:
twiddles
=
[]
for
stage
in
range
(
1
,
number_of_stages
+
1
):
stage_twiddles
=
[]
for
k
in
range
(
points
//
2
**
(
stage
)):
a
=
2
**
(
stage
-
1
)
twiddle
=
np
.
exp
(
-
1j
*
2
*
np
.
pi
*
a
*
k
/
points
)
stage_twiddles
.
append
(
twiddle
)
twiddles
.
append
(
stage_twiddles
)
return
twiddles
Loading