Results 31 to 40 of about 57,732 (152)
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
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
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
Low Complexity Iterative Algorithms in Channel Coding and Compressed Sensing
, 2013 Iterative algorithms are now widely used in all areas of signal processing and digital communications. In modern communication systems, iterative algorithms are notably used for decoding low-density parity-check (LDPC) codes, a popular class of error ...
Danjean, Ludovic
core +5 more sources
Low Complexity Equalization of Orthogonal Chirp Division Multiplexing in Doubly-Selective Channels
Sensors, 2020 Orthogonal Chirp Division Multiplexing (OCDM) is a modulation scheme which outperforms the conventional Orthogonal Frequency Division Multiplexing (OFDM) under frequency selective channels by using chirp subcarriers.
Xin Wang, Zhe Jiang, Xiao-Hong Shen
doaj +1 more source
Hyperspectral image compression : adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding [PDF]
, 2008 Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability to a wide range of data, while being of reasonable complexity.
Christophe, Emmanuel +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
Secure Resource Allocation for Cooperative OFDMA System With Untrusted AF Relaying
IEEE Access, 2021 In this paper, we consider a cooperative orthogonal frequency division multiple access (OFDMA) system, where a source communicates with multiple users with the help of an untrusted relay.
Yifeng Jin +4 more
doaj +1 more source
Fifty years of scheduling: a survey of milestones [PDF]
, 2009 Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A. +5 more
core +1 more source