{"title":"Algorithm to improve the outage performance of IF Virtual MIMO system","authors":"A. Nahid, K. Nguyen, T. Chan","doi":"10.1109/AusCTW.2014.6766430","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766430","url":null,"abstract":"In this paper, we improve the outage performance of a 2 by 2 Virtual MIMO system based on Compute-and-Forward method [1]. The current scheme requires negotiations between the relays and destination to determine which decoded message the relay should transmit. We propose a scheme which requires no cooperation between relay and Central Office, thus reducing the transmission overhead and latency. We show that in many cases our schemes achieve the same performance as the case where decision is made globally.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information metrics for model selection in function estimation","authors":"T. Alpcan","doi":"10.1109/AusCTW.2014.6766426","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766426","url":null,"abstract":"A model selection framework is presented for function estimation under limited information, where only a small set of (noisy) data points are available for inferring the nonconvex unknown function of interest. The framework introduces information-theoretic metrics which quantify model complexity and are used in a multi-objective formulation of the function estimation problem. The intricate relationship between information obtained through observations and model complexity is investigated. The framework is applied to the hyperparameter selection problem in Gaussian Process Regression. As a result of its generality, the framework introduced is applicable to a variety of settings and practical problems with information limitations such as channel estimation, black-box optimisation, and dual control.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117113156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Software defined radio implementation of a two-way relay network with digital network coding","authors":"D. Kramarev, Y. Hong, E. Viterbo","doi":"10.1109/AUSCTW.2014.6766439","DOIUrl":"https://doi.org/10.1109/AUSCTW.2014.6766439","url":null,"abstract":"Network coding is a technology which has the potential to increase network throughput beyond existing standards based on routing. Despite the fact, that the theoretical understanding is mature, there have been only a few papers on implementation of network coding and demonstration of a working testbed. This paper presents the implementation of a two-way relay network with digital network coding. Unlike previous work, where the testbeds are implemented on custom hardware, we implement the testbed on GNU Radio, an open-source software defined radio platform. In this paper we discuss the implementation issues and the ways to overcome the hardware imperfections and software inadequacies of the GNU Radio platform. Using our testbed we measure the throughput of the system in an indoor environment. The experimental results show that the network coding outperforms the traditional routing as predicted by the theoretical analysis.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129970846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized Belief Propagation to break trapping sets in LDPC codes","authors":"Jean-Christophe Sibel, S. Reynal, D. Declercq","doi":"10.1109/AusCTW.2014.6766441","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766441","url":null,"abstract":"In this paper, we focus on the Generalized Belief Propagation (GBP) algorithm to solve trapping sets in Low-Density Parity-Check (LDPC) codes. Trapping sets are topological structures in Tanner graphs of LDPC codes that are not correctly decoded by Belief Propagation (BP), leading to exhibit an error-floor in the Bit-Error Rate (BER). Stemming from statistical physics of spin glasses, GBP consists in passing messages between clusters of Tanner graph nodes in another graph called the region-graph. Here, we introduce a specific clustering of nodes, based on a novel local loopfree principle, that breaks trapping sets such that the resulting region-graph is locally loopfree. We then construct a hybrid decoder made of BP and GBP that proves to be a powerful decoder as it clearly improves the BER and defeats the error-floor.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"23 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120916465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Down link performance for a Time Division Duplex broadcast network: Refined asymptotics for the power normalization constant","authors":"P. Whiting","doi":"10.1109/AusCTW.2014.6766444","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766444","url":null,"abstract":"A TDD OFDM scheme for broadcasting using a Massive MIMO array to a group of mobiles is considered. Asymptotic formulas are developed (fixed number of users K, M antennas going to ∞) for the constant χM used to normalise the Zero Forcing (ZF) matrix. This quantity is the reciprocal square root of the trace of a generalized Wishart matrix. Its asymptotic distribution is shown to be normal and approximations are obtained for its mean and variance. In some transmission schemes it may be necessary to estimate or track the mean of χ which appears in the channel model after zero forcing. The results show that this quantity varies as the 4th moment of the fading amplitude.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130988789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lossy broadcasting with common transmitter-receiver reconstructions","authors":"B. Vellambi, R. Timo","doi":"10.1109/AusCTW.2014.6766442","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766442","url":null,"abstract":"We consider a variant of Wyner-Ziv (WZ) coding over a broadcast channel where a source is to be communicated over a broadcast channel to two receivers that have side-information correlated with the source. In this variant, the transmitter and the receivers have to generate reconstructions that are (almost always) identical to one another, and each reconstruction meets a certain fidelity constraint. We present a complete characterization of the capacity region for the problem.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Arno G. Stefani, Johannes B. Huber, Christophe Jardin, H. Sticht
{"title":"A tight lower bound on the mutual information of a binary and an arbitrary finite random variable as a function of the variational distance","authors":"Arno G. Stefani, Johannes B. Huber, Christophe Jardin, H. Sticht","doi":"10.1109/AusCTW.2014.6766418","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766418","url":null,"abstract":"In this paper a numerical method is presented, which finds a tight lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have variational distance to a known joint distribution not greater than a known value. This lower bound can be applied to mutual information estimation with confidence intervals.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123890878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}