1 resultado para Information Search and Filtering
Filtro por publicador
- Repository Napier (2)
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberdeen University (3)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Applied Math and Science Education Repository - Washington - USA (1)
- Archive of European Integration (54)
- Aston University Research Archive (20)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (24)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (6)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (21)
- Brock University, Canada (7)
- Bulgarian Digital Mathematics Library at IMI-BAS (39)
- CentAUR: Central Archive University of Reading - UK (39)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (6)
- Cochin University of Science & Technology (CUSAT), India (6)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (34)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (64)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (3)
- Dalarna University College Electronic Archive (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons @ Winthrop University (1)
- Digital Commons at Florida International University (13)
- DigitalCommons@The Texas Medical Center (8)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (89)
- DRUM (Digital Repository at the University of Maryland) (4)
- Duke University (4)
- eScholarship Repository - University of California (2)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (4)
- Institute of Public Health in Ireland, Ireland (4)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (41)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (29)
- Massachusetts Institute of Technology (2)
- Memoria Académica - FaHCE, UNLP - Argentina (6)
- National Center for Biotechnology Information - NCBI (7)
- Nottingham eTheses (1)
- Open University Netherlands (1)
- Publishing Network for Geoscientific & Environmental Data (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (5)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (6)
- Repositório da Produção Científica e Intelectual da Unicamp (2)
- Repositório da Universidade Federal do Espírito Santo (UFES), Brazil (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (14)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (19)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (29)
- School of Medicine, Washington University, United States (1)
- Scielo Saúde Pública - SP (18)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (6)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (1)
- Universidad Politécnica de Madrid (15)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (8)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (65)
- Université de Montréal, Canada (4)
- University of Canberra Research Repository - Australia (2)
- University of Connecticut - USA (1)
- University of Michigan (52)
- University of Queensland eSpace - Australia (53)
- University of Southampton, United Kingdom (3)
- University of Washington (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.