Results 21 to 30 of about 378,239 (243)
Simple Controllers for Wave Energy Devices Compared
Journal of Marine Science and Engineering, 2020 The design of controllers for wave energy devices has evolved from early monochromatic impedance-matching methods to complex numerical algorithms that can handle panchromatic seas, constraints, and nonlinearity. However, the potential high performance of
Demián García-Violini +3 more
doaj +1 more source
Flexible soft-output decoding of polar codes
EURASIP Journal on Wireless Communications and Networking, 2021 In this research, we study soft-output decoding of polar codes. Two representative soft-output decoding algorithms are belief propagation (BP) and soft cancellation (SCAN).
Sunghoon Lee +3 more
doaj +1 more source
Compressive Parameter Estimation for Sparse Translation-Invariant Signals Using Polar Interpolation [PDF]
, 2015 We propose new compressive parameter estimation algorithms that make use of polar interpolation to improve the estimator precision. Our work extends previous approaches involving polar interpolation for compressive parameter estimation in two aspects: (i)
Duarte, Marco F. +2 more
core +3 more sources
Journal of Applied Mathematics, 2022 Numerical computation of maximum likelihood estimates (MLE) is one of the most common problems encountered in applied statistics. Even if there exist many algorithms considered as performing, they can suffer in some cases for one or many of the following
Issa Cherif Geraldo
doaj +1 more source
An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
Mathematics, 2022 Binary sequences are algebraic structures currently used as security elements in Internet of Things devices, sensor networks, e-commerce, and cryptography. In this work, a contribution to the evaluation of such sequences is introduced.
Amparo Fúster-Sabater +2 more
doaj +1 more source
Models of Computer Calculations
Кібернетика та комп'ютерні технології, 2022 Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used ...
Valerii Zadiraka +2 more
doaj +1 more source
Improved Massive MIMO RZF Precoding Algorithm Based on Truncated Kapteyn Series Expansion
Information, 2019 In order to reduce the computational complexity of the inverse matrix in the regularized zero-forcing (RZF) precoding algorithm, this paper expands and approximates the inverse matrix based on the truncated Kapteyn series expansion and the corresponding ...
Xiaomei Xue +6 more
doaj +1 more source
Approximation of high-dimensional parametric PDEs [PDF]
, 2015 Parametrized families of PDEs arise in various contexts such as inverse problems, control and optimization, risk assessment, and uncertainty quantification. In most of these applications, the number of parameters is large or perhaps even infinite.
Cohen, Albert, Devore, Ronald
core +4 more sources
Info-Greedy sequential adaptive compressed sensing [PDF]
, 2015 We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements.
Braun, Gabor +2 more
core +1 more source
Low Complexity Decoding Algorithms for Rate Compatible Modulation
IEEE Access, 2018 Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of ...
Fang Lu +3 more
doaj +1 more source