Filters








103,694 Hits in 3.3 sec

Parallel implementation of the steepest descent fast multipole method (SDFMM) on a Beowulf cluster for subsurface sensing applications

D. Jiang, W. Meleis, M. El-Shenawee, E. Mizan, M. Ashouei, C. Rappaport
2002 IEEE Microwave and Wireless Components Letters  
The SDFMM is a fast algorithm that is a hybridization of the Method of Moment (MoM), the Fast Multipole Method (FMM) and the Steepest Descent Integration rule (SDP), which is used to solve large−scale  ...  We present the parallel, MPI−based implementation of the SDFMM computer code using a thirty two−node Intel Pentium−based Beowulf cluster.  ...  This research was sponsored by the ERC Program of the NSF under award number EEC−9986821, in  ... 
doi:10.1109/7260.975724 fatcat:s4hymlljevebxptwgpihgr2xhq

Hierarchical Matrix-Matrix Multiplication Based on Multiprocessor Tasks [chapter]

Sascha Hunold, Thomas Rauber, Gudula Rünger
2004 Lecture Notes in Computer Science  
We consider the realization of matrix-matrix multiplication and propose a hierarchical algorithm implemented in a task-parallel way using multiprocessor tasks on distributed memory.  ...  The task-parallel realization makes the algorithm especially suited for cluster of SMPs since tasks can then be mapped to the different cluster nodes in order to efficiently exploit the cluster architecture  ...  Task Parallel Implementation The realization of the task parallel matrix multiplication (tpMM ) is based on a hierarchy of multiprocessor groups.  ... 
doi:10.1007/978-3-540-24687-9_1 fatcat:ogm27c5efjddrfzk7c3ec2bpzi

Page 141 of International Journal of Optical Computing Vol. 1, Issue 2 [page]

1990 International Journal of Optical Computing  
The search for a simple and fast method of realization of the shift operation is going on at present.  ...  of relative simplicity and high speed of analogue multiplication with sufficiently high parallelism of data access.  ... 

Comparative Analysis of Design Methodologies for Parallel FIR Filter

Nongmaithem LalleimaChanu, Bidyalaxmi Devi Tensubam, Vimal Kant Pandey
2014 International Journal of Computer Applications  
This review paper deal with the design and implementation of parallel FIR filter structure on FPGA using 4 different parallel processing methodologies with minimal cost of hardware.  ...  The paper hence describes the comparative performance analysis of traditional parallel FIR filter with respect to the FFA, transposition and symmetric convolution based parallel FIR filter with featuring  ...  The general matrix form of parallel filtering operation to derive another parallel filter using transpose operation is Y=HX, where H is an L L matrix.  ... 
doi:10.5120/17158-7212 fatcat:vejvwqamurak3guhetzl25pjny

Page 2900 of Mathematical Reviews Vol. , Issue 90E [page]

1990 Mathematical Reviews  
—7 multiplications; and (iii) a tridiagonal matrix using 7n —8 multiplications.  ...  In §6 the parallel algorithms realizable on SIMD systems for the implementation of the discrete orthogonal transforms relative to the bases Hy and & are presented and discussed.  ... 

Performance Analysis of Parallel FIR Digital Filter using VHDL

S. Balasubramaniam, R. Bharathi
2012 International Journal of Computer Applications  
International Journal of Computer Applications (0975 -8887) Volume 39-No.9, February 2012 Fast convolution algorithm to decompose the convolution matrix with simple Pre addition and Post addition matrix  ...  Simple pre addition and post Addition matrix, when L is large ISCA based parallel filter involves many sub filters; require many multiplications [4] .  ... 
doi:10.5120/4845-7109 fatcat:v4ccylujgvdrzegry22cwat3na

Page 1628 of Mathematical Reviews Vol. , Issue 94c [page]

1994 Mathematical Reviews  
Summary: “Matrix algorithms are proposed for the fast Fourier transformation that constitute a natural generalization of the fa- miliar numerical algorithms.  ...  It is shown that realization of such algorithms on matrix computers ensures a significant increase in computational efficiency.” 94c:65173 65T20 65Y05 Zeng, Yong Hong (PRC-NUDT; Changsha); Jiang, Zeng  ... 

Software-Based Parallel Cryptographic Solution with Massive-Parallel Memory-Embedded SIMD Matrix Architecture for Data-Storage Systems

Takeshi KUMAKI, Tetsushi KOIDE, Hans Jürgen MATTAUSCH, Masaharu TAGAMI, Masakatsu ISHIZAKI
2011 IEICE transactions on information and systems  
The massive-parallel memory-embedded SIMD matrix architecture (MTX and MX-2) is therefore a promising solution for integrated realization of real-time cryptographic algorithms with low power dissipation  ...  Since both arithmetic logical operation and table-lookup coding execute extremely fast on these architectures, efficient execution of encryption and decryption algorithms can be realized.  ...  Part of this work has been supported by the program "Interdisciplinary Research on Integration of Semiconductor and Biotechnology" for "Creation of Innovation Centers for Advanced Interdisciplinary Research  ... 
doi:10.1587/transinf.e94.d.1742 fatcat:ccjkqgp64bhj3agq5f6qpuk45y

Fast Convolution based on Winograd Minimum Filtering: Introduction and Development [article]

Gan Tong, Libo Huang
2021 arXiv   pre-print
Therefore, Winograd convolution has quickly become the first choice for fast convolution implementation within a few years. At present, there is no systematic summary of the convolution algorithm.  ...  In recent years, researchers have proposed several fast convolution algorithms including FFT and Winograd.  ...  [35] , [73] , [74] , [75] unified the realization of the Winograd convolution kernel matrix multiplication and maximize the reusability of the module.  ... 
arXiv:2111.00977v1 fatcat:gokvwb4x6vhztgkt54wtwqeske

PERFORMANCE EVALUATION OF LARGER MATRICES OVER CLUSTER OF FOUR NODES USING MPI

Sampath S .
2014 International Journal of Research in Engineering and Technology  
This can be realized by implementing the parallel applications like solving matrix multiplication problem, using MPI.  ...  The results with runs on different number of nodes are compared to evaluate the efficiency of MPI based parallel applications.  ...  experimental results regarding the performance issues of matrix parallel multiplication algorithms.  ... 
doi:10.15623/ijret.2014.0311091 fatcat:jggwjytpt5cnpbimgquhspvsq4

Research on FFT Algorithm Use SMP System

Bingfeng Qian, Yize Sun, Qian Zhang
2020 International Journal of Information and Communication Sciences  
In this paper, through analyzing the characteristics of a symmetric multi-processor (SMP) parallel processing system, the very large FFT fast algorithm (VLFFT) is proposed.  ...  Fast Fourier transform (FFT) is an essential process in this implementation. With the development of array antennas, the number of points to be calculated by the FFT has also increased significantly.  ...  Acknowledgements This paper is supported by Shanghai Municipal Education Commission, The construction of experimental technical team in Colleges and Universities (No. 14SY08).  ... 
doi:10.11648/j.ijics.20200501.11 fatcat:zznrhrhnarc2xa4qqdh6iorggu

Page 1113 of Mathematical Reviews Vol. , Issue 87b [page]

1987 Mathematical Reviews  
The method proposed here creates realizations which have parallel structure and high throughput rates. It is shown that such realizations are suitable to VLSI implementation.  ...  Author summary: “We describe a method of doing spectral filter- ing using the fast Walsh transform (FWT) rather than the fast Fourier transform (FFT).  ... 

An efficient architecture for multi-dimensional convolution

A. Elnaggar, M. Aboelaze
2000 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
This paper presents modified parallel architectures for multidimensional ( -d) convolution.  ...  Moreover, the original speed of the computations is not affected.  ...  The authors are with the School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore (e-mail: eyhzeng@ntu.edu.sg; egbi@ntu.edu.sg; eackot@ntu.edu.sg).  ... 
doi:10.1109/82.899645 fatcat:anrog2dfv5a5focktuhzwozxau

An Introduction of Multiple P-adic Data Type and Its Parallel Implementation

Chao Lu, Xinkai Li
2015 International Journal of Networked and Distributed Computing (IJNDC)  
With this data type all rational number operations are converted to integer calculations, and the fast integer multiplication of modern computer architectures can be fully taken advantage of.  ...  Based on the Chinese Remainder theorem and the Hensel code a new data type, called Multiple P-adic Data Type, has been established to realize rational calculation.  ...  Most of the linear processes can directly use this data type to realize parallel computing without modification at the mathematical algorithm level.  ... 
doi:10.2991/ijndc.2015.3.1.6 fatcat:an27zjvphbca3od53a7yd3gsie

An introduction of Multiple P-adic Data Type and its parallel implementation

Chao Lu, Xinkai Li
2014 2014 IEEE/ACIS 13th International Conference on Computer and Information Science (ICIS)  
With this data type all rational number operations are converted to integer calculations, and the fast integer multiplication of modern computer architectures can be fully taken advantage of.  ...  Based on the Chinese Remainder theorem and the Hensel code a new data type, called Multiple P-adic Data Type, has been established to realize rational calculation.  ...  Most of the linear processes can directly use this data type to realize parallel computing without modification at the mathematical algorithm level.  ... 
doi:10.1109/icis.2014.6912151 dblp:conf/ACISicis/LuL14 fatcat:dlz4iu2tqbbjxh34ov2jhqn6fi
« Previous Showing results 1 — 15 out of 103,694 results