pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems

2010 ◽  
Author(s):  
Zhimin Chen ◽  
Patrick Schaumont
Keyword(s):  
Software Implementation ◽  
Multicore Systems ◽  
Montgomery Multiplication ◽  
Parallel Software

Realtime parallel software implementation of a DS-CDMA Multiuser Detector

2021 ◽  
Vol 84 ◽  
pp. 104051
Author(s):  
Luís Carlos Gonçalves ◽  
Rui Escadas Martins ◽  
António Brito Ferrari
Keyword(s):  
Software Implementation ◽  
Multiuser Detector ◽  
Parallel Software

Algorithm for optimal allocation of limited resources based on the game iteration method

2019 ◽  
pp. 89-99
Author(s):  
V. Ya. Vilisov
Keyword(s):  
Optimal Control ◽  
Linear Programming ◽  
Embedded Systems ◽  
Iterative Method ◽  
High Speed ◽  
Optimal Allocation ◽  
Software Implementation ◽  
Limited Resources ◽  
Matrix Game ◽  
Acceptable Accuracy

The article proposes an algorithm for solving a linear programming problem (LPP) based on the use of its representation in the form of an antagonistic matrix game and the subsequent solution of the game by an iterative method. The algorithm is implemented as a computer program. The rate of convergence of the estimates of the solution to the actual value with the required accuracy has been studied. The software implementation shows a high speed of obtaining the LPP solution with acceptable accuracy in fractions or units of seconds. This allows the use algorithm in embedded systems for optimal control.

УНИФИЦИРОВАННАЯ РЕКОНФИГУРИРУЕМАЯ СХЕМА КОММУТАЦИИ БПФ

2020 ◽  
Vol 96 (3s) ◽  
pp. 114-118
Author(s):  
П.С. Поперечный ◽  
И.Ю. Поперечная
Keyword(s):  
Software Implementation ◽  
Communication Scheme ◽  
Additional Hardware

Предложен способ вычисления БПФ с унифицированной схемой коммутации от стадии к стадии. Представлено итеративное выражение для аппаратной или программной реализации схемы вычисления. Для предложенных схем описана возможность реконфигурирования для вычисления БПФ различного числа отсчетов, при этом поворотные множители остаются прежними и нет необходимости делать их переменными. The article offers a method for FFT calculation by means of unified communication scheme stage-by-stage. There is an iterating equation for hardware and software implementation. Also, it provides the reconfiguration of schemes by different samples number. The rotating multipliers are the same like in non-reconfigurable (fixed) communication scheme. So, the offered approach does not require additional hardware or software resources.

Sign in / Sign up

Export Citation Format

Share Document