S.-Y. Robert Li (Bob Li) CUHK

Slides:



Advertisements
Similar presentations
Mahdi Barhoush Mohammad Hanaysheh
Advertisements

Signals and Systems Fall 2003 Lecture #3 11 September 2003
An Easy-to-Decode Network Coding Scheme for Wireless Broadcasting
Cyclic Code.
Error Control Code.
Network coding techniques Elena Fasolo Network coding techniques Elena Fasolo PhD Student - SIGNET Group Wireless Systems - Lecture.
Network-Coded Multiple Access Presented by Soung Liew (Joint Work with Lu Lu, Lizhao You, Shenghao Yang) Institute of Network Coding The Chinese University.
Cellular Communications
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
Forward Error Correction Steven Marx CSC45712/04/2001.
Page 1 Page 1 Network Coding Theory: Tutorial Presented by Avishek Nag Networks Research Lab UC Davis.
1 NTRU: A Ring-Based Public Key Cryptosystem Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman LNCS 1423, 1998.
Network Alignment: Treating Networks as Wireless Interference Channel Chun Meng Univ. of California, Irvine.
Connections between Network Coding and Matroid Theory Qifu Sun Institute of Network Coding (Shenzhen), CUHK 30, Aug., 2013.
On Multiplicative Matrix Channels over Finite Chain Rings Roberto W. Nobrega, Chen Feng, Danilo Silva, Bartolomeu F. Uchoa-Filho Conference version: NetCod.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Lesson 8-1 Multiplying Monomials. Mathematics Standards -Number, Number Sense and Operations: Explain the effects of operations such as multiplication.
Application of Finite Geometry LDPC code on the Internet Data Transport Wu Yuchun Oct 2006 Huawei Hisi Company Ltd.
Analysis of Precoding-based Intersession Network Coding and The Corresponding 3-Unicast Interference Alignment Scheme Jaemin Han, Chih-Chun Wang * Center.
CODING/DECODING CONCEPTS AND BLOCK CODING. ERROR DETECTION CORRECTION Increase signal power Decrease signal power Reduce Diversity Retransmission Forward.
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
Information and Coding Theory Cyclic codes Juris Viksna, 2015.
Channel Coding Binit Mohanty Ketan Rajawat. Recap…  Information is transmitted through channels (eg. Wires, optical fibres and even air)  Channels are.
CS434/534: Mobile Computing and Wireless Networks Y. Richard Yang 08/30/2012.
Elementary Coding Theory Including Hamming and Reed-Solomom Codes with Maple and MATLAB Richard Klima Appalachian State University Boone, North Carolina.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
EXPRESSIONS, FORMULAS, AND PROPERTIES 1-1 and 1-2.
Channel Coding and Error Control 1. Outline Introduction Linear Block Codes Cyclic Codes Cyclic Redundancy Check (CRC) Convolutional Codes Turbo Codes.
Slope-intercept Form to Standard Form and Standard Form to Slope-intercept Form Robert Conyer Algebra II.
LINEAR ALGEBRA APPLICATION TO CODING THEORY. Introduction Transmitted messages, like data from a satellite, are always subject to noise. Therefore, to.
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Data Link Control. The two main functions of the data link layer are data link control and media access control. The first, data link control, deals with.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Jaringan Komputer_D3 TT
3.3 Dividing Polynomials.
A proposed Security Incident Management Process for WMO Member States
Information and Coding Theory
Network coding techniques
MODELS OF COMMUNICATION IN RELATION TO MEDIA LITERACY
Algebraic Signal Processing Theory
Network Coding and its Applications in Communication Networks
Ct1403 Lecture#2: DATA LINK LAYER
Chapter 10: Solving Linear Systems of Equations
Domain 1: The Number System
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
Hiroshi Hirai University of Tokyo
Blind Known Interference Cancellation
Network Coding Testbed
Optimal network coding & matroid
The Medium Access Control Sublayer
Fundamental Theorem of Algebra
Suhua Tang Hiroyuki YOMO, Tetsuro UEDA, Ryu MIURA, Sadao OBANA
Cyclic Code.
Chapter 4: Data Communication and Networks
Data Link Layer 2019/2/19.
Logic Circuits I Lecture 3.
Error Correction Code (1)
2/25/2019May 2008 November 2007 doc.: IEEE /2752r1 January 2009
Achieving Single Channel, Full Duplex Wireless Communication
1-3 Square Roots Warm Up Lesson Presentation Lesson Quiz
Mathematics for Signals and Systems
Two-Way Coding by Beam-Forming for WLAN
1-3 Square Roots Warm Up Lesson Presentation Lesson Quiz
Dr. John P. Abraham Professor UTPA
Lecture 19 The Vector Space Znp (Section 5.1)
Chapter 10 Error Detection and Correction
Mathematical Background: Extension Finite Fields
Presentation transcript:

