Recursive algorithm to directly obtain the sum of correlations in a CSS
DOI10.1016/J.SIGPRO.2010.12.010zbMATH Open1219.94024DBLPjournals/sigpro/MarzianiUHGAJP11OpenAlexW1978018659WikidataQ59397975 ScholiaQ59397975MaRDI QIDQ548929FDOQ548929
Authors: Carlos De Marziani, J. Ureña, Álvaro Hernández, Juan Jesús García, Fernando Alvarez, Ana Jiménez, Ma Carmen Pérez
Publication date: 30 June 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.12.010
Recommendations
- Algorithm of equal line sum decomposition for sample correlation coefficient matrix
- From Bareiss' algorithm to the stable computation of partial correlations
- Correlated sums of \(r(n)\)
- scientific article; zbMATH DE number 2070573
- scientific article; zbMATH DE number 3967741
- AN ALGORITHMIC COMPUTATION OF CORRELATION DIMENSION FROM TIME SERIES
- scientific article; zbMATH DE number 3852947
- A fast algorithm for computing distance correlation
- Computer algebra application to the distribution of sample correlation coefficient
filter bankscorrelatorscode division multiple accesscomplementary set of sequencespulse compression methods
Cites Work
- Modular Architecture for Efficient Generation and Correlation of Complementary Set of Sequences
- Complementary sets of sequences
- A multicarrier DS/SSMA system with reduced multiple access interference and higher data rate in Rician fading channels
- A review on multiple access interference cancellation and avoidance for IR-UWB
- A new class of interlaced complementary codes based on components with unity peak sidelobes
Cited In (1)
This page was built for publication: Recursive algorithm to directly obtain the sum of correlations in a CSS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548929)