[{"volume":21,"date_created":"2023-01-30T11:51:49Z","author":[{"first_name":"Manuel","full_name":"Stein, Manuel","last_name":"Stein"},{"full_name":"Castañeda, Mario","last_name":"Castañeda","first_name":"Mario"},{"last_name":"Mezghani","full_name":"Mezghani, Amine","first_name":"Amine"},{"first_name":"Josef A.","full_name":"Nossek, Josef A.","last_name":"Nossek"}],"date_updated":"2023-01-30T12:00:48Z","doi":"10.1109/LSP.2014.2315537","title":"Information-preserving transformations for signal parameter estimation","issue":"7","intvolume":"        21","page":"866–870","citation":{"ieee":"M. Stein, M. Castañeda, A. Mezghani, and J. A. Nossek, “Information-preserving transformations for signal parameter estimation,” <i>IEEE Signal Process.\\ Lett.</i>, vol. 21, no. 7, pp. 866–870, 2014, doi: <a href=\"https://doi.org/10.1109/LSP.2014.2315537\">10.1109/LSP.2014.2315537</a>.","chicago":"Stein, Manuel, Mario Castañeda, Amine Mezghani, and Josef A. Nossek. “Information-Preserving Transformations for Signal Parameter Estimation.” <i>IEEE Signal Process.\\ Lett.</i> 21, no. 7 (2014): 866–870. <a href=\"https://doi.org/10.1109/LSP.2014.2315537\">https://doi.org/10.1109/LSP.2014.2315537</a>.","ama":"Stein M, Castañeda M, Mezghani A, Nossek JA. Information-preserving transformations for signal parameter estimation. <i>IEEE Signal Process\\ Lett</i>. 2014;21(7):866–870. doi:<a href=\"https://doi.org/10.1109/LSP.2014.2315537\">10.1109/LSP.2014.2315537</a>","mla":"Stein, Manuel, et al. “Information-Preserving Transformations for Signal Parameter Estimation.” <i>IEEE Signal Process.\\ Lett.</i>, vol. 21, no. 7, 2014, pp. 866–870, doi:<a href=\"https://doi.org/10.1109/LSP.2014.2315537\">10.1109/LSP.2014.2315537</a>.","bibtex":"@article{Stein_Castañeda_Mezghani_Nossek_2014, title={Information-preserving transformations for signal parameter estimation}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/LSP.2014.2315537\">10.1109/LSP.2014.2315537</a>}, number={7}, journal={IEEE Signal Process.\\ Lett.}, author={Stein, Manuel and Castañeda, Mario and Mezghani, Amine and Nossek, Josef A.}, year={2014}, pages={866–870} }","short":"M. Stein, M. Castañeda, A. Mezghani, J.A. Nossek, IEEE Signal Process.\\ Lett. 21 (2014) 866–870.","apa":"Stein, M., Castañeda, M., Mezghani, A., &#38; Nossek, J. A. (2014). Information-preserving transformations for signal parameter estimation. <i>IEEE Signal Process.\\ Lett.</i>, <i>21</i>(7), 866–870. <a href=\"https://doi.org/10.1109/LSP.2014.2315537\">https://doi.org/10.1109/LSP.2014.2315537</a>"},"year":"2014","department":[{"_id":"263"}],"user_id":"43497","_id":"40764","publication":"IEEE Signal Process.\\ Lett.","type":"journal_article","status":"public"},{"status":"public","abstract":[{"text":"In this paper, we present an efficient approach to virtual platform modeling for TriCore-based SoCs by combining fast and open software emulation with IEEE-1666 Standard SystemC simulation.  For evaluation we consider Infineon's recently introduced AURIX processor family as a target platform, which utilizes multiple CPU cores operating in lockstep mode, memories, hierarchical buses, and a rich set of peripherals. For SoC prototyping, we integrate the fast and open instruction accurate QEMU software emulator with the TLMu library for SystemC co-verification. This article reports our most recent efforts of the implementation of the TriCore instruction set for QEMU. The experimental results demonstrate the functional correctness and performance of our TriCore implementation.","lang":"eng"}],"type":"conference","publication":"Proceedings of the Design and Verification Conference Europe (DVCON Europe)","language":[{"iso":"eng"}],"keyword":["System Design","Verification"],"user_id":"15931","department":[{"_id":"58"}],"_id":"34585","citation":{"short":"B. Koppelmann, B. Messidat, M. Becker, W. Müller, J.C. Scheytt, in: Proceedings of the Design and Verification Conference Europe (DVCON Europe), München, 2014.","mla":"Koppelmann, Bastian, et al. “Fast and Open Virtual Platforms for TriCore-Based SoCs Using QEMU.” <i>Proceedings of the Design and Verification Conference Europe (DVCON Europe)</i>, 2014.","bibtex":"@inproceedings{Koppelmann_Messidat_Becker_Müller_Scheytt_2014, place={München}, title={Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU}, booktitle={Proceedings of the Design and Verification Conference Europe (DVCON Europe)}, author={Koppelmann, Bastian and Messidat, Bernd and Becker, Markus and Müller, Wolfgang and Scheytt, J. Christoph}, year={2014} }","apa":"Koppelmann, B., Messidat, B., Becker, M., Müller, W., &#38; Scheytt, J. C. (2014). Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU. <i>Proceedings of the Design and Verification Conference Europe (DVCON Europe)</i>.","ama":"Koppelmann B, Messidat B, Becker M, Müller W, Scheytt JC. Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU. In: <i>Proceedings of the Design and Verification Conference Europe (DVCON Europe)</i>. ; 2014.","chicago":"Koppelmann, Bastian, Bernd Messidat, Markus Becker, Wolfgang Müller, and J. Christoph Scheytt. “Fast and Open Virtual Platforms for TriCore-Based SoCs Using QEMU.” In <i>Proceedings of the Design and Verification Conference Europe (DVCON Europe)</i>. München, 2014.","ieee":"B. Koppelmann, B. Messidat, M. Becker, W. Müller, and J. C. Scheytt, “Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU,” 2014."},"year":"2014","place":"München","title":"Fast and Open Virtual Platforms for TriCore-based SoCs Using QEMU","author":[{"first_name":"Bastian","last_name":"Koppelmann","id":"25260","full_name":"Koppelmann, Bastian"},{"first_name":"Bernd","full_name":"Messidat, Bernd","last_name":"Messidat"},{"last_name":"Becker","full_name":"Becker, Markus","first_name":"Markus"},{"first_name":"Wolfgang","last_name":"Müller","id":"16243","full_name":"Müller, Wolfgang"},{"first_name":"J. Christoph","id":"37144","full_name":"Scheytt, J. Christoph","last_name":"Scheytt","orcid":"https://orcid.org/0000-0002-5950-6618"}],"date_created":"2022-12-20T10:48:25Z","date_updated":"2023-02-01T08:12:02Z"},{"year":"2014","intvolume":"        44","page":"193-215","citation":{"bibtex":"@article{Bogdan_Dyda_Luks_2014, title={On Hardy spaces of local and nonlocal operators}, volume={44}, DOI={<a href=\"https://doi.org/10.32917/hmj/1408972907\">10.32917/hmj/1408972907</a>}, number={2}, journal={Hiroshima Mathematical Journal}, publisher={Hiroshima University - Department of Mathematics}, author={Bogdan, Krzysztof and Dyda, Bartłomiej and Luks, Tomasz}, year={2014}, pages={193–215} }","short":"K. Bogdan, B. Dyda, T. Luks, Hiroshima Mathematical Journal 44 (2014) 193–215.","mla":"Bogdan, Krzysztof, et al. “On Hardy Spaces of Local and Nonlocal Operators.” <i>Hiroshima Mathematical Journal</i>, vol. 44, no. 2, Hiroshima University - Department of Mathematics, 2014, pp. 193–215, doi:<a href=\"https://doi.org/10.32917/hmj/1408972907\">10.32917/hmj/1408972907</a>.","apa":"Bogdan, K., Dyda, B., &#38; Luks, T. (2014). On Hardy spaces of local and nonlocal operators. <i>Hiroshima Mathematical Journal</i>, <i>44</i>(2), 193–215. <a href=\"https://doi.org/10.32917/hmj/1408972907\">https://doi.org/10.32917/hmj/1408972907</a>","ieee":"K. Bogdan, B. Dyda, and T. Luks, “On Hardy spaces of local and nonlocal operators,” <i>Hiroshima Mathematical Journal</i>, vol. 44, no. 2, pp. 193–215, 2014, doi: <a href=\"https://doi.org/10.32917/hmj/1408972907\">10.32917/hmj/1408972907</a>.","chicago":"Bogdan, Krzysztof, Bartłomiej Dyda, and Tomasz Luks. “On Hardy Spaces of Local and Nonlocal Operators.” <i>Hiroshima Mathematical Journal</i> 44, no. 2 (2014): 193–215. <a href=\"https://doi.org/10.32917/hmj/1408972907\">https://doi.org/10.32917/hmj/1408972907</a>.","ama":"Bogdan K, Dyda B, Luks T. On Hardy spaces of local and nonlocal operators. <i>Hiroshima Mathematical Journal</i>. 2014;44(2):193-215. doi:<a href=\"https://doi.org/10.32917/hmj/1408972907\">10.32917/hmj/1408972907</a>"},"publication_identifier":{"issn":["0018-2079"]},"publication_status":"published","issue":"2","title":"On Hardy spaces of local and nonlocal operators","doi":"10.32917/hmj/1408972907","date_updated":"2023-01-26T17:20:41Z","publisher":"Hiroshima University - Department of Mathematics","volume":44,"author":[{"first_name":"Krzysztof","full_name":"Bogdan, Krzysztof","last_name":"Bogdan"},{"last_name":"Dyda","full_name":"Dyda, Bartłomiej","first_name":"Bartłomiej"},{"first_name":"Tomasz","id":"58312","full_name":"Luks, Tomasz","last_name":"Luks"}],"date_created":"2023-01-25T15:46:01Z","status":"public","publication":"Hiroshima Mathematical Journal","type":"journal_article","language":[{"iso":"eng"}],"extern":"1","_id":"40068","department":[{"_id":"555"}],"user_id":"58312"},{"intvolume":"       160","citation":{"apa":"Ali, S., Ramírez, D., Jansson, M., Seco-Granados, G., &#38; López-Salcedo, J. A. (2014). Multi-antenna spectrum sensing by exploiting spatio-temporal correlation. <i>Eurasip\\ J.\\ Applied Signal Process.</i>, <i>160</i>. <a href=\"https://doi.org/10.1186/1687-6180-2014-160\">https://doi.org/10.1186/1687-6180-2014-160</a>","mla":"Ali, S., et al. “Multi-Antenna Spectrum Sensing by Exploiting Spatio-Temporal Correlation.” <i>Eurasip\\ J.\\ Applied Signal Process.</i>, vol. 160, 2014, doi:<a href=\"https://doi.org/10.1186/1687-6180-2014-160\">10.1186/1687-6180-2014-160</a>.","short":"S. Ali, D. Ramírez, M. Jansson, G. Seco-Granados, J.A. López-Salcedo, Eurasip\\ J.\\ Applied Signal Process. 160 (2014).","bibtex":"@article{Ali_Ramírez_Jansson_Seco-Granados_López-Salcedo_2014, title={Multi-antenna spectrum sensing by exploiting spatio-temporal correlation}, volume={160}, DOI={<a href=\"https://doi.org/10.1186/1687-6180-2014-160\">10.1186/1687-6180-2014-160</a>}, journal={Eurasip\\ J.\\ Applied Signal Process.}, author={Ali, S. and Ramírez, D. and Jansson, M. and Seco-Granados, G. and López-Salcedo, J. A.}, year={2014} }","ieee":"S. Ali, D. Ramírez, M. Jansson, G. Seco-Granados, and J. A. López-Salcedo, “Multi-antenna spectrum sensing by exploiting spatio-temporal correlation,” <i>Eurasip\\ J.\\ Applied Signal Process.</i>, vol. 160, 2014, doi: <a href=\"https://doi.org/10.1186/1687-6180-2014-160\">10.1186/1687-6180-2014-160</a>.","chicago":"Ali, S., D. Ramírez, M. Jansson, G. Seco-Granados, and J. A. López-Salcedo. “Multi-Antenna Spectrum Sensing by Exploiting Spatio-Temporal Correlation.” <i>Eurasip\\ J.\\ Applied Signal Process.</i> 160 (2014). <a href=\"https://doi.org/10.1186/1687-6180-2014-160\">https://doi.org/10.1186/1687-6180-2014-160</a>.","ama":"Ali S, Ramírez D, Jansson M, Seco-Granados G, López-Salcedo JA. Multi-antenna spectrum sensing by exploiting spatio-temporal correlation. <i>Eurasip\\ J\\ Applied Signal Process</i>. 2014;160. doi:<a href=\"https://doi.org/10.1186/1687-6180-2014-160\">10.1186/1687-6180-2014-160</a>"},"year":"2014","volume":160,"author":[{"full_name":"Ali, S.","last_name":"Ali","first_name":"S."},{"full_name":"Ramírez, D.","last_name":"Ramírez","first_name":"D."},{"first_name":"M.","full_name":"Jansson, M.","last_name":"Jansson"},{"first_name":"G.","full_name":"Seco-Granados, G.","last_name":"Seco-Granados"},{"full_name":"López-Salcedo, J. A.","last_name":"López-Salcedo","first_name":"J. A."}],"date_created":"2023-01-30T11:51:47Z","date_updated":"2023-01-30T12:00:24Z","doi":"10.1186/1687-6180-2014-160","title":"Multi-antenna spectrum sensing by exploiting spatio-temporal correlation","publication":"Eurasip\\ J.\\ Applied Signal Process.","type":"journal_article","status":"public","abstract":[{"lang":"eng","text":"In this paper, we propose a novel mechanism for spectrum sensing that leads us to exploit the spatio-temporal correlation present in the received signal at a multi-antenna receiver. For the proposed mechanism, we formulate the spectrum sensing scheme by adopting the generalized likelihood ratio test (GLRT). However, the GLRT degenerates in the case of limited sample support. To circumvent this problem, several extensions are proposed that bring robustness to the GLRT in the case of high dimensionality and small sample size. In order to achieve these sample-efficient detection schemes, we modify the GLRT-based detector by exploiting the covariance structure and factoring the large spatio-temporal covariance matrix into spatial and temporal covariance matrices. The performance of the proposed detectors is evaluated by means of numerical simulations, showing important advantages over existing detectors."}],"department":[{"_id":"263"}],"user_id":"43497","_id":"40757"},{"publisher":"Elsevier","date_updated":"2023-01-30T12:00:21Z","date_created":"2023-01-30T11:51:47Z","author":[{"first_name":"Bruce","last_name":"Draper","full_name":"Draper, Bruce"},{"last_name":"Kirby","full_name":"Kirby, Michael","first_name":"Michael"},{"full_name":"Marks, Justin","last_name":"Marks","first_name":"Justin"},{"first_name":"Tim","full_name":"Marrinan, Tim","last_name":"Marrinan"},{"first_name":"Chris","full_name":"Peterson, Chris","last_name":"Peterson"}],"volume":451,"title":"A flag representation for finite collections of subspaces of mixed dimensions","doi":"10.1016/j.laa.2014.03.022","year":"2014","citation":{"apa":"Draper, B., Kirby, M., Marks, J., Marrinan, T., &#38; Peterson, C. (2014). A flag representation for finite collections of subspaces of mixed dimensions. <i>Lin.\\ Alg.\\ Appl.</i>, <i>451</i>, 15–32. <a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">https://doi.org/10.1016/j.laa.2014.03.022</a>","bibtex":"@article{Draper_Kirby_Marks_Marrinan_Peterson_2014, title={A flag representation for finite collections of subspaces of mixed dimensions}, volume={451}, DOI={<a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">10.1016/j.laa.2014.03.022</a>}, journal={Lin.\\ Alg.\\ Appl.}, publisher={Elsevier}, author={Draper, Bruce and Kirby, Michael and Marks, Justin and Marrinan, Tim and Peterson, Chris}, year={2014}, pages={15–32} }","mla":"Draper, Bruce, et al. “A Flag Representation for Finite Collections of Subspaces of Mixed Dimensions.” <i>Lin.\\ Alg.\\ Appl.</i>, vol. 451, Elsevier, 2014, pp. 15–32, doi:<a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">10.1016/j.laa.2014.03.022</a>.","short":"B. Draper, M. Kirby, J. Marks, T. Marrinan, C. Peterson, Lin.\\ Alg.\\ Appl. 451 (2014) 15–32.","chicago":"Draper, Bruce, Michael Kirby, Justin Marks, Tim Marrinan, and Chris Peterson. “A Flag Representation for Finite Collections of Subspaces of Mixed Dimensions.” <i>Lin.\\ Alg.\\ Appl.</i> 451 (2014): 15–32. <a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">https://doi.org/10.1016/j.laa.2014.03.022</a>.","ieee":"B. Draper, M. Kirby, J. Marks, T. Marrinan, and C. Peterson, “A flag representation for finite collections of subspaces of mixed dimensions,” <i>Lin.\\ Alg.\\ Appl.</i>, vol. 451, pp. 15–32, 2014, doi: <a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">10.1016/j.laa.2014.03.022</a>.","ama":"Draper B, Kirby M, Marks J, Marrinan T, Peterson C. A flag representation for finite collections of subspaces of mixed dimensions. <i>Lin\\ Alg\\ Appl</i>. 2014;451:15–32. doi:<a href=\"https://doi.org/10.1016/j.laa.2014.03.022\">10.1016/j.laa.2014.03.022</a>"},"page":"15–32","intvolume":"       451","_id":"40754","user_id":"43497","department":[{"_id":"263"}],"type":"journal_article","publication":"Lin.\\ Alg.\\ Appl.","status":"public"},{"citation":{"ama":"Rüffer BS, Sailer R. Input-to-State Stability for Discrete-Time Monotone Systems. In: <i>Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)</i>. ; 2014.","ieee":"B. S. Rüffer and R. Sailer, “Input-to-State Stability for Discrete-Time Monotone Systems,” 2014.","chicago":"Rüffer, Björn S., and Rudolf Sailer. “Input-to-State Stability for Discrete-Time Monotone Systems.” In <i>Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)</i>, 2014.","short":"B.S. Rüffer, R. Sailer, in: Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS), 2014.","mla":"Rüffer, Björn S., and Rudolf Sailer. “Input-to-State Stability for Discrete-Time Monotone Systems.” <i>Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)</i>, 2014.","bibtex":"@inproceedings{Rüffer_Sailer_2014, title={Input-to-State Stability for Discrete-Time Monotone Systems}, booktitle={Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)}, author={Rüffer, Björn S. and Sailer, Rudolf}, year={2014} }","apa":"Rüffer, B. S., &#38; Sailer, R. (2014). Input-to-State Stability for Discrete-Time Monotone Systems. <i>Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)</i>."},"year":"2014","author":[{"first_name":"Björn S.","last_name":"Rüffer","full_name":"Rüffer, Björn S."},{"last_name":"Sailer","full_name":"Sailer, Rudolf","first_name":"Rudolf"}],"date_created":"2023-01-30T11:51:47Z","date_updated":"2023-01-30T12:00:18Z","title":"Input-to-State Stability for Discrete-Time Monotone Systems","publication":"Proc. 21st Int. Symp. Mathematical Theory of Networks and Systems (MTNS)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"It is well known that input-to-state stability admits an astonishing number of equivalent characterizations. Here it is shown that for monotone systems on $\\Rnp$ there are some additional characterizations that are useful for network stability analysis. These characterizations include system theoretic properties, algebraic properties, as well as the problem of finding simultaneous bounds on solutions to a collection of inequalities."}],"department":[{"_id":"263"}],"user_id":"43497","_id":"40753"},{"title":"Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing","author":[{"first_name":"L.","last_name":"Huang","full_name":"Huang, L."},{"full_name":"Xiao, Y-.H.","last_name":"Xiao","first_name":"Y-.H."},{"first_name":"H. C.","last_name":"So","full_name":"So, H. C."},{"first_name":"J.","last_name":"Fang","full_name":"Fang, J."}],"date_created":"2023-01-30T11:51:47Z","volume":14,"date_updated":"2023-01-30T12:00:16Z","citation":{"apa":"Huang, L., Xiao, Y.-. H., So, H. C., &#38; Fang, J. (2014). Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing. <i>IEEE Transactions on Wireless Communications</i>, <i>14</i>(2), 750–758.","bibtex":"@article{Huang_Xiao_So_Fang_2014, title={Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing}, volume={14}, number={2}, journal={IEEE Transactions on Wireless Communications}, author={Huang, L. and Xiao, Y-.H. and So, H. C. and Fang, J.}, year={2014}, pages={750–758} }","mla":"Huang, L., et al. “Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing.” <i>IEEE Transactions on Wireless Communications</i>, vol. 14, no. 2, 2014, pp. 750–758.","short":"L. Huang, Y.-. H. Xiao, H.C. So, J. Fang, IEEE Transactions on Wireless Communications 14 (2014) 750–758.","ama":"Huang L, Xiao Y-. H, So HC, Fang J. Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing. <i>IEEE Transactions on Wireless Communications</i>. 2014;14(2):750–758.","chicago":"Huang, L., Y-.H. Xiao, H. C. So, and J. Fang. “Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing.” <i>IEEE Transactions on Wireless Communications</i> 14, no. 2 (2014): 750–758.","ieee":"L. Huang, Y.-. H. Xiao, H. C. So, and J. Fang, “Accurate Performance Analysis of Hadamard Ratio Test for Robust Spectrum Sensing,” <i>IEEE Transactions on Wireless Communications</i>, vol. 14, no. 2, pp. 750–758, 2014."},"page":"750–758","intvolume":"        14","year":"2014","issue":"2","user_id":"43497","department":[{"_id":"263"}],"_id":"40755","status":"public","type":"journal_article","publication":"IEEE Transactions on Wireless Communications"},{"department":[{"_id":"263"}],"user_id":"43497","_id":"40756","status":"public","publication":"CVPR","type":"conference","doi":"10.1109/CVPR.2014.142","title":"Finding the Subspace Mean or Median to Fit Your Need","author":[{"last_name":"Marrinan","full_name":"Marrinan, Tim","first_name":"Tim"},{"first_name":"Bruce","last_name":"Draper","full_name":"Draper, Bruce"},{"first_name":"J. Ross","last_name":"Beveridge","full_name":"Beveridge, J. Ross"},{"first_name":"Michael","last_name":"Kirby","full_name":"Kirby, Michael"},{"full_name":"Peterson, Chris","last_name":"Peterson","first_name":"Chris"}],"date_created":"2023-01-30T11:51:47Z","date_updated":"2023-01-30T12:00:14Z","page":"1082–1089","citation":{"chicago":"Marrinan, Tim, Bruce Draper, J. Ross Beveridge, Michael Kirby, and Chris Peterson. “Finding the Subspace Mean or Median to Fit Your Need.” In <i>CVPR</i>, 1082–1089, 2014. <a href=\"https://doi.org/10.1109/CVPR.2014.142\">https://doi.org/10.1109/CVPR.2014.142</a>.","ieee":"T. Marrinan, B. Draper, J. R. Beveridge, M. Kirby, and C. Peterson, “Finding the Subspace Mean or Median to Fit Your Need,” in <i>CVPR</i>, 2014, pp. 1082–1089, doi: <a href=\"https://doi.org/10.1109/CVPR.2014.142\">10.1109/CVPR.2014.142</a>.","ama":"Marrinan T, Draper B, Beveridge JR, Kirby M, Peterson C. Finding the Subspace Mean or Median to Fit Your Need. In: <i>CVPR</i>. ; 2014:1082–1089. doi:<a href=\"https://doi.org/10.1109/CVPR.2014.142\">10.1109/CVPR.2014.142</a>","apa":"Marrinan, T., Draper, B., Beveridge, J. R., Kirby, M., &#38; Peterson, C. (2014). Finding the Subspace Mean or Median to Fit Your Need. <i>CVPR</i>, 1082–1089. <a href=\"https://doi.org/10.1109/CVPR.2014.142\">https://doi.org/10.1109/CVPR.2014.142</a>","short":"T. Marrinan, B. Draper, J.R. Beveridge, M. Kirby, C. Peterson, in: CVPR, 2014, pp. 1082–1089.","bibtex":"@inproceedings{Marrinan_Draper_Beveridge_Kirby_Peterson_2014, title={Finding the Subspace Mean or Median to Fit Your Need}, DOI={<a href=\"https://doi.org/10.1109/CVPR.2014.142\">10.1109/CVPR.2014.142</a>}, booktitle={CVPR}, author={Marrinan, Tim and Draper, Bruce and Beveridge, J. Ross and Kirby, Michael and Peterson, Chris}, year={2014}, pages={1082–1089} }","mla":"Marrinan, Tim, et al. “Finding the Subspace Mean or Median to Fit Your Need.” <i>CVPR</i>, 2014, pp. 1082–1089, doi:<a href=\"https://doi.org/10.1109/CVPR.2014.142\">10.1109/CVPR.2014.142</a>."},"year":"2014"},{"doi":"10.1016/j.neuroimage.2014.03.075","title":"Finding brain oscillations with power dependencies in neuroimaging data","author":[{"last_name":"Dähne","full_name":"Dähne, S.","first_name":"S."},{"full_name":"Nikulin, V. V.","last_name":"Nikulin","first_name":"V. V."},{"last_name":"Ramírez","full_name":"Ramírez, D.","first_name":"D."},{"first_name":"P. J.","full_name":"Schreier, P. J.","last_name":"Schreier"},{"full_name":"Müller, K.-R.","last_name":"Müller","first_name":"K.-R."},{"first_name":"S.","last_name":"Haufe","full_name":"Haufe, S."}],"date_created":"2023-01-30T11:51:48Z","volume":96,"date_updated":"2023-01-30T12:00:41Z","citation":{"ama":"Dähne S, Nikulin VV, Ramírez D, Schreier PJ, Müller K-R, Haufe S. Finding brain oscillations with power dependencies in neuroimaging data. <i>NeuroImage</i>. 2014;96:334–348. doi:<a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">10.1016/j.neuroimage.2014.03.075</a>","ieee":"S. Dähne, V. V. Nikulin, D. Ramírez, P. J. Schreier, K.-R. Müller, and S. Haufe, “Finding brain oscillations with power dependencies in neuroimaging data,” <i>NeuroImage</i>, vol. 96, pp. 334–348, 2014, doi: <a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">10.1016/j.neuroimage.2014.03.075</a>.","chicago":"Dähne, S., V. V. Nikulin, D. Ramírez, P. J. Schreier, K.-R. Müller, and S. Haufe. “Finding Brain Oscillations with Power Dependencies in Neuroimaging Data.” <i>NeuroImage</i> 96 (2014): 334–348. <a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">https://doi.org/10.1016/j.neuroimage.2014.03.075</a>.","mla":"Dähne, S., et al. “Finding Brain Oscillations with Power Dependencies in Neuroimaging Data.” <i>NeuroImage</i>, vol. 96, 2014, pp. 334–348, doi:<a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">10.1016/j.neuroimage.2014.03.075</a>.","bibtex":"@article{Dähne_Nikulin_Ramírez_Schreier_Müller_Haufe_2014, title={Finding brain oscillations with power dependencies in neuroimaging data}, volume={96}, DOI={<a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">10.1016/j.neuroimage.2014.03.075</a>}, journal={NeuroImage}, author={Dähne, S. and Nikulin, V. V. and Ramírez, D. and Schreier, P. J. and Müller, K.-R. and Haufe, S.}, year={2014}, pages={334–348} }","short":"S. Dähne, V.V. Nikulin, D. Ramírez, P.J. Schreier, K.-R. Müller, S. Haufe, NeuroImage 96 (2014) 334–348.","apa":"Dähne, S., Nikulin, V. V., Ramírez, D., Schreier, P. J., Müller, K.-R., &#38; Haufe, S. (2014). Finding brain oscillations with power dependencies in neuroimaging data. <i>NeuroImage</i>, <i>96</i>, 334–348. <a href=\"https://doi.org/10.1016/j.neuroimage.2014.03.075\">https://doi.org/10.1016/j.neuroimage.2014.03.075</a>"},"page":"334–348","intvolume":"        96","year":"2014","user_id":"43497","department":[{"_id":"263"}],"_id":"40758","status":"public","abstract":[{"text":"Phase synchronization among neuronal oscillations within the same frequency band has been hypothesized to be a major mechanism for communication between different brain areas. On the other hand, cross-frequency com- munications are more flexible allowing interactions between oscillations with different frequencies. Among such cross-frequency interactions amplitude-to-amplitude interactions are of a special interest as they show how the strength of spatial synchronization in different neuronal populations relates to each other during a given task. While, previously, amplitude-to-amplitude correlations were studied primarily on the sensor level, we present a source separation approach using spatial filters which maximize the correlation between the envelopes of brain oscillations recorded with electro-/magnetoencephalography (EEG/MEG) or intracranial multichannel re- cordings. Our approach, which is called canonical source power correlation analysis (cSPoC), is thereby capable of extracting genuine brain oscillations solely based on their assumed coupling behavior even when the signal-to- noise ratio of the signals is low. In addition to using cSPoC for the analysis of cross-frequency interactions in the same subject, we show that it can also be utilized for studying amplitude dynamics of neuronal oscillations across subjects. We assess the performance of cSPoC in simulations as well as in three distinctively different analysis sce- narios of real EEG data, each involving several subjects. In the simulations, cSPoC outperforms unsupervised state-of-the-art approaches. In the analysis of real EEG recordings, we demonstrate excellent unsupervised dis- covery of meaningful power-to-power couplings, within as well as across subjects and frequency bands.","lang":"eng"}],"type":"journal_article","publication":"NeuroImage"},{"status":"public","abstract":[{"text":"Detecting and analyzing directional structures in images is important in many applications since one-dimensional patterns often correspond to important features such as object contours or trajectories. Classifying a structure as directional or non-directional requires a measure to quantify the degree of directionality and a threshold, which needs to be chosen based on the statistics of the image. In order to do this, we model the image as a random field. So far, little research has been performed on analyzing directionality in random fields. In this paper, we propose a measure to quantify the degree of directionality based on the random monogenic signal, which enables a unique decomposition of a 2D signal into local amplitude, local orientation, and local phase. We investigate the second-order statistical properties of the monogenic signal for isotropic, anisotropic, and unidirectional random fields. We analyze our measure of directionality for finite-size sample images, and determine a threshold to distinguish between unidirectional and non-unidirectional random fields, which allows the automatic classification of images.","lang":"eng"}],"publication":"IEEE Trans.\\ Inform.\\ Theory","type":"journal_article","department":[{"_id":"263"}],"user_id":"43497","_id":"40762","intvolume":"        60","page":"6491–6510","citation":{"bibtex":"@article{Olhede_Ramírez_Schreier_2014, title={Detecting Directionality in Random Fields Using the Monogenic Signal}, volume={60}, DOI={<a href=\"https://doi.org/10.1109/TIT.2014.2342734\">10.1109/TIT.2014.2342734</a>}, number={10}, journal={IEEE Trans.\\ Inform.\\ Theory}, author={Olhede, S. C. and Ramírez, D. and Schreier, P. J.}, year={2014}, pages={6491–6510} }","short":"S.C. Olhede, D. Ramírez, P.J. Schreier, IEEE Trans.\\ Inform.\\ Theory 60 (2014) 6491–6510.","mla":"Olhede, S. C., et al. “Detecting Directionality in Random Fields Using the Monogenic Signal.” <i>IEEE Trans.\\ Inform.\\ Theory</i>, vol. 60, no. 10, 2014, pp. 6491–6510, doi:<a href=\"https://doi.org/10.1109/TIT.2014.2342734\">10.1109/TIT.2014.2342734</a>.","apa":"Olhede, S. C., Ramírez, D., &#38; Schreier, P. J. (2014). Detecting Directionality in Random Fields Using the Monogenic Signal. <i>IEEE Trans.\\ Inform.\\ Theory</i>, <i>60</i>(10), 6491–6510. <a href=\"https://doi.org/10.1109/TIT.2014.2342734\">https://doi.org/10.1109/TIT.2014.2342734</a>","chicago":"Olhede, S. C., D. Ramírez, and P. J. Schreier. “Detecting Directionality in Random Fields Using the Monogenic Signal.” <i>IEEE Trans.\\ Inform.\\ Theory</i> 60, no. 10 (2014): 6491–6510. <a href=\"https://doi.org/10.1109/TIT.2014.2342734\">https://doi.org/10.1109/TIT.2014.2342734</a>.","ieee":"S. C. Olhede, D. Ramírez, and P. J. Schreier, “Detecting Directionality in Random Fields Using the Monogenic Signal,” <i>IEEE Trans.\\ Inform.\\ Theory</i>, vol. 60, no. 10, pp. 6491–6510, 2014, doi: <a href=\"https://doi.org/10.1109/TIT.2014.2342734\">10.1109/TIT.2014.2342734</a>.","ama":"Olhede SC, Ramírez D, Schreier PJ. Detecting Directionality in Random Fields Using the Monogenic Signal. <i>IEEE Trans\\ Inform\\ Theory</i>. 2014;60(10):6491–6510. doi:<a href=\"https://doi.org/10.1109/TIT.2014.2342734\">10.1109/TIT.2014.2342734</a>"},"year":"2014","issue":"10","doi":"10.1109/TIT.2014.2342734","title":"Detecting Directionality in Random Fields Using the Monogenic Signal","volume":60,"author":[{"full_name":"Olhede, S. C.","last_name":"Olhede","first_name":"S. C."},{"full_name":"Ramírez, D.","last_name":"Ramírez","first_name":"D."},{"last_name":"Schreier","full_name":"Schreier, P. J.","first_name":"P. J."}],"date_created":"2023-01-30T11:51:48Z","date_updated":"2023-01-30T12:00:35Z"},{"publication":"IEEE Signal Process. Lett.","type":"journal_article","abstract":[{"lang":"eng","text":"Alternating minimization and steepest descent are commonly used strategies to obtain interference alignment (IA) solutions in the $K$-user multiple-input multiple-output (MIMO) interference channel (IC). Although these algorithms are shown to converge monotonically, they experience a poor convergence rate, requiring an enormous amount of iterations which substantially increases with the size of the scenario. To alleviate this drawback, in this letter we resort to the Gauss-Newton (GN) method, which is well-known to experience quadratic convergence when the iterates are sufficiently close to the optimum. We discuss the convergence properties of the proposed GN algorithm and provide several numerical examples showing that it always converges to the optimum with quadratic rate, reducing dramatically the required computation time in comparison to other algorithms, hence paving a new way for the design of IA algorithms."}],"status":"public","_id":"40760","department":[{"_id":"263"}],"user_id":"43497","year":"2014","intvolume":"        21","page":"1423–1427","citation":{"chicago":"Lameiro, Christian, and Ignacio Santamaría. “A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels.” <i>IEEE Signal Process. Lett.</i> 21 (2014): 1423–1427. <a href=\"https://doi.org/10.1109/LSP.2014.2338132\">https://doi.org/10.1109/LSP.2014.2338132</a>.","ieee":"C. Lameiro and I. Santamaría, “A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels,” <i>IEEE Signal Process. Lett.</i>, vol. 21, pp. 1423–1427, 2014, doi: <a href=\"https://doi.org/10.1109/LSP.2014.2338132\">10.1109/LSP.2014.2338132</a>.","ama":"Lameiro C, Santamaría I. A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels. <i>IEEE Signal Process Lett</i>. 2014;21:1423–1427. doi:<a href=\"https://doi.org/10.1109/LSP.2014.2338132\">10.1109/LSP.2014.2338132</a>","mla":"Lameiro, Christian, and Ignacio Santamaría. “A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels.” <i>IEEE Signal Process. Lett.</i>, vol. 21, 2014, pp. 1423–1427, doi:<a href=\"https://doi.org/10.1109/LSP.2014.2338132\">10.1109/LSP.2014.2338132</a>.","short":"C. Lameiro, I. Santamaría, IEEE Signal Process. Lett. 21 (2014) 1423–1427.","bibtex":"@article{Lameiro_Santamaría_2014, title={A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/LSP.2014.2338132\">10.1109/LSP.2014.2338132</a>}, journal={IEEE Signal Process. Lett.}, author={Lameiro, Christian and Santamaría, Ignacio}, year={2014}, pages={1423–1427} }","apa":"Lameiro, C., &#38; Santamaría, I. (2014). A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels. <i>IEEE Signal Process. Lett.</i>, <i>21</i>, 1423–1427. <a href=\"https://doi.org/10.1109/LSP.2014.2338132\">https://doi.org/10.1109/LSP.2014.2338132</a>"},"date_updated":"2023-01-30T12:00:39Z","volume":21,"date_created":"2023-01-30T11:51:48Z","author":[{"full_name":"Lameiro, Christian","last_name":"Lameiro","first_name":"Christian"},{"first_name":"Ignacio","full_name":"Santamaría, Ignacio","last_name":"Santamaría"}],"title":"A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels","doi":"10.1109/LSP.2014.2338132"},{"type":"conference","publication":"Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers","abstract":[{"text":"This paper derives the interference-temperature (IT) limit for a multi-antenna primary user (PU) with a rate constraint. While in the case of a single-antenna PU there is a one-to-one mapping between IT and achievable rate, this correspondence does not hold anymore when a multiple-input multiple-output (MIMO) system is considered. In such cases, the spatial distribution of the interference must be taken into account, since it strongly affects the PU performance. To this end, we derive a closed-form expression for the maximum IT that can be tolerated by identifying the worst-case interference covariance matrix, which results in a multilevel waterfilling problem.","lang":"eng"}],"status":"public","_id":"40761","user_id":"43497","department":[{"_id":"263"}],"year":"2014","place":"Pacific Grove, CA, USA","citation":{"apa":"Lameiro, C., Utschick, W., &#38; Santamaría, I. (2014). Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users. <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>. <a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">https://doi.org/10.1109/ACSSC.2014.7094625</a>","mla":"Lameiro, Christian, et al. “Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users.” <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>, 2014, doi:<a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">10.1109/ACSSC.2014.7094625</a>.","bibtex":"@inproceedings{Lameiro_Utschick_Santamaría_2014, place={Pacific Grove, CA, USA}, title={Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users}, DOI={<a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">10.1109/ACSSC.2014.7094625</a>}, booktitle={Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers}, author={Lameiro, Christian and Utschick, Wolfgang and Santamaría, Ignacio}, year={2014} }","short":"C. Lameiro, W. Utschick, I. Santamaría, in: Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers, Pacific Grove, CA, USA, 2014.","chicago":"Lameiro, Christian, Wolfgang Utschick, and Ignacio Santamaría. “Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users.” In <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>. Pacific Grove, CA, USA, 2014. <a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">https://doi.org/10.1109/ACSSC.2014.7094625</a>.","ieee":"C. Lameiro, W. Utschick, and I. Santamaría, “Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users,” 2014, doi: <a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">10.1109/ACSSC.2014.7094625</a>.","ama":"Lameiro C, Utschick W, Santamaría I. Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users. In: <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>. ; 2014. doi:<a href=\"https://doi.org/10.1109/ACSSC.2014.7094625\">10.1109/ACSSC.2014.7094625</a>"},"date_updated":"2023-01-30T12:00:33Z","author":[{"full_name":"Lameiro, Christian","last_name":"Lameiro","first_name":"Christian"},{"full_name":"Utschick, Wolfgang","last_name":"Utschick","first_name":"Wolfgang"},{"full_name":"Santamaría, Ignacio","last_name":"Santamaría","first_name":"Ignacio"}],"date_created":"2023-01-30T11:51:48Z","title":"Interference-Temperature Limit for Cognitive Radio Networks with MIMO Primary Users","doi":"10.1109/ACSSC.2014.7094625"},{"department":[{"_id":"263"}],"user_id":"43497","_id":"40759","status":"public","abstract":[{"text":"We derive an estimator of the cycle period of a univariate cyclostationary process based on an information- theoretic criterion. Transforming the univariate cyclostationary process into a vector-valued wide-sense stationary process allows us to obtain the structure of the covariance matrix, which is block-Toeplitz, and its block size depends on the unknown cycle period. Therefore, we sweep the block size and obtain the ML estimate of the covariance matrix, required for the information- theoretic criterion. Since there are no closed-form ML estimates of block-Toeplitz matrices, we asymptotically approximate them as block-circulant. Finally, some numerical examples show the good performance of the proposed estimator.","lang":"eng"}],"publication":"Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers","type":"conference","title":"A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process","date_created":"2023-01-30T11:51:48Z","author":[{"last_name":"Ramírez","full_name":"Ramírez, D.","first_name":"D."},{"last_name":"Schreier","full_name":"Schreier, P. J.","first_name":"P. J."},{"full_name":"Vía, J.","last_name":"Vía","first_name":"J."},{"first_name":"I.","last_name":"Santamaría","full_name":"Santamaría, I."},{"last_name":"Scharf","full_name":"Scharf, L. L.","first_name":"L. L."}],"date_updated":"2023-01-30T12:00:37Z","citation":{"apa":"Ramírez, D., Schreier, P. J., Vía, J., Santamaría, I., &#38; Scharf, L. L. (2014). A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process. <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>.","bibtex":"@inproceedings{Ramírez_Schreier_Vía_Santamaría_Scharf_2014, place={Pacific Grove, USA}, title={A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process}, booktitle={Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers}, author={Ramírez, D. and Schreier, P. J. and Vía, J. and Santamaría, I. and Scharf, L. L.}, year={2014} }","mla":"Ramírez, D., et al. “A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process.” <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>, 2014.","short":"D. Ramírez, P.J. Schreier, J. Vía, I. Santamaría, L.L. Scharf, in: Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers, Pacific Grove, USA, 2014.","ama":"Ramírez D, Schreier PJ, Vía J, Santamaría I, Scharf LL. A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process. In: <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>. ; 2014.","ieee":"D. Ramírez, P. J. Schreier, J. Vía, I. Santamaría, and L. L. Scharf, “A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process,” 2014.","chicago":"Ramírez, D., P. J. Schreier, J. Vía, I. Santamaría, and L. L. Scharf. “A Regularized Maximum Likelihood Estimator for the Period of a Cyclostationary Process.” In <i>Proc.\\ Asilomar Conf.\\ Signals Syst.\\ Computers</i>. Pacific Grove, USA, 2014."},"year":"2014","place":"Pacific Grove, USA"},{"issue":"5","year":"2014","citation":{"short":"T. Adali, P.J. Schreier, IEEE Signal Processing Magazine 31 (2014) 112–128.","mla":"Adali, Tulay, and Peter J. Schreier. “Optimization and Estimation of Complex-Valued Signals.” <i>IEEE Signal Processing Magazine</i>, vol. 31, no. 5, 2014, pp. 112–128, doi:<a href=\"https://doi.org/10.1109/MSP.2013.2287951\">10.1109/MSP.2013.2287951</a>.","bibtex":"@article{Adali_Schreier_2014, title={Optimization and estimation of complex-valued signals}, volume={31}, DOI={<a href=\"https://doi.org/10.1109/MSP.2013.2287951\">10.1109/MSP.2013.2287951</a>}, number={5}, journal={IEEE Signal Processing Magazine}, author={Adali, Tulay and Schreier, Peter J.}, year={2014}, pages={112–128} }","apa":"Adali, T., &#38; Schreier, P. J. (2014). Optimization and estimation of complex-valued signals. <i>IEEE Signal Processing Magazine</i>, <i>31</i>(5), 112–128. <a href=\"https://doi.org/10.1109/MSP.2013.2287951\">https://doi.org/10.1109/MSP.2013.2287951</a>","chicago":"Adali, Tulay, and Peter J. Schreier. “Optimization and Estimation of Complex-Valued Signals.” <i>IEEE Signal Processing Magazine</i> 31, no. 5 (2014): 112–128. <a href=\"https://doi.org/10.1109/MSP.2013.2287951\">https://doi.org/10.1109/MSP.2013.2287951</a>.","ieee":"T. Adali and P. J. Schreier, “Optimization and estimation of complex-valued signals,” <i>IEEE Signal Processing Magazine</i>, vol. 31, no. 5, pp. 112–128, 2014, doi: <a href=\"https://doi.org/10.1109/MSP.2013.2287951\">10.1109/MSP.2013.2287951</a>.","ama":"Adali T, Schreier PJ. Optimization and estimation of complex-valued signals. <i>IEEE Signal Processing Magazine</i>. 2014;31(5):112–128. doi:<a href=\"https://doi.org/10.1109/MSP.2013.2287951\">10.1109/MSP.2013.2287951</a>"},"intvolume":"        31","page":"112–128","date_updated":"2023-01-30T12:00:30Z","author":[{"first_name":"Tulay","last_name":"Adali","full_name":"Adali, Tulay"},{"first_name":"Peter J.","full_name":"Schreier, Peter J.","last_name":"Schreier"}],"date_created":"2023-01-30T11:51:48Z","volume":31,"title":"Optimization and estimation of complex-valued signals","doi":"10.1109/MSP.2013.2287951","type":"journal_article","publication":"IEEE Signal Processing Magazine","abstract":[{"text":"Complex-valued signals occur in many areas of science and engineering and are thus of fundamental interest. When developing signal processing methods in the complex domain, there are two key issues: making use of the full statistical information and optimization. In this article, we review the necessary tools to address these two key issues and provide examples in filtering and blind source separation (BSS) that utilize these tools.","lang":"eng"}],"status":"public","_id":"40763","user_id":"43497","department":[{"_id":"263"}]},{"status":"public","type":"conference","publication":"Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.","user_id":"43497","department":[{"_id":"263"}],"_id":"40769","citation":{"bibtex":"@inproceedings{Lameiro_Santamaría_Utschick_2014, place={Florence, Italy}, title={Interference Shaping Constraints for Underlay MIMO Interference Channels}, DOI={<a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">10.1109/ICASSP.2014.6855020</a>}, booktitle={Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.}, author={Lameiro, Christian and Santamaría, Ignacio and Utschick, Wolfgang}, year={2014} }","short":"C. Lameiro, I. Santamaría, W. Utschick, in: Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process., Florence, Italy, 2014.","mla":"Lameiro, Christian, et al. “Interference Shaping Constraints for Underlay MIMO Interference Channels.” <i>Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.</i>, 2014, doi:<a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">10.1109/ICASSP.2014.6855020</a>.","apa":"Lameiro, C., Santamaría, I., &#38; Utschick, W. (2014). Interference Shaping Constraints for Underlay MIMO Interference Channels. <i>Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.</i> <a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">https://doi.org/10.1109/ICASSP.2014.6855020</a>","chicago":"Lameiro, Christian, Ignacio Santamaría, and Wolfgang Utschick. “Interference Shaping Constraints for Underlay MIMO Interference Channels.” In <i>Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.</i> Florence, Italy, 2014. <a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">https://doi.org/10.1109/ICASSP.2014.6855020</a>.","ieee":"C. Lameiro, I. Santamaría, and W. Utschick, “Interference Shaping Constraints for Underlay MIMO Interference Channels,” 2014, doi: <a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">10.1109/ICASSP.2014.6855020</a>.","ama":"Lameiro C, Santamaría I, Utschick W. Interference Shaping Constraints for Underlay MIMO Interference Channels. In: <i>Proc.\\ IEEE Int.\\ Conf.\\ Acoustics, Speech and Signal Process.</i> ; 2014. doi:<a href=\"https://doi.org/10.1109/ICASSP.2014.6855020\">10.1109/ICASSP.2014.6855020</a>"},"place":"Florence, Italy","year":"2014","doi":"10.1109/ICASSP.2014.6855020","title":"Interference Shaping Constraints for Underlay MIMO Interference Channels","date_created":"2023-01-30T11:51:49Z","author":[{"first_name":"Christian","last_name":"Lameiro","full_name":"Lameiro, Christian"},{"last_name":"Santamaría","full_name":"Santamaría, Ignacio","first_name":"Ignacio"},{"full_name":"Utschick, Wolfgang","last_name":"Utschick","first_name":"Wolfgang"}],"date_updated":"2023-01-30T12:00:46Z"},{"author":[{"last_name":"Stein","full_name":"Stein, Manuel","first_name":"Manuel"},{"last_name":"Mezghani","full_name":"Mezghani, Amine","first_name":"Amine"},{"first_name":"Josef A.","last_name":"Nossek","full_name":"Nossek, Josef A."}],"date_created":"2023-01-30T11:51:49Z","volume":21,"date_updated":"2023-01-30T12:00:44Z","doi":"10.1109/LSP.2014.2316008","title":"A lower bound for the Fisher information measure","issue":"7","citation":{"apa":"Stein, M., Mezghani, A., &#38; Nossek, J. A. (2014). A lower bound for the Fisher information measure. <i>IEEE Signal Process.\\ Lett.</i>, <i>21</i>(7), 796–799. <a href=\"https://doi.org/10.1109/LSP.2014.2316008\">https://doi.org/10.1109/LSP.2014.2316008</a>","mla":"Stein, Manuel, et al. “A Lower Bound for the Fisher Information Measure.” <i>IEEE Signal Process.\\ Lett.</i>, vol. 21, no. 7, 2014, pp. 796–799, doi:<a href=\"https://doi.org/10.1109/LSP.2014.2316008\">10.1109/LSP.2014.2316008</a>.","short":"M. Stein, A. Mezghani, J.A. Nossek, IEEE Signal Process.\\ Lett. 21 (2014) 796–799.","bibtex":"@article{Stein_Mezghani_Nossek_2014, title={A lower bound for the Fisher information measure}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/LSP.2014.2316008\">10.1109/LSP.2014.2316008</a>}, number={7}, journal={IEEE Signal Process.\\ Lett.}, author={Stein, Manuel and Mezghani, Amine and Nossek, Josef A.}, year={2014}, pages={796–799} }","ama":"Stein M, Mezghani A, Nossek JA. A lower bound for the Fisher information measure. <i>IEEE Signal Process\\ Lett</i>. 2014;21(7):796–799. doi:<a href=\"https://doi.org/10.1109/LSP.2014.2316008\">10.1109/LSP.2014.2316008</a>","chicago":"Stein, Manuel, Amine Mezghani, and Josef A. Nossek. “A Lower Bound for the Fisher Information Measure.” <i>IEEE Signal Process.\\ Lett.</i> 21, no. 7 (2014): 796–799. <a href=\"https://doi.org/10.1109/LSP.2014.2316008\">https://doi.org/10.1109/LSP.2014.2316008</a>.","ieee":"M. Stein, A. Mezghani, and J. A. Nossek, “A lower bound for the Fisher information measure,” <i>IEEE Signal Process.\\ Lett.</i>, vol. 21, no. 7, pp. 796–799, 2014, doi: <a href=\"https://doi.org/10.1109/LSP.2014.2316008\">10.1109/LSP.2014.2316008</a>."},"intvolume":"        21","page":"796–799","year":"2014","user_id":"43497","department":[{"_id":"263"}],"_id":"40765","type":"journal_article","publication":"IEEE Signal Process.\\ Lett.","status":"public"},{"_id":"8171","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"article_type":"original","extern":"1","type":"journal_article","status":"public","oa":"1","date_updated":"2023-02-28T11:02:47Z","author":[{"first_name":"Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541","full_name":"Gharibian, Sevag"},{"first_name":"Julia","full_name":"Kempe, Julia","last_name":"Kempe"}],"volume":14,"main_file_link":[{"url":"https://arxiv.org/abs/1209.1055","open_access":"1"}],"publication_status":"published","citation":{"apa":"Gharibian, S., &#38; Kempe, J. (2014). Hardness of approximation for quantum problems. <i>Quantum Information &#38; Computation</i>, <i>14</i>(5–6), 517–540.","mla":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 5–6, 2014, pp. 517–40.","bibtex":"@article{Gharibian_Kempe_2014, title={Hardness of approximation for quantum problems}, volume={14}, number={5–6}, journal={Quantum Information &#38; Computation}, author={Gharibian, Sevag and Kempe, Julia}, year={2014}, pages={517–540} }","short":"S. Gharibian, J. Kempe, Quantum Information &#38; Computation 14 (2014) 517–540.","ama":"Gharibian S, Kempe J. Hardness of approximation for quantum problems. <i>Quantum Information &#38; Computation</i>. 2014;14(5-6):517-540.","ieee":"S. Gharibian and J. Kempe, “Hardness of approximation for quantum problems,” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 5–6, pp. 517–540, 2014.","chicago":"Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.” <i>Quantum Information &#38; Computation</i> 14, no. 5–6 (2014): 517–40."},"page":"517-540","intvolume":"        14","external_id":{"arxiv":["1209.1055"]},"keyword":["Hardness of approximation","polynomial time hierarchy","succinct set cover","quantum complexity"],"language":[{"iso":"eng"}],"publication":"Quantum Information & Computation","abstract":[{"lang":"eng","text":"The polynomial hierarchy plays a central role in classical complexity theory. Here, we define\r\na quantum generalization of the polynomial hierarchy, and initiate its study. We show that\r\nnot only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate. Using the same techniques, we\r\nalso obtain hardness of approximation for the class QCMA. Our approach is based on the\r\nuse of dispersers, and is inspired by the classical results of Umans regarding hardness of approximation for the second level of the classical polynomial hierarchy [Umans, FOCS 1999].\r\nThe problems for which we prove hardness of approximation for include, among others, a\r\nquantum version of the Succinct Set Cover problem, and a variant of the local Hamiltonian\r\nproblem with hybrid classical-quantum ground states."}],"date_created":"2019-03-01T11:56:55Z","title":"Hardness of approximation for quantum problems","issue":"5-6","year":"2014"},{"status":"public","type":"journal_article","extern":"1","article_type":"original","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","_id":"8172","page":"1-30","intvolume":"        14","citation":{"chicago":"W. Berry, Dominic, Richard Cleve, and Sevag Gharibian. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i> 14, no. 1–2 (2014): 1–30.","ieee":"D. W. Berry, R. Cleve, and S. Gharibian, “Gate-efficient discrete simulations of continuous-time quantum query algorithms,” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, pp. 1–30, 2014.","ama":"W. Berry D, Cleve R, Gharibian S. Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>. 2014;14(1-2):1-30.","bibtex":"@article{W. Berry_Cleve_Gharibian_2014, title={Gate-efficient discrete simulations of continuous-time quantum query algorithms}, volume={14}, number={1–2}, journal={Quantum Information &#38; Computation}, author={W. Berry, Dominic and Cleve, Richard and Gharibian, Sevag}, year={2014}, pages={1–30} }","short":"D. W. Berry, R. Cleve, S. Gharibian, Quantum Information &#38; Computation 14 (2014) 1–30.","mla":"W. Berry, Dominic, et al. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, 2014, pp. 1–30.","apa":"W. Berry, D., Cleve, R., &#38; Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>, <i>14</i>(1–2), 1–30."},"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1211.4637","open_access":"1"}],"volume":14,"author":[{"full_name":"W. Berry, Dominic","last_name":"W. Berry","first_name":"Dominic"},{"last_name":"Cleve","full_name":"Cleve, Richard","first_name":"Richard"},{"first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379"}],"oa":"1","date_updated":"2023-02-28T11:02:58Z","abstract":[{"text":"We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar running time.","lang":"eng"}],"publication":"Quantum Information & Computation","language":[{"iso":"eng"}],"external_id":{"arxiv":["1211.4637"]},"year":"2014","issue":"1-2","title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","date_created":"2019-03-01T11:59:24Z"},{"external_id":{"arxiv":["1211.3588"]},"keyword":["Computational Theory and Mathematics","General Mathematics"],"language":[{"iso":"eng"}],"publication":"LMS Journal of Computation and Mathematics","abstract":[{"text":"Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial, is a very old problem. Currently, the best algorithmic solution is Stauduhar’s method. Computationally, one of the key challenges in the application of Stauduhar’s method is to find, for a given pair of groups H<G, a G-relative H-invariant, that is a multivariate polynomial F that is H-invariant, but not G-invariant. While generic, theoretical methods are known to find such F, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm.","lang":"eng"}],"publisher":"Wiley","date_created":"2022-12-22T10:53:44Z","title":"Computation of Galois groups of rational polynomials","issue":"1","year":"2014","_id":"34845","department":[{"_id":"102"}],"user_id":"93826","type":"journal_article","status":"public","date_updated":"2023-03-06T09:43:56Z","volume":17,"author":[{"last_name":"Fieker","full_name":"Fieker, Claus","first_name":"Claus"},{"id":"21202","full_name":"Klüners, Jürgen","last_name":"Klüners","first_name":"Jürgen"}],"doi":"10.1112/s1461157013000302","publication_identifier":{"issn":["1461-1570"]},"publication_status":"published","page":"141-158","intvolume":"        17","citation":{"chicago":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i> 17, no. 1 (2014): 141–58. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>.","ieee":"C. Fieker and J. Klüners, “Computation of Galois groups of rational polynomials,” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, pp. 141–158, 2014, doi: <a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>.","ama":"Fieker C, Klüners J. Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>. 2014;17(1):141-158. doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>","apa":"Fieker, C., &#38; Klüners, J. (2014). Computation of Galois groups of rational polynomials. <i>LMS Journal of Computation and Mathematics</i>, <i>17</i>(1), 141–158. <a href=\"https://doi.org/10.1112/s1461157013000302\">https://doi.org/10.1112/s1461157013000302</a>","bibtex":"@article{Fieker_Klüners_2014, title={Computation of Galois groups of rational polynomials}, volume={17}, DOI={<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>}, number={1}, journal={LMS Journal of Computation and Mathematics}, publisher={Wiley}, author={Fieker, Claus and Klüners, Jürgen}, year={2014}, pages={141–158} }","mla":"Fieker, Claus, and Jürgen Klüners. “Computation of Galois Groups of Rational Polynomials.” <i>LMS Journal of Computation and Mathematics</i>, vol. 17, no. 1, Wiley, 2014, pp. 141–58, doi:<a href=\"https://doi.org/10.1112/s1461157013000302\">10.1112/s1461157013000302</a>.","short":"C. Fieker, J. Klüners, LMS Journal of Computation and Mathematics 17 (2014) 141–158."}},{"department":[{"_id":"59"}],"user_id":"20179","_id":"39483","language":[{"iso":"eng"}],"keyword":["Electrical and Electronic Engineering","Surfaces","Coatings and Films","Safety","Risk","Reliability and Quality","Condensed Matter Physics","Atomic and Molecular Physics","and Optics","Electronic","Optical and Magnetic Materials"],"publication":"Microelectronics Reliability","type":"journal_article","status":"public","volume":54,"author":[{"first_name":"F.F.","last_name":"Vidor","full_name":"Vidor, F.F."},{"last_name":"Wirth","full_name":"Wirth, G.I.","first_name":"G.I."},{"id":"20179","full_name":"Hilleringmann, Ulrich","last_name":"Hilleringmann","first_name":"Ulrich"}],"date_created":"2023-01-24T11:25:42Z","date_updated":"2023-03-22T10:15:06Z","publisher":"Elsevier BV","doi":"10.1016/j.microrel.2014.07.147","title":"Low temperature fabrication of a ZnO nanoparticle thin-film transistor suitable for flexible electronics","issue":"12","publication_identifier":{"issn":["0026-2714"]},"publication_status":"published","intvolume":"        54","page":"2760-2765","citation":{"apa":"Vidor, F. F., Wirth, G. I., &#38; Hilleringmann, U. (2014). Low temperature fabrication of a ZnO nanoparticle thin-film transistor suitable for flexible electronics. <i>Microelectronics Reliability</i>, <i>54</i>(12), 2760–2765. <a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">https://doi.org/10.1016/j.microrel.2014.07.147</a>","bibtex":"@article{Vidor_Wirth_Hilleringmann_2014, title={Low temperature fabrication of a ZnO nanoparticle thin-film transistor suitable for flexible electronics}, volume={54}, DOI={<a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">10.1016/j.microrel.2014.07.147</a>}, number={12}, journal={Microelectronics Reliability}, publisher={Elsevier BV}, author={Vidor, F.F. and Wirth, G.I. and Hilleringmann, Ulrich}, year={2014}, pages={2760–2765} }","short":"F.F. Vidor, G.I. Wirth, U. Hilleringmann, Microelectronics Reliability 54 (2014) 2760–2765.","mla":"Vidor, F. F., et al. “Low Temperature Fabrication of a ZnO Nanoparticle Thin-Film Transistor Suitable for Flexible Electronics.” <i>Microelectronics Reliability</i>, vol. 54, no. 12, Elsevier BV, 2014, pp. 2760–65, doi:<a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">10.1016/j.microrel.2014.07.147</a>.","ama":"Vidor FF, Wirth GI, Hilleringmann U. Low temperature fabrication of a ZnO nanoparticle thin-film transistor suitable for flexible electronics. <i>Microelectronics Reliability</i>. 2014;54(12):2760-2765. doi:<a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">10.1016/j.microrel.2014.07.147</a>","ieee":"F. F. Vidor, G. I. Wirth, and U. Hilleringmann, “Low temperature fabrication of a ZnO nanoparticle thin-film transistor suitable for flexible electronics,” <i>Microelectronics Reliability</i>, vol. 54, no. 12, pp. 2760–2765, 2014, doi: <a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">10.1016/j.microrel.2014.07.147</a>.","chicago":"Vidor, F.F., G.I. Wirth, and Ulrich Hilleringmann. “Low Temperature Fabrication of a ZnO Nanoparticle Thin-Film Transistor Suitable for Flexible Electronics.” <i>Microelectronics Reliability</i> 54, no. 12 (2014): 2760–65. <a href=\"https://doi.org/10.1016/j.microrel.2014.07.147\">https://doi.org/10.1016/j.microrel.2014.07.147</a>."},"year":"2014"}]