@inproceedings{40746,
  abstract     = {{In this paper, the impact of improper Gaussian signaling is studied for an underlay cognitive radio (CR) scenario comprised of a primary user (PU), which has a rate constraint, and a secondary user (SU), both single-antenna. We first derive expressions for the achievable rate of the SU when it transmits proper and maximally improper Gaussian signals (assuming that the SU is solely limited by the CR constraint). These expressions depend on the channel gains to and from the SU through a single variable. Thereby, we observe that improper signaling is beneficial whenever the SU rate is below a threshold, which depends on the signal-to-noise ratio (SNR) and rate requirement of the PU. Furthermore, we provide bounds on the achievable gain that also depend only on the PU parameters. Then, the achievable rate is studied from a statistical viewpoint by deriving its cumulative distribution function considering a constant received SNR at the PU. In addition, we specialize this expression for the Z interference channel, for which the expected achievable rate is also derived. Numerical examples illustrate our claims and show that the SU may significantly benefit from using improper signaling.}},
  author       = {{Lameiro, Christian and Santamaría, Ignacio and Schreier, Peter J.}},
  booktitle    = {{Proc.\ IEEE Int.\ Conf.\ Comm.}},
  title        = {{{Analysis of maximally improper signalling schemes for underlay cognitive radio}}},
  year         = {{2015}},
}

@article{40749,
  author       = {{Stein, Manuel and Sebastian, Theiler and Nossek, Josef A.}},
  journal      = {{IEEE Wireless Comm. Lett.}},
  number       = {{2}},
  pages        = {{169–172}},
  title        = {{{Overdemodulation for high-performance receivers with low-resolution ADC}}},
  doi          = {{10.1109/LWC.2015.2388675}},
  volume       = {{4}},
  year         = {{2015}},
}

@inproceedings{40750,
  author       = {{Song, Y. and Schreier, P. J. and Roseveare, N.}},
  booktitle    = {{Proc.\ IEEE Int.\ Conf.\ Acoustics, Speech and Signal Process.}},
  title        = {{{Determining the number of correlated signals between two data sets using PCA-CCA when sample support is extremely small}}},
  year         = {{2015}},
}

@inproceedings{40748,
  author       = {{Roseveare, N. and Schreier, P. J.}},
  booktitle    = {{Proc.\ IEEE Int.\ Conf.\ Acoustics, Speech and Signal Process.}},
  title        = {{{Model-order selection for analyzing correlation between two data sets using CCA with PCA preprocessing}}},
  year         = {{2015}},
}

@article{40744,
  author       = {{Ramírez, D. and Schreier, P. J. and Via, J. and Santamaria, I. and Scharf, L. L.}},
  journal      = {{IEEE Trans. Signal Processing}},
  number       = {{20}},
  pages        = {{5395–5408}},
  title        = {{{Detection of multivariate cyclostationarity}}},
  volume       = {{63}},
  year         = {{2015}},
}

@article{41866,
  author       = {{Russer, Johannes A. and Uddin, Nasir and Awny, Ahmed Sanaa and Thiede, Andreas and Russer, Peter}},
  issn         = {{2162-2264}},
  journal      = {{IEEE Electromagnetic Compatibility Magazine}},
  keywords     = {{Electrical and Electronic Engineering, Computer Networks and Communications, Instrumentation, Signal Processing, Software}},
  number       = {{3}},
  pages        = {{79--85}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Near-field measurement of stochastic electromagnetic fields}}},
  doi          = {{10.1109/memc.2015.7336761}},
  volume       = {{4}},
  year         = {{2015}},
}

