View : 13 Download: 0

Low complexity algorithms for network coding based on singular value decomposition

Title
Low complexity algorithms for network coding based on singular value decomposition
Authors
Kwon J.Park H.
Ewha Authors
박형곤
SCOPUS Author ID
박형곤scopus
Issue Date
2016
Journal Title
International Conference on Ubiquitous and Future Networks, ICUFN
ISSN
2165-8528JCR Link
Citation
vol. 2016-August, pp. 641 - 643
Keywords
computational complexityNetwork codingsingular value decomposition (SVD)
Publisher
IEEE Computer Society
Indexed
SCOPUS scopus
Abstract
In this paper, we propose a low complexity algorithm for decoding where network coding is deployed in client-server networks. We consider battery powered clients, so that minimizing their power consumptions is essential. Our focus is thus on developing a decoding algorithm that can reduce the computational complexity. Unlike general decoding algorithms that are based on Gaussian elimination, we propose a decoding algorithm based on the singular value decomposition, as it enables to easily compute an inverse matrix, leading to lower decoding complexity. Our simulation results confirm that proposed algorithm can reduce not only the decoding complexity but also the overall network complexity. While the network efficiency of the proposed strategy is degraded as the network dimension increases, we show that the efficiency converges into a lower bound as the network dimension increases. These are confirmed by the simulation results. © 2016 IEEE.
DOI
10.1109/ICUFN.2016.7537111
ISBN
9781467399913
Appears in Collections:
엘텍공과대학 > 전자공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE