68 research outputs found

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    Conception de nouveaux couplages en circuits supraconducteurs

    Get PDF
    Les circuits supraconducteurs se sont imposés dans le domaine de l'informatique quantique. Une preuve nette de leur performance est la récente démonstration de la suprématie quantique par Google. Des processeurs quantiques à grande échelle sont déjà construits à l'heure actuelle. Toutefois, des améliorations de l'architecture supraconductrice, tant du point de vue des qubits que des portes logiques, sont toujours nécessaires. En effet, la propagation d'erreurs dans le processeur est toujours trop importante pour être enrayée, par exemple, avec des codes correcteurs. Des solutions pour réduire les erreurs sont, par conséquent, primordiales. La propagation d'erreurs dans un processeur quantique résulte ultimement du couplage entre les qubits qui est toutefois nécessaire pour réaliser des portes logiques. La réduction des erreurs dans le processeur passera donc en partie par l'optimisation de ces couplages. Dans cette thèse, je propose de nouvelles façons de coupler des modes en circuits supraconducteurs et présente trois projets réalisés pendant mon doctorat. Premièrement, afin de mieux concevoir les processeurs quantiques, il est nécessaire de pouvoir estimer avec le plus de précision possible la vitesse et la fidélité des portes logiques ainsi que l'amplitude des erreurs logiques. J'introduis une théorie de perturbation qui permet d'analyser les effets du couplage et du pilotage forts des qubits dans un processeur quantique. Cette théorie est basée à la fois sur la théorie de Floquet, la théorie de Schrödinger et la théorie des graphes. Deuxièmement, les coupleurs à deux qubits permettent de mitiger les erreurs dans les processeurs à plusieurs qubits. Cependant, la plupart des coupleurs y arrivent en ajustant de manière précise leurs paramètres de circuit et ne se concentrent généralement que sur l'élimination de certaines interactions parasitaires. J'introduis un coupleur supraconducteur à deux qubits qui soulage ces limitations en supprimant toutes les interactions entre les qubits avec un rapport marche-arrêt exponentiellement grand et qui ne nécessite pas de calibration précise. Il s'agit d'un coupleur à deux modes: un mode ``bus'' est connecté à un mode d'un résonateur non linéaire ancillaire. Le pilotage linéaire du mode ancillaire entraine un déplacement du champ dans le résonateur qui dépend de l'état propre du bus. Cela engendre une élimination exponentielle des interactions réelles et virtuelles entre les qubits avec l'amplitude du pilotage. Finalement, je propose une nouvelle interaction de type charge-flux entre deux modes dans une architecture hybride supraconductrice semi-conductrice. L'interaction devient non réciproque en présence d'un champ magnétique externe statique. J'utilise cette propriété pour concevoir un gyrateur passif

    Understanding Quantum Technologies 2022

    Full text link
    Understanding Quantum Technologies 2022 is a creative-commons ebook that provides a unique 360 degrees overview of quantum technologies from science and technology to geopolitical and societal issues. It covers quantum physics history, quantum physics 101, gate-based quantum computing, quantum computing engineering (including quantum error corrections and quantum computing energetics), quantum computing hardware (all qubit types, including quantum annealing and quantum simulation paradigms, history, science, research, implementation and vendors), quantum enabling technologies (cryogenics, control electronics, photonics, components fabs, raw materials), quantum computing algorithms, software development tools and use cases, unconventional computing (potential alternatives to quantum and classical computing), quantum telecommunications and cryptography, quantum sensing, quantum technologies around the world, quantum technologies societal impact and even quantum fake sciences. The main audience are computer science engineers, developers and IT specialists as well as quantum scientists and students who want to acquire a global view of how quantum technologies work, and particularly quantum computing. This version is an extensive update to the 2021 edition published in October 2021.Comment: 1132 pages, 920 figures, Letter forma

    Intelligent Sensors for Human Motion Analysis

    Get PDF
    The book, "Intelligent Sensors for Human Motion Analysis," contains 17 articles published in the Special Issue of the Sensors journal. These articles deal with many aspects related to the analysis of human movement. New techniques and methods for pose estimation, gait recognition, and fall detection have been proposed and verified. Some of them will trigger further research, and some may become the backbone of commercial systems

    Collected Papers (on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics), Volume XI

    Get PDF
    This eleventh volume of Collected Papers includes 90 papers comprising 988 pages on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics, written between 2001-2022 by the author alone or in collaboration with the following 84 co-authors (alphabetically ordered) from 19 countries: Abhijit Saha, Abu Sufian, Jack Allen, Shahbaz Ali, Ali Safaa Sadiq, Aliya Fahmi, Atiqa Fakhar, Atiqa Firdous, Sukanto Bhattacharya, Robert N. Boyd, Victor Chang, Victor Christianto, V. Christy, Dao The Son, Debjit Dutta, Azeddine Elhassouny, Fazal Ghani, Fazli Amin, Anirudha Ghosha, Nasruddin Hassan, Hoang Viet Long, Jhulaneswar Baidya, Jin Kim, Jun Ye, Darjan Karabašević, Vasilios N. Katsikis, Ieva Meidutė-Kavaliauskienė, F. Kaymarm, Nour Eldeen M. Khalifa, Madad Khan, Qaisar Khan, M. Khoshnevisan, Kifayat Ullah,, Volodymyr Krasnoholovets, Mukesh Kumar, Le Hoang Son, Luong Thi Hong Lan, Tahir Mahmood, Mahmoud Ismail, Mohamed Abdel-Basset, Siti Nurul Fitriah Mohamad, Mohamed Loey, Mai Mohamed, K. Mohana, Kalyan Mondal, Muhammad Gulfam, Muhammad Khalid Mahmood, Muhammad Jamil, Muhammad Yaqub Khan, Muhammad Riaz, Nguyen Dinh Hoa, Cu Nguyen Giap, Nguyen Tho Thong, Peide Liu, Pham Huy Thong, Gabrijela Popović‬‬‬‬‬‬‬‬‬‬, Surapati Pramanik, Dmitri Rabounski, Roslan Hasni, Rumi Roy, Tapan Kumar Roy, Said Broumi, Saleem Abdullah, Muzafer Saračević, Ganeshsree Selvachandran, Shariful Alam, Shyamal Dalapati, Housila P. Singh, R. Singh, Rajesh Singh, Predrag S. Stanimirović, Kasan Susilo, Dragiša Stanujkić, Alexandra Şandru, Ovidiu Ilie Şandru, Zenonas Turskis, Yunita Umniyati, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Binyamin Yusoff, Edmundas Kazimieras Zavadskas, Zhao Loon Wang.‬‬‬

    Resource allocation in non-orthogonal multiple access technologies for 5G networks and beyond.

    Get PDF
    Doctoral Degree. University of KwaZulu-Natal, Durban.The increasing demand of mobile and device connectivity poses challenging requirements for 5G wireless communications, such as high energy- and spectral-efficiency and low latency. This necessitates a shift from orthogonal multiple access (OMA) to Non-Orthogonal Multiple Access (NOMA) techniques, namely, power-domain NOMA (PD-NOMA) and code-domain NOMA (CD-NOMA). The basic idea behind NOMA schemes is to co-multiplex different users on the same resource elements (time slot, OFDMA sub-carrier, or spreading code) via power domain (PD) or code domain (CD) at the transmitter while permitting controllable interference, and their successful multi-user detection (MUD) at the receiver albeit, increased computational complexity. In this work, an analysis on the performance of the existing NOMA schemes is carried out. Furthermore, we investigate the feasibility of a proposed uplink hybrid-NOMA scheme namely power domain sparse code multiple access (PD-SCMA) that integrates PD-NOMA and CD-NOMA based sparse code multiple access (SCMA) on heterogeneous networks (HetNets). Such hybrid schemes come with resource allocation (RA) challenges namely; codebook allocation, user pairing and power allocation. Therefore, hybrid RA schemes namely: Successive Codebook Ordering Assignment (SCOA) for codebook assignment (CA), opportunistic macro cell user equipment (MUE)- small cell user equipment (SUE) pairing (OMSP) for user pairing (UP), and a QoS-aware power allocation (QAPA) for power allocation (PA) are developed for an energy efficient (EE) system. The performance of the RA schemes is analyzed alongside an analytical RA optimization algorithm. Through numerical results, the proposed schemes show significant improvements in the EE of the small cells in comparison with the prevalent schemes. Additionally, there is significant sum rate performance improvement over the conventional SCMA and PD-NOMA. Secondly, we investigate the multiplexing capacity of the hybrid PD-SCMA scheme in HetNets. Particularly, we investigate and derive closed-form solutions for codebook capacity, MUE multiplexing and power capacity bounds. The system’s performance results into low outage when the system’s point of operation is within the multiplexing bounds. To alleviate the RA challenges of such a system at the transmitter, dual parameter ranking (DPR) and alternate search method (ASM) based RA schemes are proposed. The results show significant capacity gain with DPR-RA in comparison with conventional RA schemes. Lastly, we investigate the feasibility of integrating the hybrid PD-SCMA with multiple-input multipleoutput (MIMO) technique namely, M-PD-SCMA. The attention to M-PD-SCMA resides in the need of lower number of antennas while preserving the system capacity thanks to the overload in PDSCMA. To enhance spectral efficiency and error performance we propose spatial multiplexing at the transmitter and a low complex joint MUD scheme based on successive interference cancellation (SIC) and expectation propagation algorithm (EPA) at the receiver are proposed. Numerical results exhibit performance benchmark with PD-SCMA schemes and the proposed receiver achieves guaranteed bit error rate (BER) performance with a bounded increase in the number of transmit and receive antennas. Thus, the feasibility of an M-PD-SCMA system is validated

    Efficient algorithms and data structures for compressive sensing

    Get PDF
    Wegen der kontinuierlich anwachsenden Anzahl von Sensoren, und den stetig wachsenden Datenmengen, die jene produzieren, stößt die konventielle Art Signale zu verarbeiten, beruhend auf dem Nyquist-Kriterium, auf immer mehr Hindernisse und Probleme. Die kürzlich entwickelte Theorie des Compressive Sensing (CS) formuliert das Versprechen einige dieser Hindernisse zu beseitigen, indem hier allgemeinere Signalaufnahme und -rekonstruktionsverfahren zum Einsatz kommen können. Dies erlaubt, dass hierbei einzelne Abtastwerte komplexer strukturierte Informationen über das Signal enthalten können als dies bei konventiellem Nyquistsampling der Fall ist. Gleichzeitig verändert sich die Signalrekonstruktion notwendigerweise zu einem nicht-linearen Vorgang und ebenso müssen viele Hardwarekonzepte für praktische Anwendungen neu überdacht werden. Das heißt, dass man zwischen der Menge an Information, die man über Signale gewinnen kann, und dem Aufwand für das Design und Betreiben eines Signalverarbeitungssystems abwägen kann und muss. Die hier vorgestellte Arbeit trägt dazu bei, dass bei diesem Abwägen CS mehr begünstigt werden kann, indem neue Resultate vorgestellt werden, die es erlauben, dass CS einfacher in der Praxis Anwendung finden kann, wobei die zu erwartende Leistungsfähigkeit des Systems theoretisch fundiert ist. Beispielsweise spielt das Konzept der Sparsity eine zentrale Rolle, weshalb diese Arbeit eine Methode präsentiert, womit der Grad der Sparsity eines Vektors mittels einer einzelnen Beobachtung geschätzt werden kann. Wir zeigen auf, dass dieser Ansatz für Sparsity Order Estimation zu einem niedrigeren Rekonstruktionsfehler führt, wenn man diesen mit einer Rekonstruktion vergleicht, welcher die Sparsity des Vektors unbekannt ist. Um die Modellierung von Signalen und deren Rekonstruktion effizienter zu gestalten, stellen wir das Konzept von der matrixfreien Darstellung linearer Operatoren vor. Für die einfachere Anwendung dieser Darstellung präsentieren wir eine freie Softwarearchitektur und demonstrieren deren Vorzüge, wenn sie für die Rekonstruktion in einem CS-System genutzt wird. Konkret wird der Nutzen dieser Bibliothek, einerseits für das Ermitteln von Defektpositionen in Prüfkörpern mittels Ultraschall, und andererseits für das Schätzen von Streuern in einem Funkkanal aus Ultrabreitbanddaten, demonstriert. Darüber hinaus stellen wir für die Verarbeitung der Ultraschalldaten eine Rekonstruktionspipeline vor, welche Daten verarbeitet, die im Frequenzbereich Unterabtastung erfahren haben. Wir beschreiben effiziente Algorithmen, die bei der Modellierung und der Rekonstruktion zum Einsatz kommen und wir leiten asymptotische Resultate für die benötigte Anzahl von Messwerten, sowie die zu erwartenden Lokalisierungsgenauigkeiten der Defekte her. Wir zeigen auf, dass das vorgestellte System starke Kompression zulässt, ohne die Bildgebung und Defektlokalisierung maßgeblich zu beeinträchtigen. Für die Lokalisierung von Streuern mittels Ultrabreitbandradaren stellen wir ein CS-System vor, welches auf einem Random Demodulators basiert. Im Vergleich zu existierenden Messverfahren ist die hieraus resultierende Schätzung der Kanalimpulsantwort robuster gegen die Effekte von zeitvarianten Funkkanälen. Um den inhärenten Modellfehler, den gitterbasiertes CS begehen muss, zu beseitigen, zeigen wir auf wie Atomic Norm Minimierung es erlaubt ohne die Einschränkung auf ein endliches und diskretes Gitter R-dimensionale spektrale Komponenten aus komprimierten Beobachtungen zu schätzen. Hierzu leiten wir eine R-dimensionale Variante des ADMM her, welcher dazu in der Lage ist die Signalkovarianz in diesem allgemeinen Szenario zu schätzen. Weiterhin zeigen wir, wie dieser Ansatz zur Richtungsschätzung mit realistischen Antennenarraygeometrien genutzt werden kann. In diesem Zusammenhang präsentieren wir auch eine Methode, welche mittels Stochastic gradient descent Messmatrizen ermitteln kann, die sich gut für Parameterschätzung eignen. Die hieraus resultierenden Kompressionsverfahren haben die Eigenschaft, dass die Schätzgenauigkeit über den gesamten Parameterraum ein möglichst uniformes Verhalten zeigt. Zuletzt zeigen wir auf, dass die Kombination des ADMM und des Stochastic Gradient descent das Design eines CS-Systems ermöglicht, welches in diesem gitterfreien Szenario wünschenswerte Eigenschaften hat.Along with the ever increasing number of sensors, which are also generating rapidly growing amounts of data, the traditional paradigm of sampling adhering the Nyquist criterion is facing an equally increasing number of obstacles. The rather recent theory of Compressive Sensing (CS) promises to alleviate some of these drawbacks by proposing to generalize the sampling and reconstruction schemes such that the acquired samples can contain more complex information about the signal than Nyquist samples. The proposed measurement process is more complex and the reconstruction algorithms necessarily need to be nonlinear. Additionally, the hardware design process needs to be revisited as well in order to account for this new acquisition scheme. Hence, one can identify a trade-off between information that is contained in individual samples of a signal and effort during development and operation of the sensing system. This thesis addresses the necessary steps to shift the mentioned trade-off more to the favor of CS. We do so by providing new results that make CS easier to deploy in practice while also maintaining the performance indicated by theoretical results. The sparsity order of a signal plays a central role in any CS system. Hence, we present a method to estimate this crucial quantity prior to recovery from a single snapshot. As we show, this proposed Sparsity Order Estimation method allows to improve the reconstruction error compared to an unguided reconstruction. During the development of the theory we notice that the matrix-free view on the involved linear mappings offers a lot of possibilities to render the reconstruction and modeling stage much more efficient. Hence, we present an open source software architecture to construct these matrix-free representations and showcase its ease of use and performance when used for sparse recovery to detect defects from ultrasound data as well as estimating scatterers in a radio channel using ultra-wideband impulse responses. For the former of these two applications, we present a complete reconstruction pipeline when the ultrasound data is compressed by means of sub-sampling in the frequency domain. Here, we present the algorithms for the forward model, the reconstruction stage and we give asymptotic bounds for the number of measurements and the expected reconstruction error. We show that our proposed system allows significant compression levels without substantially deteriorating the imaging quality. For the second application, we develop a sampling scheme to acquire the channel Impulse Response (IR) based on a Random Demodulator that allows to capture enough information in the recorded samples to reliably estimate the IR when exploiting sparsity. Compared to the state of the art, this in turn allows to improve the robustness to the effects of time-variant radar channels while also outperforming state of the art methods based on Nyquist sampling in terms of reconstruction error. In order to circumvent the inherent model mismatch of early grid-based compressive sensing theory, we make use of the Atomic Norm Minimization framework and show how it can be used for the estimation of the signal covariance with R-dimensional parameters from multiple compressive snapshots. To this end, we derive a variant of the ADMM that can estimate this covariance in a very general setting and we show how to use this for direction finding with realistic antenna geometries. In this context we also present a method based on a Stochastic gradient descent iteration scheme to find compression schemes that are well suited for parameter estimation, since the resulting sub-sampling has a uniform effect on the whole parameter space. Finally, we show numerically that the combination of these two approaches yields a well performing grid-free CS pipeline

    LIPIcs, Volume 248, ISAAC 2022, Complete Volume

    Get PDF
    LIPIcs, Volume 248, ISAAC 2022, Complete Volum

    Radio Communications

    Get PDF
    In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks
    corecore