Zobrazeno 1 - 10
of 2 313
pro vyhledávání: '"San-Jose P"'
Predictions of topological p-wave superconductivity and Majorana zero modes (MZMs) in hybrid superconductor-semiconductor nanowires have been difficult to realize experimentally. Consequently, researchers are actively exploring alternative platforms
Externí odkaz:
http://arxiv.org/abs/2412.15174
Publikováno v:
IET Communications, Vol. 14, Issue 17, pp. 3039-3046, October 2020. ISSN: 1751-8628
This paper proposes a novel memetic algorithm (MA) for the blind equalization of digital multiuser channels with Direct-Sequence / Code-Division Multiple-Access (DS/CDMA) sharing scheme. Equalization involves two different tasks, the estimation of: (
Externí odkaz:
http://arxiv.org/abs/2412.12840
Autor:
Gucci, Francesco, Molinero, Eduardo B., Russo, Mattia, San-Jose, Pablo, Camargo, Franco V. A., Maiuri, Margherita, Ivanov, Misha, Jiménez-Galán, Álvaro, Silva, Rui E. F., Conte, Stefano Dal, Cerullo, Giulio
Information processing currently reaches speeds as high as 800 GHz. However, the underlying transistor technology is quickly approaching its fundamental limits and further progress requires a disruptive approach. One such path is to manipulate quantu
Externí odkaz:
http://arxiv.org/abs/2412.08318
Publikováno v:
Soft Computing, vol. 24, No. 17, pp. 13069-13083, Sept. 2020
This work proposes a modified version of an emerging nature-inspired technique, named Flower Pollination Algorithm (FPA), for equalizing digital multiuser channels. This equalization involves two different tasks: 1) estimation of the channel impulse
Externí odkaz:
http://arxiv.org/abs/2412.02023
Autor:
Monge-Alvarez, Jesús, Hoyos-Barceló, Carlos, San-José-Revuelta, Luis M., Casaseca-de-la-Higuera, Pablo
Publikováno v:
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, VOL. 66, NO. 8, AUGUST 2019, pp. 2319-2330
Cough is a protective reflex conveying information on the state of the respiratory system. Cough assessment has been limited so far to subjective measurement tools or uncomfortable (i.e., non-wearable) cough monitors. This limits the potential of rea
Externí odkaz:
http://arxiv.org/abs/2412.01996
Publikováno v:
Proceedings of the 27th. European Signal Processing Conference, EUSIPCO 2019, La Coru\~na, Spain, pp. 1-5, 2-6 Septiembre 2019
The design of both FIR and IIR digital filters is a multi-variable optimization problem, where traditional algorithms fail to obtain optimal solutions. A modified Shuffled Frog Leaping Algorithm (SFLA) is here proposed for the design of FIR and IIR d
Externí odkaz:
http://arxiv.org/abs/2411.19074
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions, bounding the card
Externí odkaz:
http://arxiv.org/abs/2411.13375
Autor:
Camps-Moreno, Eduardo, López, Hiram H., Matthews, Gretchen L., Ruano, Diego, San-José, Rodrigo, Soprunov, Ivan
In this paper, we study binary triorthogonal codes and their relation to CSS-T quantum codes. We characterize the binary triorthogonal codes that are minimal or maximal with respect to the CSS-T poset, and we also study how to derive new triorthogona
Externí odkaz:
http://arxiv.org/abs/2408.02916
Autor:
Demir, Basar, Tian, Lin, Greer, Thomas Hastings, Kwitt, Roland, Vialard, Francois-Xavier, Estepar, Raul San Jose, Bouix, Sylvain, Rushmore, Richard Jarrett, Ebrahim, Ebrahim, Niethammer, Marc
Modern medical image registration approaches predict deformations using deep networks. These approaches achieve state-of-the-art (SOTA) registration accuracy and are generally fast. However, deep learning (DL) approaches are, in contrast to conventio
Externí odkaz:
http://arxiv.org/abs/2408.00221
Autor:
San-José, Rodrigo
We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the bounds used f
Externí odkaz:
http://arxiv.org/abs/2407.11810