S.-Y. Robert Li (Bob Li) CUHK Linear NCAn Overview on Theory & Applications Network coding at the presence of cycles S.-Y. Robert Li (Bob Li) CUHK Overview overlaps with other talk. Will be brief and spend more time on newer things.

The butterfly network x y x+y x+y x+y 这就是 wireless butterfly network

Interpreting butterfly network as 2-way relay channel x y x+y T R Multicast 这就是 wireless butterfly network x y Physically,

Interpreting butterfly network as 2-way relay channel x y x+y T R Multicast Wireless transmission is multicasting in nature, perfect for applying NC. x y Wireless transmission

Half-duplex 2-way relay Store-and-forward, 4 steps to exchange a message through the middle relay x y 2019/5/9 數學與工程的對話 1: Network coding

Half-duplex 2-way relay Store-and-forward, 4 steps to exchange a message through the middle relay x y 2019/5/9 數學與工程的對話 1: Network coding

Half-duplex 2-way relay Store-and-forward, 4 steps to exchange a message through the middle relay x y NC, 3 steps x y 2019/5/9 數學與工程的對話 1: Network coding

Half-duplex 2-way relay Store-and-forward, 4 steps to exchange a message through the middle relay x y NC, 3 steps xy xy M.I.T. prototype standard of wireless LAN (802.11 Wi-Fi) 3GPP2 selects NC as its potential technology in 4G wireless systems. 2019/5/9 數學與工程的對話 1: Network coding

Communications on Mars A+B A B A B B A This example is taken from a proposal for a NASA project. The same application of NC can be used for satellite and wireless communications. In fact, this has been prototyped by MIT on the wireless local area network standard known as Wi-Fi or 802.11. 2019/5/9 數學與工程的對話 1: Network coding

Physical-layer NC (PNC) x y Store-and-forward, 4 steps x y NC, 3 steps xy x y 2 steps (1 reception & 1 transmission, naturally) 2019/5/9 數學與工程的對話 1: Network coding

Physical-layer NC (PNC) Store-and-forward, 4 steps x y x y NC, 3 steps xy Physical-layer NC, 2 steps x+y x+y “+” can be algebraic or physical 2019/5/9 數學與工程的對話 1: Network coding

Algebraic underpinning of NC The source generates symbols a, b  the symbol field. The message is a row vector (a b). In this instance, the symbol field = GF(2). a b a b a ab ab ab b

Algebraic underpinning of NC The source generates symbols a, b  the symbol field. The message is a row vector (a b). 1 a = (a b)  b a b a ab ab ab b 1 = (a b) 

Algebraic underpinning of NC The source generates symbols a, b  the symbol field. The message is a row vector (a b). The transmitted symbol is (a b) 1 1 1 1 x y 1 1 1 1 1

Message pipelining over a network Now consider a pipeline (a1 b1), (a2 b2), (a3 b3), (a4 b4), … of messages. NC theory is linear algebra on vectors over symbol field. Fundamental theory of NC deals with each individual message separately. But, when the network contains cycles, cyclic feedback convolves different messages together. Q. Can NC theory overcome cycles? a2b2 a1b1 a1b1 a3 b3 a4 b4