@inproceedings{41918,
  author       = {{Ali, U. and Bober, M. and Thiede, Andreas and Awny, A. and Fischer, G.}},
  booktitle    = {{2015 German Microwave Conference}},
  publisher    = {{IEEE}},
  title        = {{{High speed static frequency divider design with 111.6 GHz self-oscillation frequency (SOF) in 0.13 &amp;#x00B5;m SiGe BiCMOS technology}}},
  doi          = {{10.1109/gemic.2015.7107798}},
  year         = {{2015}},
}

@inproceedings{41916,
  author       = {{Ali, U. and Bober, M. and Thiede, A. and Wagner, S.}},
  booktitle    = {{2015 10th European Microwave Integrated Circuits Conference (EuMIC)}},
  publisher    = {{IEEE}},
  title        = {{{100–166 GHz wide band high speed digital dynamic frequency divider design in 0.13 μm SiGe BiCMOS technology}}},
  doi          = {{10.1109/eumic.2015.7345071}},
  year         = {{2015}},
}

@inproceedings{41917,
  author       = {{Ali, U. and Fischer, G. and Thiede, Andreas}},
  booktitle    = {{2015 German Microwave Conference}},
  publisher    = {{IEEE}},
  title        = {{{Low power fundamental VCO design in D-band using 0.13 &amp;#x00B5;m SiGe BiCMOS technology}}},
  doi          = {{10.1109/gemic.2015.7107827}},
  year         = {{2015}},
}

@article{42080,
  author       = {{Henriksson, E. and Quevedo, D. E. and Peters, Edwin G. W. and Sandberg, H. and Johansson, K. H.}},
  journal      = {{CDC}},
  number       = {{6}},
  pages        = {{2167–2181}},
  title        = {{{Multiple Loop Self-Triggered Model Predictive Control for Network Scheduling and Control}}},
  volume       = {{23}},
  year         = {{2015}},
}

@inproceedings{42082,
  author       = {{Lješnjanin, M. and Nešić, D. and Quevedo, D. E.}},
  title        = {{{Uniform Global Asymptotic Stability of Networked Control Systems Affected with Packet Dropouts and Scheduling Issues}}},
  year         = {{2015}},
}

@inproceedings{42084,
  author       = {{Li, Y. and Quevedo, D. E. and Dey, S. and Shi, L.}},
  title        = {{{Fake-Acknowledgment Attack on ACK-Based Sensor Power Schedule for Remote State Estimation}}},
  year         = {{2015}},
}

@inproceedings{42081,
  author       = {{Peters, E. G. W. and Quevedo, D. E. and Fu, M.}},
  title        = {{{Co-design for Control and Scheduling over Wireless Industrial Control Networks}}},
  year         = {{2015}},
}

@inproceedings{42083,
  author       = {{Huang, K. Q. and Dang, T. V. and Ling, K. V. and Quevedo, D. E.}},
  title        = {{{Event-triggered Anytime Control with Two Controllers}}},
  year         = {{2015}},
}

@article{42079,
  author       = {{Li, Y. and Shi, L. and Cheng, P. and Chen, J. and Quevedo, D. E.}},
  journal      = {{TAC}},
  number       = {{10}},
  pages        = {{2831–2836}},
  title        = {{{Jamming Attacks on Remote State Estimation in Cyber-Physical Systems: A Game-Theoretic Approach}}},
  volume       = {{60}},
  year         = {{2015}},
}

@article{42078,
  author       = {{Knorn, S. and Dey, S. and Ahlén, A. and Quevedo, D. E.}},
  journal      = {{TSP}},
  number       = {{11}},
  pages        = {{2848–2863}},
  title        = {{{Distortion Minimization in Multi-Sensor Estimation Using Energy Harvesting and Energy Sharing}}},
  volume       = {{63}},
  year         = {{2015}},
}

@article{42077,
  author       = {{Wu, J. and Li, Y. and Quevedo, D. E. and Lau, V. and Shi, L.}},
  journal      = {{AUTO}},
  number       = {{4}},
  pages        = {{332–339}},
  title        = {{{Data-driven power control for state estimation: A Bayesian inference approach}}},
  volume       = {{54}},
  year         = {{2015}},
}

@inproceedings{8164,
  abstract     = {{The study of ground state energies of local Hamiltonians has played a fundamental role in quantum complexity theory. In this paper, we take a new direction by introducing the physically motivated notion of ``ground state connectivity'' of local Hamiltonians, which captures problems in areas ranging from quantum stabilizer codes to quantum memories. We show that determining how ``connected'' the ground space of a local Hamiltonian is can range from QCMA-complete to PSPACE-complete, as well as NEXP-complete for an appropriately defined ``succinct'' version of the problem. As a result, we obtain a natural QCMA-complete problem, a goal which has generally proven difficult since the conception of QCMA over a decade ago. Our proofs rely on a new technical tool, the Traversal Lemma, which analyzes the Hilbert space a local unitary evolution must traverse under certain conditions. We show that this lemma is essentially tight with respect to the length of the unitary evolution in question.}},
  author       = {{Gharibian, Sevag and Sikora, Jamie}},
  booktitle    = {{International Colloquium on Automata, Languages, and Programming (ICALP 2015)}},
  editor       = {{Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina}},
  isbn         = {{978-3-662-47672-7}},
  location     = {{Kyoto, Japan}},
  pages        = {{617--628}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Ground State Connectivity of Local Hamiltonians}}},
  doi          = {{10.1007/978-3-662-47672-7_50}},
  year         = {{2015}},
}

@article{8166,
  abstract     = {{Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a “Quantum Cook-Levin Theorem” to deep insights into the structure of 1D low-temperature quantum systems via so-called area laws. Our aim here is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field. As such, we include the following in this survey: (1) The motivations and history of the field, (2) a glossary of condensed matter physics terms explained in computer-science friendly language, (3) overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and (4) brief expositions of selected computer science-based results in the area. For example, as part of the latter, we provide a novel information theoretic presentation of Bravyi’s polynomial time algorithm for Quantum 2-SAT.}},
  author       = {{Gharibian, Sevag and Huang, Yichen and Landau, Zeph and Woo Shin, Seung}},
  issn         = {{1551-305X}},
  journal      = {{Foundations and Trends® in Theoretical Computer Science}},
  number       = {{3}},
  pages        = {{159--282}},
  title        = {{{Quantum Hamiltonian Complexity}}},
  doi          = {{10.1561/0400000066}},
  volume       = {{10}},
  year         = {{2015}},
}

@article{8168,
  abstract     = {{Tensor networks are a central tool in condensed matter physics. In this paper, we initiate the study of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector? We show that TNZ is not in the Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among other results) that the special cases of TNZ on non-negative and injective tensor networks are in NP. Using this, we make a simple observation: The commuting variant of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for logarithmic k and constant D. This reveals the first class of quantum Hamiltonians whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant D, and (3) for arbitrary interaction graphs.
}},
  author       = {{Gharibian, Sevag and Landau, Zeph and Woo Shin, Seung and Wang, Guoming}},
  journal      = {{Quantum Information & Computation}},
  number       = {{9{\&}10}},
  pages        = {{885--899}},
  title        = {{{Tensor network non-zero testing}}},
  volume       = {{15}},
  year         = {{2015}},
}

