Pasar al contenido principal

CODIFICACION Y PROCESADO DE SEÑALES PARA REDES EMERGENTES DE COMUNICACION Y DE SENSORES INALAMBRICAS

TEC2016-75067-C4-2-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 12
Encontrada(s) 1 página(s)

Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Polar coding for common message only wiretap broadcast channel

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably decoded by the receivers, and the confidential message must also be (strongly) secured from the eavesdropper. The coding scheme aims to use the optimal rate of randomness and does not make any assumption regarding the symmetry or degradedness of the channel. This paper extends previous work on polar codes for the wiretap channel by proposing a new chaining construction that allows to reliably and securely send the same confidential bmessage to two different receivers. This construction introduces new dependencies between the random variables involved in the coding scheme that need to be considered in the secrecy analysis., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

One-shot capacity bounds on the simultaneous transmission of classical and quantum information

  • Salek Shishavan, Farzin
  • Anshu, Anurag
  • Hsieh, Min-Hsiu
  • Jain, Rahul
  • Rodríguez Fonollosa, Javier
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., We study the communication capabilities of a quan- tum channel under the most general channel model known as the one-shot model. Unlike classical channels that can only be used to transmit classical information (bits), a quantum channel can be used for transmission of classical information, quantum information (qubits) and simultaneous transmission of classical and quantum information. In this work, we investigate the one-shot capabilities of a quantum channel for simultaneously transmitting bits and qubits. This problem was studied in the asymptotic regime for a memoryless channel where a regularized characterization of the capacity region was reported. It is known that the transmission of private classical information is closely related to the problem of quantum information transmission. We resort to this idea and find achievable and converse bounds on the simultaneous transmission of the public and private classical information. Then shifting the classical private rate to the quantum information rate leads to a rate region for simultaneous transmission of classical and quantum information. In the case of asymptotic i.i.d. setting, our one-shot result is evaluated to the known results in the literature. Our main tools used in the achievability proofs are position-based decoding and convex-split lemma., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Matrix completion and extrapolation via kernel regression

  • Giménez Febrer, Pedro Juan
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Matrix completion and extrapolation (MCEX) are dealt with here over reproducing kernel Hilbert spaces (RKHSs) in order to account for prior information present in the available data. Aiming at a fast and low-complexity solver, the task is formulated as one of kernel ridge regression. The resultant MCEX algorithm can also afford online implementation, while the class of kernel functions also encompasses several existing approaches to MC with prior information. Numerical tests on synthetic and real datasets show that the novel approach is faster than widespread methods such as alternating least-squares (ALS) or stochastic gradient descent (SGD), and that the recovery error is reduced, especially when dealing with noisy data., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Blind multiclass ensemble classification

  • Traganitis, Panagiotis
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The rising interest in pattern recognition and data analytics has spurred the development of innovative machine learning algorithms and tools. However, as each algorithm has its strengths and limitations, one is motivated to judiciously fuse multiple algorithms in order to find the “best” performing one, for a given dataset. Ensemble learning aims at such highperformance meta-algorithm, by combining the outputs from multiple algorithms. The present work introduces a blind scheme for learning from ensembles of classifiers, using a moment matching method that leverages joint tensor and matrix factorization. Blind refers to the combiner who has no knowledge of the groundtruth labels that each classifier has been trained on. A rigorous performance analysis is derived and the proposed scheme is evaluated on synthetic and real datasets., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Strong secrecy on a class of degraded broadcast channels using polar codes

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
Asymptotic secrecy-capacity achieving polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding or layered secrecy. In these settings, the transmitter wishes to send multiple messages to a set of legitimate receivers keeping them masked from a set of eavesdroppers. The layered decoding structure requires receivers with better channel quality to reliably decode more messages, while the layered secrecy structure requires eavesdroppers with worse channel quality to be kept ignorant of more messages. Practical constructions for the proposed polar coding schemes are discussed and their performance evaluated by means of simulations., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Single-serving quantum broadcast channel with common, individualized, and confidential messages

  • Salek Shishavan, Farzin
  • Hsieh, Min-Hsiu
  • Rodríguez Fonollosa, Javier
