Algebraic techniques for deterministic networks

We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include operations over matrices and to admit both graphs and linear deterministic networks as special cases. Our algorithms build on this generalized framework, and provide as special cases unicast and multicast algorithms for deterministic networks, as well as network code designs using structured matrices.


Presented at:
International Conference on Signal Processing and Communications (SPCOM 2010), Bangalore, India, July 18-21, 2010
Year:
2010
Laboratories:




 Record created 2012-01-26, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)