The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Complexity Estimates for Two Uncoupling Algorithms
[article]
2013
arXiv
pre-print
Preserved Fulltext
Other Versions
We examine two approaches to uncoupling: the cyclic-vector method (CVM) and the Danilevski-Barkatou-Z\"urcher algorithm (DBZ). ...
We prove that algorithm CVM is faster than DBZ by almost two orders of magnitude, and provide experimental results that validate the theoretical complexity analyses. ...
Another uncoupling algorithm is part of the work in [1] . We finally briefly analyse in Section 3.5 its complexity to find the same complexity bound as for DBZ. ...
arXiv:1301.5414v2
fatcat:acifekdvmzd5hngx5gra3rfobm
Complexity estimates for two uncoupling algorithms
2013
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation - ISSAC '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Another uncoupling algorithm is part of the work in [1] . We briefly analyse its complexity in §3.5 and obtain the same complexity bound as for DBZ (Theorem 17). ...
In the present article, we examine two uncoupling algorithms: the cyclic-vector method (CVM) [24, 10, 8] and the Danilevski-Barkatou-Zürcher algorithm (DBZ) [12, 5, 30, 6] . ...
doi:10.1145/2465506.2465941
dblp:conf/issac/BostanCP13
fatcat:4l5ah74vsrapxmivgh4tppgjhy
Coupling between time series: A network view
2013
Europhysics letters
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2013 pre-print arXiv:1301.1010v1 fatcat:j7vqoietifetzbkuikuu7zulby
Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. ...
For more clarifying the process, we applied the algorithm to real-world data from the financial trades of two companies, and observed significant small-scale coupling in their dynamics. ...
The cross-visibility algorithm maps two time series, {x i } and {y i }, into two different networks, the cross-visibility networks. The algorithm consists of two major steps: a. ...
doi:10.1209/0295-5075/103/50011
fatcat:etprnhxmljbs5hndisb5bvrelm
A new algorithm of tracking time-varying channels in impulsive noise environment using a robust Kalman filter
2005
2005 International Symposium on Intelligent Signal Processing and Communication Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The uncoupled version of the proposed algorithm has a low implementation complexity and reasonably good performance. ...
We can still see that the algorithm coupled with channel estimation and AR parameter estimation only has a little better result than the uncoupled algorithm (without the AR parameter estimation). ...
doi:10.1109/ispacs.2005.1595389
fatcat:7wfsr4nn2zasfnkfxpcrhwqvee
Performance bounds for coupled models
2016
2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this context, we show that the parameter estimation accuracy under a general class of dataset distributions always improves when compared to an equivalent uncoupled model. ...
Two models are called "coupled" when a non empty set of the underlying parameters are related through a differentiable implicit function. ...
bounds for the estimation of complex coupled CP tensor models. ...
doi:10.1109/sam.2016.7569651
dblp:conf/ieeesam/RenFAC16
fatcat:mljw3islvjhypczsd4vwpbs7om
Partially Connected Feedforward Neural Networks Structured by Input Types
2005
IEEE Transactions on Neural Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
After deriving the mathematical input sensitivity analysis for each IT, several experiments, as well as a real example (blood pressure (BP) estimation), are described to demonstrate how well our method ...
This paper proposes a new method to model partially connected feedforward neural networks (PCFNNs) from the identified input type (IT) which refers to whether each input is coupled with or uncoupled from ...
Fig. 6 . 6 Structure of PCFNN for the diastolic pressure estimation.(
Fig. 7 . 7 Algorithm for splitting test and training data sets.
received December 22, 2002; revised July 8, 2003. ...
doi:10.1109/tnn.2004.839353
pmid:15732397
fatcat:zsco564esrazlfsapd3a6sjai4
Improved Demodulation of Sampled FM Signals in High Noise
1977
IRE Transactions on Communications Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Application of the extended Kalman filtering algorithms to the appropriate signal model directly yields demodulators in which the error covariance equations are uncoupled from the state estimate equations ...
Simulations highlight the attractive trade-offs between demodulation complexity and performance results for this class of demodulator. ...
However, simulation results in [7] indicate that the performance of such uncoupled estimators is not as good as that of the coupled estimators. ...
doi:10.1109/tcom.1977.1093940
fatcat:z7v27rh7ejhxrmpyhrjqwd2ijm
Third-Order Cumulant-Based Wiener Filtering Algorithm Applied To Robust Speech Recognition
1996
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Spectral estimation of speech in AR3_IF algorithm is obtained by means of an AR modelling based on cumulant analysis to provide the desirable noise-speech uncoupling. ...
The use of HO cumulants for speech AR modelling calculation provides the desirable uncoupling between noise and speech. ...
doi:10.5281/zenodo.36308
fatcat:dsplz6gaz5ahlle6yr2tmabswe
Nonlinear System Identification using Uncoupled State Multi-model Approach: Application to the PCB Soldering System
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Precision, simplicity, and fidelity of the obtained results show the effectiveness of the used algorithm to identify, model, and write down as simple sub-systems, a complex black box system. ...
This paper presents nonlinear system identification using an uncoupled state multi-model applied to a Printed Circuit Boards (PCB) soldering system. ...
Uncoupled State Multi-models (Filev) In this type of multi-model, the sub-models are uncoupled [2] , i.e. each sub-model has its own state vector ݔ ሺ݇ሻ, so the dimensions and complexity of the sub-models ...
doi:10.5281/zenodo.3659560
fatcat:rsns64g67zeofah24kc7mq5lwe
Effects of sensor placement on acoustic vector-sensor array performance
1999
IEEE Journal of Oceanic Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then derive a set of necessary and sufficient geometrical constraints for the two direction parameters, azimuth and elevation, to be uncoupled from each other. ...
Ensuring that these parameters are uncoupled minimizes the bound and means they are the natural or "canonical" location parameters for the model. ...
A model for acoustic vector sensors and a simple DOA estimation algorithm for a single sensor were introduced in [1], [2] , preliminary theoretical performance analyses appear in [1] , [2] , [6] , ...
doi:10.1109/48.740154
fatcat:2mfhbyrnmzd6bezy4s5a5xl4cu
Suboptimal space-frequency waveform design for MIMO-OFDM systems
2010
2010 IEEE International Conference on Acoustics, Speech and Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, a new transmit waveform design algorithm for MIMO-OFDM systems is proposed. ...
This suboptimal algorithm significantly simplifies the computational complexity of the optimal joint space-frequency water-filling (JSF-WF) algorithm. ...
It was shown that by transforming the frequency-selective MIMO channel into a number of uncoupled flat-fading SISO channels, the proposed algorithm significantly reduces the complexity of bit and power ...
doi:10.1109/icassp.2010.5496236
dblp:conf/icassp/EisenbergTS10
fatcat:vbdrfrxuqbhjraohqu7gybd77e
Group Delay Management and Multiinput Multioutput Signal Processing in Mode-Division Multiplexing Systems
2016
Journal of Lightwave Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
First, we review the generalized Jones and Stokes representations for modeling propagation in MMF, and describe key GD properties derived using the two representations. ...
This paper addresses the management of GD in MMF and its implications for the complexity and performance of MIMO DSP. ...
For adaptive estimation of the channel transfer function at each frequency, two options are the LMS and recursive least squares (RLS) [13] , [91] algorithms. ...
doi:10.1109/jlt.2016.2530978
fatcat:hhlzyamawbgvzn2ghq6bdh2zhm
Antenna Array Calibration for a General Linear Transformation of the Array Manifold
2019
International Journal of Antennas and Propagation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Algorithms are presented for joint estimation of this matrix and the directions-of-arrival, using data collected during multiple time intervals. ...
A complex matrix is used to map the assumed array manifold to the true array manifold. This matrix may be completely unstructured. ...
We start by demonstrating the performance of the algorithm for estimating the matrix D, see equations (12) and (13) . ...
doi:10.1155/2019/9257853
fatcat:ikuccgy34rgxdmzzbsomaswgle
Adaptive Frequency-Domain Equalization in Mode-Division Multiplexing Systems
2014
Journal of Lightwave Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We study two adaptive algorithms for MIMO FDE: least mean squares (LMS) and recursive least squares (RLS). ...
equalization (TDE) has low complexity and is often employed to compensate for polarization effects. ...
For two mode groups (D = 6), fibers with very low uncoupled GD spread can be realized by choosing a core radius at which the GD-versus-radius curves for the two mode groups intersect [20] . ...
doi:10.1109/jlt.2014.2303079
fatcat:cwlg5yic4vghfkrutxyvurxq6i
Spatially Coupled Serially Concatenated Codes: Performance Evaluation and VLSI Design Tradeoffs
2022
IEEE Transactions on Circuits and Systems Part 1: Regular Papers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To this end, we propose two decoding algorithms for the SC-SCCs: block-wise and windowwise decoders. ...
For these, we present VLSI architectural templates and explore them based on building blocks implemented in 12 nm FinFET technology. ...
LENGTH (C), AND COMPUTATIONAL COMPLEXITY
TABLE III DESIGN III COMPARISON OF VLSI ARCHITECTURES FOR UNCOUPLED AND COUPLED SCC DECODERS TABLE IV COMPONENT DECODER PARAMETERS FOR AREA AND LATENCY ESTIMATION ...
doi:10.1109/tcsi.2022.3149718
fatcat:jqlvqwnfjnci5gcpjp6qydonw4
« Previous
Showing results 1 — 15 out of 21,776 results