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
Commits
76443401
Commit
76443401
authored
1 month ago
by
Simon Bjurek
Browse files
Options
Downloads
Patches
Plain Diff
started work on the generator and added a MADS operation
parent
ff218ffa
No related branches found
Branches containing commit
No related tags found
1 merge request
!470
Add slack time scheduling, redid earliest deadline, added max-fan-out and hybrid scheduler, also added example
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
b_asic/core_operations.py
+70
-0
70 additions, 0 deletions
b_asic/core_operations.py
b_asic/sfg_generators.py
+87
-0
87 additions, 0 deletions
b_asic/sfg_generators.py
with
157 additions
and
0 deletions
b_asic/core_operations.py
+
70
−
0
View file @
76443401
...
...
@@ -1099,6 +1099,76 @@ class MAD(AbstractOperation):
p
.
_index
=
i
class
MADS
(
AbstractOperation
):
__slots__
=
(
"
_is_add
"
,
"
_src0
"
,
"
_src1
"
,
"
_src2
"
,
"
_name
"
,
"
_latency
"
,
"
_latency_offsets
"
,
"
_execution_time
"
,
)
_is_add
:
Optional
[
bool
]
_src0
:
Optional
[
SignalSourceProvider
]
_src1
:
Optional
[
SignalSourceProvider
]
_src2
:
Optional
[
SignalSourceProvider
]
_name
:
Name
_latency
:
Optional
[
int
]
_latency_offsets
:
Optional
[
Dict
[
str
,
int
]]
_execution_time
:
Optional
[
int
]
is_swappable
=
True
def
__init__
(
self
,
is_add
:
Optional
[
bool
]
=
False
,
src0
:
Optional
[
SignalSourceProvider
]
=
None
,
src1
:
Optional
[
SignalSourceProvider
]
=
None
,
src2
:
Optional
[
SignalSourceProvider
]
=
None
,
name
:
Name
=
Name
(
""
),
latency
:
Optional
[
int
]
=
None
,
latency_offsets
:
Optional
[
Dict
[
str
,
int
]]
=
None
,
execution_time
:
Optional
[
int
]
=
None
,
):
"""
Construct a MADS operation.
"""
super
().
__init__
(
input_count
=
3
,
output_count
=
1
,
name
=
Name
(
name
),
input_sources
=
[
src0
,
src1
,
src2
],
latency
=
latency
,
latency_offsets
=
latency_offsets
,
execution_time
=
execution_time
,
)
self
.
_is_add
=
is_add
# self.set_param("is_add", is_add)
@classmethod
def
type_name
(
cls
)
->
TypeName
:
return
TypeName
(
"
mads
"
)
def
evaluate
(
self
,
a
,
b
,
c
):
return
a
+
b
*
c
if
self
.
_is_add
else
a
-
b
*
c
@property
def
is_linear
(
self
)
->
bool
:
return
(
self
.
input
(
0
).
connected_source
.
operation
.
is_constant
or
self
.
input
(
1
).
connected_source
.
operation
.
is_constant
)
def
swap_io
(
self
)
->
None
:
self
.
_input_ports
=
[
self
.
_input_ports
[
1
],
self
.
_input_ports
[
0
],
self
.
_input_ports
[
2
],
]
for
i
,
p
in
enumerate
(
self
.
_input_ports
):
p
.
_index
=
i
class
SymmetricTwoportAdaptor
(
AbstractOperation
):
r
"""
Wave digital filter symmetric twoport-adaptor operation.
...
...
This diff is collapsed.
Click to expand it.
b_asic/sfg_generators.py
+
87
−
0
View file @
76443401
...
...
@@ -9,10 +9,14 @@ from typing import TYPE_CHECKING, Dict, Optional, Sequence, Union
import
numpy
as
np
from
b_asic.core_operations
import
(
MADS
,
Addition
,
Butterfly
,
ComplexConjugate
,
Constant
,
ConstantMultiplication
,
Name
,
Reciprocal
,
SymmetricTwoportAdaptor
,
)
from
b_asic.signal
import
Signal
...
...
@@ -432,6 +436,69 @@ def radix_2_dif_fft(points: int) -> SFG:
return
SFG
(
inputs
=
inputs
,
outputs
=
outputs
)
def
ldlt_matrix_inverse
(
N
:
int
,
is_complex
:
bool
)
->
SFG
:
inputs
=
[]
A
=
[[
None
for
_
in
range
(
N
)]
for
_
in
range
(
N
)]
for
i
in
range
(
N
):
for
j
in
range
(
i
,
N
):
in_op
=
Input
()
A
[
i
][
j
]
=
in_op
inputs
.
append
(
in_op
)
D
=
[
None
for
_
in
range
(
N
)]
for
i
in
range
(
N
):
D
[
i
]
=
A
[
i
][
i
]
D_inv
=
[
None
for
_
in
range
(
N
)]
R
=
[[
None
for
_
in
range
(
N
)]
for
_
in
range
(
N
)]
M
=
[[
None
for
_
in
range
(
N
)]
for
_
in
range
(
N
)]
# R*di*R^T factorization
for
i
in
range
(
N
):
for
k
in
range
(
1
,
i
):
D
[
i
]
=
MADS
(
False
,
D
[
i
],
M
[
k
][
i
],
R
[
k
][
i
])
D_inv
[
i
]
=
Reciprocal
(
D
[
i
])
for
j
in
range
(
i
,
N
):
R
[
i
][
j
]
=
A
[
i
][
j
]
for
k
in
range
(
1
,
i
):
R
[
i
][
j
]
=
MADS
(
False
,
R
[
i
][
j
],
M
[
k
][
i
],
R
[
k
][
j
])
if
is_complex
:
M
[
i
][
j
]
=
ComplexConjugate
(
R
[
i
][
j
])
else
:
M
[
i
][
j
]
=
R
[
i
][
j
]
R
[
i
][
j
]
=
MADS
(
True
,
Constant
(
0
,
name
=
"
0
"
),
R
[
i
][
j
],
D_inv
[
i
])
# back substitution
A_inv
=
[[
None
for
_
in
range
(
N
)]
for
_
in
range
(
N
)]
for
i
in
reversed
(
range
(
N
)):
A_inv
[
i
][
i
]
=
D_inv
[
i
]
for
j
in
reversed
(
range
(
i
)):
for
k
in
reversed
(
range
(
j
,
N
)):
if
k
==
N
-
1
and
i
!=
j
:
# my custom
if
A_inv
[
k
][
i
]:
A_inv
[
j
][
i
]
=
MADS
(
False
,
Constant
(
0
,
name
=
"
0
"
),
R
[
j
][
k
],
A_inv
[
k
][
i
]
)
else
:
A_inv
[
j
][
i
]
=
Constant
(
0
,
name
=
"
0
"
)
else
:
A_inv
[
j
][
i
]
=
MADS
(
False
,
A_inv
[
j
][
i
],
R
[
j
][
k
],
A_inv
[
k
][
i
])
outputs
=
[]
for
i
in
range
(
N
):
for
j
in
range
(
i
,
N
):
outputs
.
append
(
Output
(
A_inv
[
i
][
j
]))
return
SFG
(
inputs
,
outputs
)
def
_construct_dif_fft_stage
(
ports_from_previous_stage
:
list
[
"
OutputPort
"
],
number_of_stages
:
int
,
...
...
@@ -465,6 +532,26 @@ def _construct_dif_fft_stage(
return
ports
def
_extract_diagonal
(
elems
):
n
=
0
k
=
0
while
k
<=
len
(
elems
):
k
+=
n
+
1
n
+=
1
n
-=
1
k
-=
n
+
1
if
k
!=
len
(
elems
):
return
None
diagonal
=
np
.
zeros
(
n
)
index
=
0
for
i
in
range
(
n
):
diagonal
[
n
]
=
elems
[
index
]
index
+=
i
+
2
return
diagonal
def
_get_bit_reversed_number
(
number
:
int
,
number_of_bits
:
int
)
->
int
:
reversed_number
=
0
for
i
in
range
(
number_of_bits
):
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment