Filters








79,794 Hits in 2.1 sec

Efficient Gauss-Seidel Precoding with Parallel Calculation in Massive MIMO Systems

Hyun-Sun Hwang, Jae-Hyun Ro, Chan-Yeob Park, Young-Hwan You, Hyoung-Kyu Song
2022 Computers Materials & Continua  
In massive MIMO systems, the exact inversion of channel matrix is impractical due to the severe computational complexity.  ...  The HGS with proper number of parallelly computed symbols has better performance and reduced required time compared to the traditional GS.  ...  The precoding symbols which are computed without feedback have to be chosen for parallel calculation. Therefore, the criterion for choosing the precoding symbols without feedback has to be defined.  ... 
doi:10.32604/cmc.2022.019397 fatcat:cytjbbnq6vhmlbqlwx4553tqqa

Accelerating Channel Estimation and Demodulation of Uplink OFDM symbols for Large Scale Antenna Systems using GPU [article]

Bhargav Gokalgandhi, Christina Segerholm, Nilanjan Paul, Ivan Seskar
2019 arXiv   pre-print
Acceleration for Least Squares channel estimation and demodulation of uplink OFDM symbols is provided by using a combination of CPU and GPU at the back-end.  ...  For FFT, the batch based FFT functions are used to accelerate the processing and FFTs for symbols of all antennas are computed in parallel.  ...  This chip has a CUDA compute capability of 3.5 which adds features such as dynamic parallelism and Hyper-Q.  ... 
arXiv:1901.07499v2 fatcat:p5qyy7dr5fcnfawqsskm3dkrmu

Massive parallelism for artificial intelligence (extended abstract)

Luc Steels
1987 Microprocessing and Microprogramming  
attempting to explore massive parallelism for Artificial Intelligence.  ...  One example of this is a model of subsymbolic computation where symbols or rules are represented as groups of particles moving in computation space (Steels, 1987a) .  ... 
doi:10.1016/0165-6074(87)90011-1 fatcat:r7ag2bewcvhajeobqtovwhdcau

Deep Learning-Based Decoding and AP Selection for Radio Stripe Network

Aman Kumar Mishra, Vijayakumar Ponnusamy
2022 Intelligent Automation and Soft Computing  
In this paper, we propose DNN Based Parallel Decoding in Radio Stripe (DNNBPDRS) to decode the symbols of User Equipments (UEs) in the uplink in a parallel fashion to reduce computational complexity by  ...  The proposed DNNBPDRS framework not only improves Symbol Error Rate (SER) performance when compared to counterparts but is also proved to be comparatively far lesser computational complex.  ...  For a given transmitted symbol vector S, all SENs across all APs are trained in a parallel fashion.  ... 
doi:10.32604/iasc.2022.021017 fatcat:j3wed74lr5amvgcb3sfeaq2ndq

Page 3925 of Mathematical Reviews Vol. , Issue 93g [page]

1993 Mathematical Reviews  
[Basu, Arup] A parallel algorithm for elimination tree computation and symbolic factorization. (English summary) Parallel Comput. 18 (1992), no. 8, 849-856.  ...  An existing parallel algorithm for symbolic factor- ization [A. George et al., Parallel Comput. 5 (1987), no. 1-2, 85-95] requires the computation of the elimination tree separately.  ... 

Using Arithmetic Coding for Reduction of Resulting Simulation Data Size on Massively Parallel GPGPUs [chapter]

Ana Balevic, Lars Rockstroh, Marek Wroblewski, Sven Simon
2008 Lecture Notes in Computer Science  
massively-parallel cards remain the major bottle necks.  ...  The popularity of parallel platforms, such as general purpose graphics processing units (GPGPUs) for large-scale simulations is rapidly increasing, however the I/O bandwidth and storage capacity of these  ...  With recent advances in development of massively parallel graphics cards suitable for general purpose computations (GPGPUs) and their general affordability, with prices as low as $400 per unit (2008) featuring  ... 
doi:10.1007/978-3-540-87475-1_40 fatcat:43xxqkrpfreo7boigcqoe7g4pq

A Proximal Jacobian ADMM Approach for Fast Massive MIMO Signal Detection in Low-Latency Communications

Anis Elgabli, Ali Elghariani, Vaneet Aggarwal, Mehdi Bennis, Mark R. Bell
2019 ICC 2019 - 2019 IEEE International Conference on Communications (ICC)  
Each vector represents the contribution of one of the transmitted symbols in the received vector.  ...  In this paper, we focus on the physical layer, and in particular, we propose a novel formulation of the massive MIMO uplink detection problem.  ...  Thus, from this perspective, to reduce the computational complexity, linear MMSE detection scheme is widely considered, but this scheme involves matrix inversion which is computationally costly.  ... 
doi:10.1109/icc.2019.8761844 dblp:conf/icc/ElgabliEABB19 fatcat:vx2irox3kfardbe4gd4k3elt7y

A Proximal Jacobian ADMM Approach for Fast Massive MIMO Signal Detection in Low-Latency Communications [article]

Anis Elgabli, Ali Elghariani, Vaneet Aggarwal, Mehdi Bennis, Mark R. Bell
2019 arXiv   pre-print
Each vector represents the contribution of one of the transmitted symbols in the received vector.  ...  In this paper, we focus on the physical layer, and in particular, we propose a novel formulation of the massive MIMO uplink detection problem.  ...  Thus, from this perspective, to reduce the computational complexity, linear MMSE detection scheme is widely considered, but this scheme involves matrix inversion which is computationally costly.  ... 
arXiv:1903.00738v1 fatcat:qqrsdsi4ojb4lppxytuiofdlze

A massively parallel algorithm for constructing the BWT of large string sets [article]

Jacopo Pantaleoni
2014 arXiv   pre-print
The algorithm is designed for massive parallelism and can effectively exploit the combination of low capacity high bandwidth memory and slower external system memory typical of GPU accelerated systems.  ...  Given that deep memory hierarchies are becoming a pervasive trait of high performance computing architectures, we believe this to be a relevant feature.  ...  This gives us a simple recipe for a massively parallel implementation of ComputeRanks, in Algorithm 2.  ... 
arXiv:1410.0562v1 fatcat:y6y4cvxcafg2xf7su3kchmjvne

Parallel versions of the symbolic manipulation system FORM [article]

M. Tentyukov, J.A.M. Vermaseren, J. Vollinga
2010 arXiv   pre-print
We have now two parallel versions of FORM, one is based on POSIX threads and is optimal for modern multicore computers while another one uses MPI and can be used to parallelize FORM on clusters and Massive  ...  The symbolic manipulation program FORM is specialized to handle very large algebraic expressions. Some specific features of its internal structure make FORM very well suited for parallelization.  ...  We have now two parallel versions of FORM, one is based on POSIX threads and is optimal for modern multicore computers while another one uses MPI and can be used to parallelize FORM on clusters and Massive  ... 
arXiv:1006.2099v1 fatcat:d6wu2e2qc5aldfvtvp3yhffedy

Membrane Computing as Multi Turing Machines

Mahmoud Abdelaziz, Amr Badr, Ibrahim Farag
2012 International Journal of Applied Information Systems  
These systems are a class of distributed systems, maximally parallel computing devices of a biochemical type.  ...  A Turing machine (TM) can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer.  ...  These systems are computational equivalent to Turing machines, however, it's distributed and massively parallel.  ... 
doi:10.5120/ijais12-450764 fatcat:bjnmmvoifzdetip3upbrfhlurq

A Look Back at Some Early Results in Membrane Computing [chapter]

Oscar H. Ibarra
2010 Lecture Notes in Computer Science  
Due to the built-in nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve  ...  The objects can be described by symbols or by strings of symbols, and multisets of these objects are placed in the regions of the membrane structure.  ...  Due to the built-in nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve  ... 
doi:10.1007/978-3-642-11467-0_6 fatcat:uogszbxl4jeclgemexv7fwnxci

Toward Flexible Intelligence: MITI's New Program of Real World Computing

Nobuyuki Otsu
1993 International Joint Conference on Artificial Intelligence  
The outline and concepts of the new 10 year Japanese project called "Real World Computing program" will be introduced.  ...  It is the successor to the Fifth Generation Computer project and aims at theoretical and technological foundation for human-like flexible information processing and intelligence toward the highly information-based  ...  . • General-purpose massively parallel computing systems • Neural computing systems • Optical computing systems Massively parallel systems Implementation of RWC applications is likely to need a computing  ... 
dblp:conf/ijcai/Otsu93 fatcat:zor24527ufe3rfbm5yuz53qnoa

Distributed Resource Reservation in Massively Parallel Processor Arrays

Vahid Lari, Frank Hannig, Jurgen Teich
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
parallelism or dynamic computing requirements.  ...  This paper proposes a methodology for applications to automatically claim linear arrays of processing elements within massively parallel processor arrays at run-time depending on the available degree of  ...  degree of parallelism or dynamic computing requirements.  ... 
doi:10.1109/ipdps.2011.157 dblp:conf/ipps/LariHT11 fatcat:lasynwmsffa7feluicosuqrghy

Physics-Inspired Heuristics for Soft MIMO Detection in 5G New Radio and Beyond [article]

Minsung Kim, Salvatore Mandrà, Davide Venturelli, Kyle Jamieson
2021 arXiv   pre-print
base station antennas, in order to support even more parallel spatial streams.  ...  1.4x throughput than linear detector-based Massive MIMO systems.  ...  However, the calculation of the partition function Z, and thus (s), is computationally challenging, particularly for low temperatures.  ... 
arXiv:2103.10561v1 fatcat:5j2rxerc7ja5xe4lxhwntqqzye
« Previous Showing results 1 — 15 out of 79,794 results