Venue TF 104
1) Linear Physical Layer Network Coding for multihop wireless networks
Lecturer: Alister Burr, University of York, UK
We introduce the concept of linear physical-layer network coding (LPNC) and discuss its application to multi-hop wireless relay networks, for applications such as ‘smart grids’ and the Internet of Things. “Linear” here implies that the network coding functions are linear on some algebraic field or ring; we first consider the requirements for such functions to ensure both that the data from all sources can be decoded at any destination(s) where it is required, and also that the required functions can be decoded at each relay. We then introduce some possible algebraic structures that might be used for these functions, in particular some based on binary matrices. We also compare performance of these structures in some very simple examples.
Alister Burr received a BSc degree from University of Southampton in 1979 and PhD from University of Bristol in 1984, and is now at University of York, UK, where he has been Professor of Communications since 2001. His research interests are primarily concerned with the physical layer of wireless communications, including coded modulation, turbocodes, iterative methods, MIMO, and most recently physical layer network coding. He has been chair of the PHY working group in the COST wireless Actions 273, 2100 and IC1004.
2) Doubly-Greedy Stage Scheduling Algorithm and Hierarchical Network Transfer Function for Half-duplex WPNC Networks
Lecturer: Jan Sykora, Czech Technical University in Prague
Abstract-Wireless Physical Layer Network Coding (WPNC) based communication networks deliver the information from sources to destinations through the complex relay network. In order to properly design Network Coded Modulation transmitted by network nodes and relay processing including the Hierarchical Network Code (HNC) maps, we need a formal description of the global network processing function. Any practical implementation also implies the half-duplex constrained relays which imposes the network to work in multiple stages. We present a polynomial based formalism defining the Hierarchical Network Transfer Function (H-NTF). It captures all phenomena related to the stage dependent transmit and receive activity over the network, including potential buffering, and mainly the hierarchy of forming the local HNC maps into the global hierarchical flow description. Using the polynomial formalism of H-NTF, we develop the half-duplex constrained stage scheduling algorithm. It starts with finding a minimal latency (or close to minimal) causal critical sequence with subsequent doubly (first Rx then Tx) greedy mapping of the node activity compliant with halfduplex constraint.
Jan Sykora received the M.Sc. and Ph.D. degrees in electrical engineering from Czech Technical University in Prague, Prague, Czech Republic, in 1987 and 1993, respectively. Since 1991, he has been with the Faculty of Electrical Engineering, Czech Technical University, where he is currently a Professor of radio engineering. He has led a number of industrial and research projects financed by the European Union and national agencies. His research interests include wireless communication and information theory, cooperative and distributed modulation, wireless physical layer network coding and distributed signal processing, multiple-input–multiple-output systems, nonlinear space–time modulation and coding, and iterative processing. Dr. Sykora has served on various IEEE conferences as Technical Program and Organizing Committee member and chair.
Viimeksi päivitetty: 26.3.2015