Holger Boche

Christian Deppe

Andreas Winter

Raymond W. Yeung

Jens Stoye

Ulrich Tamm

Ingo Althöfer

Rami Ezzine

Ning Cai was an eminent mathematician, engineer and computer scientist who made many significant contributions to information theory. In particular, his work on network coding theory created a new research direction for the community. Prof. Cai’s passion for science inspired his collaborators across the fields of classical and quantum information theory, combinatorics, computation, post-Shannon theory, and coding theory, and the contributions in this volume reflect his success as a researcher and mentor.

Festschrift in Memory of Ning Cai

Information Theory and Related Fields

Tansu Alpcan

Michael L. Honig

An innovative and comprehensive book presenting state-of-the-art research into wireless spectrum allocation based on game theory and mechanism design.

Mechanisms and Games for Dynamic Spectrum Allocation

H. Vincent Poor

Rafael F. Schaefer

Ashish Khisti

Learn how information theoretic approaches can inform the design of more secure information systems and networks with this expert guide. Covering theoretical models, analytical results, and the state of the art in research, it will be of interest to researchers, graduate students, and practitioners working in communications engineering.

Information Theoretic Security and Privacy of Information Systems

Slawomir Stanczak

Marcin Wiczanowski

The purpose of this book is to provide tools for a better understanding of the fundamental tradeo?s and interdependencies in wireless networks, with the goal of designing resource allocation strategies that exploit these int- dependencies to achieve signi?cant performance gains. Two facts prompted us to write it: First, future wireless applications will require a fundamental understanding of the design principles and control mechanisms in wireless networks. Second, the complexity of the network problems simply precludes the use of engineering common sense alone to identify good solutions, and so mathematics becomes the key avenue to cope with central technical problems in the design of wireless networks. In this book, two ?elds of mathematics play a central role: Perron-Frobenius theory for non-negative matrices and optimization theory. This book is a revised and expanded version of the research monograph “Resource Allocation in Wireless Networks” that was published as Lecture Notes in Computer Sciences (LNCS 4000) in 2006. Although the general structure has remained unchanged to a large extent, the book contains - merous additional results and more detailed discussion. For instance, there is a more extensive treatment of general nonnegative matrices and interf- ence functions that are described by an axiomatic model. Additional material on max-min fairness, proportional fairness, utility-based power control with QoS (quality of service) support and stochastic power control has been added.

Theory and Algorithms

Fundamentals of Resource Allocation in Wireless Networks

Martin Schubert

This book develops a mathematical framework for modeling and optimizing interference-coupled multiuser systems. At the core of this framework is the concept of general interference functions, which provides a simple means of characterizing interdependencies between users. The entire analysis builds on the two core axioms scale-invariance and monotonicity. The proposed network calculus has its roots in power control theory and wireless communications. It adds theoretical tools for analyzing the typical behavior of interference-coupled networks. In this way it complements existing game-theoretic approaches. The framework should also be viewed in conjunction with optimization theory. There is a fruitful interplay between the theory of interference functions and convex optimization theory. By jointly exploiting the properties of interference functions, it is possible to design algorithms that outperform general-purpose techniques that only exploit convexity. The title “network calculus” refers to the fact that the theory of interference functions constitutes a generic theoretical framework for the analysis of interference coupled systems. Certain operations within the framework are “closed”, that is, combinations of interference functions are interference functions again. Also, certain properties are preserved under such operations. This, provides a methodology for analyzing different multiuser performance measures that can be expressed as interference functions or combinations of interference functions.

A General Framework for Interference Management and Network Utility Optimization

Interference Calculus

Eduard Jorswieck

Majorization Theory and Matrix-Monotone Functions in Wireless Communications, reviews the basic definitions of Majorization Theory and Matrix-Monotone Functions, describing their concepts clearly with many illustrative examples. In addition to this tutorial, new results are presented with respect to Schur-convex functions and regarding the properties of matrix-monotone functions. The approach taken by the authors provides a valuable overview of the basic techniques for readers who are new to the subject. They then proceed to show in separate chapters the cutting edge applications of the two basic theories in wireless communications. Majorization Theory and Matrix-Monotone Functions in Wireless Communications is an invaluable resource for students, researchers and practitioners involved in the state-of-the-art design of wireless communication systems.

Majorization and Matrix-monotone Functions in Wireless Communications

Giuseppe Caire

Rudolf Mathar

Robert Calderbank

Gitta Kutyniok

Maximilian März

This contributed volume contains articles written by the plenary and invited speakers from the second international MATHEON Workshop 2015 that focus on applications of compressed sensing. Article authors address their techniques for solving the problems of compressed sensing, as well as connections to related areas like detecting community-like structures in graphs, curbatures on Grassmanians, and randomized tensor train singular value decompositions. Some of the novel applications covered include dimensionality reduction, information theory, random matrices, sparse approximation, and sparse recovery. This book is aimed at both graduate students and researchers in the areas of applied mathematics, computer science, and engineering, as well as other applied scientists exploring the potential applications for the novel methodology of compressed sensing. An introduction to the subject of compressed sensing is also provided for researchers interested in the field who are not as familiar with it.

