2016 International Siberian Conference on Control and Communications (SIBCON) 2016
DOI: 10.1109/sibcon.2016.7491652
|View full text |Cite
|
Sign up to set email alerts
|

Executing discrete orthogonal transformations based on computations on the Galois field in the FPGA architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…At present, intensive studies are carried out in the following areas of DSP algorithm efficiency increase. The first one is the development of the applied theory of DOT in the direction of the development of algorithms that are computationally effective (fast algorithms, the algorithms with reduced computational complexity, balanced computational complexity algorithms), and hardware algorithms oriented to the implementation in the form of specialized computing devices [13,14]. It should be noted that a wide application during the solution of a number of DSP problems are found by DOT in various ordered systems of discrete Walsh functions [4][5][6][7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…At present, intensive studies are carried out in the following areas of DSP algorithm efficiency increase. The first one is the development of the applied theory of DOT in the direction of the development of algorithms that are computationally effective (fast algorithms, the algorithms with reduced computational complexity, balanced computational complexity algorithms), and hardware algorithms oriented to the implementation in the form of specialized computing devices [13,14]. It should be noted that a wide application during the solution of a number of DSP problems are found by DOT in various ordered systems of discrete Walsh functions [4][5][6][7].…”
Section: Introductionmentioning
confidence: 99%
“…The second direction is related to the implementation of computationally time-consuming operations, such as multiplication by a constant, based on operations for Galois field [14]. It was shown in [15,16] that the set of operations of multiplication (OY) on a constant is realizable at the use of distributed computations, namely, the system of nonlinear polynomial functions (NPF) from many variables in respect of Galois field of the form…”
Section: Introductionmentioning
confidence: 99%