The two-receiver broadcast channel with primary and third party receivers is studied. The sender wishes to reliably communicate a common (or public) message to both receivers as well as individualized and confidential messages to the primary receiver only. The third party receiver must be kept completely ignorant of the confidential message but there are no secrecy requirements associated to the individualized message. A trade-off arises between the rates of the three messages: when one of the rates is high, the other rates may need to back off to guarantee the reliable transmission of all three messages. In addition, the confidentiality requirement implies availability of local randomness at the transmitter in order to implement a stochastic encoding. This article studies the trade-off between the rates of the common, individualized and confidential messages as well as that of the local randomness in the one-shot regime of a quantum broadcast channel. We provide an achievability region, by proving a conditional version of the convex-split lemma combined with the position-based decoding, as well as a (weak) converse region. We study the asymptotic behaviour of our bounds and recover several well-known asymptotic results in the literature, including simultaneous transmission of classical and quantum information., The work of Farzin Salek was supported in part by the Ministerio de Ciencia, Innovación y Universidades, of the Spanish Government, UE, under Grant TEC2015-69648-REDC and Grant TEC2016- 75067-C4-2-R AEI/FEDER, in part by the Catalan Government, QuantumCAT within the ERDF Program of Catalunya, under Grant 2017 SGR 578 AGAUR and Grant 001-P-001644, in part by the Baidu-UAB Collaborative Project Learning of Quantum Hidden Markov Models, the Spanish MINECO with the support of FEDER funds, under Project FIS2016-86681-P, and in part by the Generalitat de Catalunya under Project 2017-SGR-1127. The work of Javier Rodríguez Fonollosa was supported in part by the Ministerio de Ciencia, Innovación y Universidades, of the Spanish Government, UE, under Grant TEC2015-69648-REDC and Grant TEC2016-75067-C4-2-R AEI/FEDER, and in part by the Catalan Government, QuantumCAT within the ERDF Program of Catalunya, under Grant 2017 SGR 578 AGAUR and Grant 001- P-001644., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Generalization error bounds for kernel matrix completion and extrapolation

  • Giménez Febrer, Pedro Juan
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable algorithms. This paper analyzes the generalization error of such approaches, and presents numerical tests confirming the theoretical results, This work is supported by ERDF funds (TEC2013-41315-R and TEC2016-75067-C4-2), the Catalan Government (2017 SGR 578), and NSF grants(1500713, 1514056, 1711471 and 1509040)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Polar coding for confidential broadcasting

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send the same private (non-confidential) message and the same confidential message reliably to two different legitimate receivers, and the confidential message must also be (strongly) secured from the eavesdropper. The coding scheme aims to use the optimal rate of randomness and does not make any assumption regarding the symmetry or degradedness of the channel. This paper extends previous work on polar codes for the wiretap channel by proposing a new chaining construction that allows to reliably and securely send the same confidential message to two different receivers. This construction introduces new dependencies between the random variables involved in the coding scheme that need to be considered in the secrecy analysis., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Publicness, privacy and confidentiality in the single-serving quantum broadcast channel

  • Salek Shishavan, Farzin
  • Hsieh, Min-Hsiu
  • Rodríguez Fonollosa, Javier
The 2-receiver broadcast channel with primary and third-party receivers is studied. The messages are classified into public, private and confidential. The messages in the public class are messages intended for both receivers. The private messages are intended for the primary receiver with no secrecy requirements imposed upon them. And the confidential messages are aimed exclusively to the primary receiver such that they must not be accessible to the other receiver. The encoder performs the necessary encryption by virtue of local randomness whose rate is assumed to be limited. We find an achievability region on the trade-off between the rates of the three messages and the source of randomness in the one-shot regime of a quantum broadcast channel., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Polar coding for the wiretap broadcast channel with multiple messages

  • Olmo Alòs, Jaume del
  • Rodríguez Fonollosa, Javier
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eaves-dropper. We consider a model in which the transmitter wishes to to reliably send different confidential and private messages to the different legitimate receivers, and the confidential message must also be (strongly) secured from the eavesdropper. There are two different inner-bounds on the achievable region of this model in the literature. Both are characterized by using Marton's coding and the only difference between them is the decoding strategy: one is characterized by using joint decoding, while the other uses successive decoding. In this paper we present a polar coding scheme that achieves the larger inner-bound, and we show that polar-based joint decoding is crucial for this purpose., This work has been funded by the AEI of Ministerio de Ciencia, Innovación y Universidades of Spain, TEC2016-75067-C4-2-R, RED2018-102668-T with ESF and PID2019-104958RB-C41 and Dept. d’Empresa i Coneixement de la Generalitat de Catalunya, 2017 SGR 578 AGAUR and 001-P-001644 QuantumCAT with ERDF., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Learning from unequally reliable blind ensembles of classifiers

  • Traganitis, Panagiotis
  • Pagès Zamora, Alba Maria
  • Giannakis, Georgios B.
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The rising interest in pattern recognition and data analytics has spurred the development of a plethora of machine learning algorithms and tools. However, as each algorithm has its strengths and weaknesses, one is motivated to judiciously fuse multiple algorithms in order to find the “best” performing one, for a given dataset. Ensemble learning aims to create a high- performance meta-algorithm, by combining the outputs from multiple algorithms. The present work introduces a simple blind scheme for learning from ensembles of classifiers, using joint matrix factorization. Blind refers to the combiner who has no knowledge of the ground-truth labels that each classifier has been trained on. Performance is evaluated on synthetic and real datasets., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Unsupervised ensemble classification with correlated decision agents

  • Cabrera-Bean, Margarita
  • Pagès Zamora, Alba Maria
  • Diaz Vilor, Carles
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Decision-making procedures when a set of individual binary labels is processed to produce a unique joint decision can be approached modeling the individual labels as multivariate independent Bernoulli random variables. This probabilistic model allows an unsupervised solution using EM-based algorithms, which basically estimate the distribution model parameters and take a joint decision using a Maximum a Posteriori criterion. These methods usually assume that individual decision agents are conditionally independent, an assumption that might not hold in practical setups. Therefore, in this work we formulate and solve the decision-making problem using an EM-based approach but assuming correlated decision agents. Improved performance is obtained on synthetic and real datasets, compared to classical and state-of-the-art algorithms., Peer Reviewed, Postprint (author's final draft)