Second International MATHEON Conference 2015

Compressed Sensing and its Applications

Jan Vybíral

Since publication of the initial papers in 2006, compressed sensing has captured the imagination of the international signal processing community, and the mathematical foundations are nowadays quite well understood. Parallel to the progress in mathematics, the potential applications of compressed sensing have been explored by many international groups of, in particular, engineers and applied mathematicians, achieving very promising advances in various areas such as communication theory, imaging sciences, optics, radar technology, sensor networks, or tomography. Since many applications have reached a mature state, the research center MATHEON in Berlin focusing on "Mathematics for Key Technologies", invited leading researchers on applications of compressed sensing from mathematics, computer science, and engineering to the "MATHEON Workshop 2013: Compressed Sensing and its Applications” in December 2013. It was the first workshop specifically focusing on the applications of compressed sensing. This book features contributions by the plenary and invited speakers of this workshop. To make this book accessible for those unfamiliar with compressed sensing, the book will not only contain chapters on various applications of compressed sensing written by plenary and invited speakers, but will also provide a general introduction into compressed sensing. The book is aimed at both graduate students and researchers in the areas of applied mathematics, computer science, and engineering as well as other applied scientists interested in the potential and applications of the novel methodology of compressed sensing. For those readers who are not already familiar with compressed sensing, an introduction to the basics of this theory will be included.

MATHEON Workshop 2013

Riccardo Bassoli

Roberto Ferrara

Gisbert Janssen

Sajad Saeedinaeeni

Frank H. P. Fitzek

This book provides a tutorial on quantum communication networks. The authors discuss current paradigm shifts in communication networks that are needed to add computing and storage to the simple transport ideas of prevailing networks. They show how these ‘softwarized’ solutions break new grounds to reduce latency and increase resilience. The authors discuss how even though these solutions have inherent problems due to introduced computing latency and energy consumption, the problems can be solved by hybrid classical-quantum communication networks. The book brings together quantum networking, quantum information theory, quantum computing, and quantum simulation.

Quantum Communication Networks

Since publication of the initial papers in 2006, compressed sensing has captured the imagination of the international signal processing community, and the mathematical foundations are nowadays quite well understood. Parallel to the progress in mathematics, the potential applications of compressed sensing have been explored by many international groups of, in particular, engineers and applied mathematicians, achieving very promising advances in various areas such as communication theory, imaging sciences, optics, radar technology, sensor networks, or tomography. Since many applications have reached a mature state, the research center MATHEON in Berlin focusing on "Mathematics for Key Technologies", invited leading researchers on applications of compressed sensing from mathematics, computer science, and engineering to the "MATHEON Workshop 2013: Compressed Sensing and its Applications" in December 2013. It was the first workshop specifically focusing on the applications of compressed sensing. This book features contributions by the plenary and invited speakers of this workshop. To make this book accessible for those unfamiliar with compressed sensing, the book will not only contain chapters on various applications of compressed sensing written by plenary and invited speakers, but will also provide a general introduction into compressed sensing. The book is aimed at both graduate students and researchers in the areas of applied mathematics, computer science, and engineering as well as other applied scientists interested in the potential and applications of the novel methodology of compressed sensing. For those readers who are not already familiar with compressed sensing, an introduction to the basics of this theory will be included.

Compressed Sensing and Its Applications

Philipp Petersen

The chapters in this volume highlight the state-of-the-art of compressed sensing and are based on talks given at the third international MATHEON conference on the same topic, held from December 4-8, 2017 at the Technical University in Berlin. In addition to methods in compressed sensing, chapters provide insights into cutting edge applications of deep learning in data science, highlighting the overlapping ideas and methods that connect the fields of compressed sensing and deep learning. Specific topics covered include: Quantized compressed sensing Classification Machine learning Oracle inequalities Non-convex optimization Image reconstruction Statistical learning theory This volume will be a valuable resource for graduate students and researchers in the areas of mathematics, computer science, and engineering, as well as other applied scientists exploring potential applications of compressed sensing.

Third International MATHEON Conference 2017

Volker Pohl

The requirement of causality in system theory is inevitably accompanied by the appearance of certain mathematical operations, namely the Riesz proj- tion,theHilberttransform,andthespectralfactorizationmapping.Aclassical exampleillustratingthisisthedeterminationoftheso-calledWiener?lter(the linear, minimum means square error estimation ?lter for stationary stochastic sequences [88]). If the ?lter is not required to be causal, the transfer function of the Wiener ?lter is simply given by H(?)=? (?)/? (?),where ? (?) xy xx xx and ? (?) are certain given functions. However, if one requires that the - xy timation ?lter is causal, the transfer function of the optimal ?lter is given by 1 ? (?) xy H(?)= P ,?? (??,?] . + [? ] (?) [? ] (?) xx + xx? Here [? ] and [? ] represent the so called spectral factors of ? ,and xx + xx? xx P is the so called Riesz projection. Thus, compared to the non-causal ?lter, + two additional operations are necessary for the determination of the causal ?lter, namely the spectral factorization mapping ? ? ([? ] ,[? ] ),and xx xx + xx? the Riesz projection P .

Holger Boche

Books

Your next favorite book is out there