Message pipelining over a cyclic network A data unit = a whole pipeline (c0, c1, …, ct, …) of symbols  A rational power series t0 ct Dt // D = unit-time delay (rather than a polynomial) t0 atDt t0 btDt 2019/5/9

Convolutional network coding (CNC) A data unit = A rational power series rather an a polynomial The whole data = A row vector of rational power series a = t0 atDt b = t0 btDt a+bD 1–D 1 1 1 1 b a+bD 1–D a+bD 1–D a+b 1–D 1 1 a+b 1–D a 1 D 1 1 a+b 1–D

Convolutional network coding (CNC) A data unit = A rational power series rather an a polynomial The whole data = A row vector of rational power series a = (a b)  1 b = t0 btDt 1 D a+b 1–D = (a b) 

Convolutional network coding (CNC) CNC theory is linear algebra on vectors over the ring of rational power series. Q. But, does linear algebra really apply to a ring? 1 D

Field  Ring Can add, subtract, multiply, divide No linear algebra over a ring in general

Field  PID  Ring The ensemble of rational power series qualifies. (Principal ideal domain) The ensemble of rational power series qualifies. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors.

Field  PID  Ring The ensemble of rational power series qualifies. (Principal ideal domain) The ensemble of rational power series qualifies. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors. // We now provide a simple example. CNC theory becomes a special case of LNC theory over PID.

A taste of invariant factors The simplest PID is the integer ring Z. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors. This beautiful complication is called the “invariant factor decomposition theorem over a PID.”

Z2 = lattice points on grid = a free Z-module at rank 2 (“Vector space” over Z) (1, 0) (0, 1)

Theorem: A submodule over Z is also a free Z-module, which also attains the rank 2 in this instance. (1, 2) (0, 1) (3, 0) (1, 0) Pro vice chancellor of PLA Univ of HK

Theorem: A submodule over Z is also a free Z-module Theorem: A submodule over Z is also a free Z-module. Moreover, the bases of the two can be aligned. In this alignment, the sequential factors of the submodule in Z2 are (3, 2). (4, 2) (2, 1) (1, 0) (3, 0)

Moreover, can align so that “factors” divide one another. The sequential factors of the submodule in Z2 become (1, 6) in the new alignment.  As 1 | 6, the invariant factors are sequentially (1, 6).  Canonical (1, 2) (0, 1) (1, 2) (0, 6)

Field  PID  Ring //  Not implementable. (Principal ideal domain) The ensemble of rational power series qualifies. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors. CNC theory becomes a special case of LNC theory over PID, which however does not provide a sense of causal transmission. //  Not implementable.

Field  DVR  PID  Ring (Discrete valuation ring) A degenerated DVR with the trivial “valuation” The ensemble of rational power series qualifies. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors. It takes a long time to describe the “valuation.”

(Discrete valuation ring) Field  DVR  PID  Ring (Discrete valuation ring) The ensemble of rational power series qualifies. Linear algebra does apply to vectors over a PID except for the beautiful complication by invariant factors. The ensemble of rational power series again qualifies. LNC theory over a DVR provides a sense of causal transmission.

Conclusion Linear NC theory over a DVR generalizes both LNC and CNC theories for acyclic and cyclic networks. // DVR = ensemble of data units The discrete valuation in DVR provides a sense of causal transmission. // On an acyclic network, this sense is by the upstream-to-downstream order.

Commutative algebra vs. NC Linear NC theory over a DVR generalizes both LNC and CNC theories for acyclic and cyclic networks. // DVR = ensemble of data units The discrete valuation in DVR provides a sense of causal transmission. // On an acyclic network, this sense is by the upstream-to-downstream order. All coding vectors at the source linearly span a free module over the DVR; all incoming coding vectors to a receiver span a submodule. Decodability at the receiver = full rank of the submodule Decoding delay = the highest valuation among invariant factors of the submodule in the source module. Thank you.