{"title":"Maximizing the Coverage-Intensity Product in random cellular networks","authors":"Tharaka Samarasinghe, Hazer Inaltekin, J. Evans","doi":"10.1109/AusCTW.2014.6766431","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766431","url":null,"abstract":"This paper studies a cellular network in which base station (BS) locations are modeled using a homogenous spatial Poisson point process, and user locations are modeled using an arbitrary stationary homogenous point process. The objective is to maximize the Coverage-Intensity Product (CIP), which represents the average number of users covered per unit area, under constraints on transmit power, BS intensity and transmit power density (per unit area). Expressions for the CIP are obtained considering two user coverage models that differ from each other depending on the BS-user association. Using these expressions, solutions for the optimization problem are provided. All these results are presented for general bounded path loss models that satisfy some mild conditions. The results are also illustrated using a specific bounded path loss model to provide further insights.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"8 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":"125016081","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":"Anytime spatially coupled codes for relay channel","authors":"Md. Noor-A.-Rahim, K. Nguyen, G. Lechner","doi":"10.1109/AUSCTW.2014.6766425","DOIUrl":"https://doi.org/10.1109/AUSCTW.2014.6766425","url":null,"abstract":"In this paper, we study linear anytime codes for the half duplex relay channel. We design anytime codes based on spatially coupled repeat-accumulate (SC-RA) codes. Through finite-length analysis and simulation results, we find that anytime SC-RA codes perform better than existing anytime codes. Furthermore, anytime SC-RA codes allow simple encoding compared to existing anytime spatially coupled low-density parity-check (LDPC) codes. Based on SC-RA codes, we design a bilayer anytime structure suitable for relaying networks with the decode-and-forward strategy. Using asymptotic analysis, we show that the proposed code structure achieves desired anytime properties.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"17 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":"134451722","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":"Timing information in wireless communications and optimal location verification frameworks","authors":"Shihao Yan, R. Malaney, Ido Nevat, G. Peters","doi":"10.1109/AusCTW.2014.6766443","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766443","url":null,"abstract":"The verification of location information in wireless networks is a relatively new area of research, but one of growing importance. In this work we explore two formal theoretical frameworks for an optimal location verification system in which physical-layer timing information is the main observational input. In our first framework, we derive an optimal decision-rule using the system input/output mutual information as the optimization metric. In the second framework, a more traditional Bayesian approach is adopted in which the misclassification error is used as the decision-rule's optimization metric. A verification-performance comparison between time-of-arrival (ToA) information and the more easily determined received signal strength (RSS) information is given. Our key finding is that for ToA accuracies attainable in next generation wireless networks, significant improvement in location verification can be expected relative to current RSS-based techniques. Our results are important for a wide range of emerging wireless networks and services, but especially for emerging Intelligent Transport Systems (ITS), where the authentication of location information is of critical importance to the safety and security of system users.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"23 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":"127246343","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":"Physical-layer network coding with Alamouti scheme for the TWRC with linear decoder","authors":"Mengyu Huang, Jinhong Yuan","doi":"10.1109/AusCTW.2014.6766437","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766437","url":null,"abstract":"In this paper, we consider a Rayleigh faded two-way relay channel with two antennas at each user and a single antenna at the relay. Two users adopt the Alamouti scheme to transmit BPSK modulated signals to the relay simultaneously. First, we develop eighteen types of physical-layer network codewords that can be applied in this system. To simplify the operation of the relay, we focus on two simplest types of physical-layer network codewords of the eighteen types. Then a linear decoder is proposed for the relay to detect the selected two types of network coded information of two users. We present the numerical result of the bit error probability of the proposed physical-layer network coding scheme with the linear decoder and discuss the further improvements of the decoder.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"96 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":"122561216","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":"Folded successive cancelation decoding of polar codes","authors":"S. Kahraman, E. Viterbo, M. Çelebi","doi":"10.1109/AUSCTW.2014.6766428","DOIUrl":"https://doi.org/10.1109/AUSCTW.2014.6766428","url":null,"abstract":"Polar codes are the first explicit class of codes that are provably capacity-achieving under the successive cancelation (SC) decoding. As a suboptimal decoder, SC has quasi-linear complexity N(1 + log N) in the code length N. In this paper, we propose a new non-binary SC decoder with reduced complexity N/2(1 + log N/2) based on the folding operation, which was first proposed in [11] to implement folded tree maximum-likelihood decoding of polar codes. Simulation results for the additive white Gaussian noise channel show that folded SC decoders can achieve the same error performance of standard SC by suitable selecting the folding of the polar code.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"121 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":"127562248","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}
C. Shang, Peter J. Smith, G. Woodward, H. Suraweera
{"title":"Linear transceivers for full duplex MIMO relays","authors":"C. Shang, Peter J. Smith, G. Woodward, H. Suraweera","doi":"10.1109/AusCTW.2014.6766420","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766420","url":null,"abstract":"Full duplex (FD) relays can provide throughput enhancements compared to half duplex (HD) operation. However, FD relays are known to suffer from loopback interference (LI) issues that degrade their performance. In this paper, we present several different precoder and weight vector designs using the principles of signal to leakage plus noise ratio, minimum mean square error and zero forcing to investigate the performance of a FD multiple input multiple output (MIMO) relay system. We derive a closed-form solution for the covariance matrix of the transmitted signal at the relay which enables a performance evaluation of a wide range of transceivers. Results show that performance improvements over HD can be achieved using only spatial processing (linear precoders and receive combiners) and that LI reduction at the relay is preferable to pre-cancellation at the relay transmitter.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"6 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":"132197818","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}
Shahriar Etemadi Tajbakhsh, P. Sadeghi, N. Aboutorab
{"title":"Instantly decodable network codes for cooperative index coding problem over general topologies","authors":"Shahriar Etemadi Tajbakhsh, P. Sadeghi, N. Aboutorab","doi":"10.1109/AusCTW.2014.6766433","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766433","url":null,"abstract":"We consider a group of n wireless clients and a set of k messages. Each client initially holds a subset of messages and is interested in an arbitrary subset of messages. Each client cooperates with other clients to obtain the set of messages it wants by exchanging instantly decodable network coded (IDNC) packets. This problem setting is known as the cooperative index coding problem. Clients are assumed to be connected through an arbitrary topology. In the absence of any known algorithm to complete the exchange of packets for general network topologies, we propose a greedy algorithm to satisfy the demands of all the clients with the aim of reducing the mean completion time. Our algorithm, in a completely distributed fashion, decides which subset of clients should transmit at each round of transmission and which messages should be coded together by each transmitting client to generate an IDNC packet. The algorithm encourages transmissions which are decodable for a larger number of clients and attempts to avoid collisions. We evaluate the performance of our algorithm via numerical experiments.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"88 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":"129292664","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":"Lossless compression of uniform binary sources with coded side-information","authors":"K. M. Morshed, I. Land, G. Lechner","doi":"10.1109/AusCTW.2014.6766436","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766436","url":null,"abstract":"This paper studies code design for lossless compression with coded side-information for uniform binary sources with symmetric correlation. We propose LDPC codes for binning and convolutional codes for coding the side-information, and we present two strategies to design the codes. We further investigate the rate gaps due to the imperfections of the practical binning and rate-distortion codes.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"48 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":"115937143","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":"Correction of in phase-quadrature imbalance in the presence of multipath fading","authors":"Khandker Nadya Haq, K. Chung","doi":"10.1109/AusCTW.2014.6766432","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766432","url":null,"abstract":"The presence of in-phase/quadrature (I/Q) imbalance in a dual branch receiver gives rise to signal distortion. If the incoming signal is also corrupted by multipath fading, then the task of correcting or compensating for these two forms of distortion becomes technically very challenging. This paper proposes an adaptive approach which involves first correcting for the I/Q imbalance before the signal is compensated for the effect of multipath fading. Estimations of the I/Q imbalance and channel parameters are carried out with the aid of a common reference signal. Computer simulations have verified the effectiveness of the proposed scheme. In this case, the receiver suffers from frequency-flat I/Q imbalance of 20% gain and 5° phase deviations. Also, the incoming 64-QAM signal is assumed to have undergone a 6-path propagation.","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":"129928457","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":"On parameter estimation of the envelope Gaussian mixture model","authors":"Linyun Huang, Y. Hong, E. Viterbo","doi":"10.1109/AusCTW.2014.6766423","DOIUrl":"https://doi.org/10.1109/AusCTW.2014.6766423","url":null,"abstract":"In many communication systems, the Gaussian mixture model (GMM) is widely used to characterize non-Gaussian man-made and natural interference. The envelope distribution of such noise model is often expressed as a weighted sum of Rayleigh if in-phase and quadrature components of the noise are dependent. Instead, in this paper, a simple and exact closed form probability density function of the envelope Gaussian mixture model (i.e. the envelope of independent in-phase and quadrature components of complex non-Gaussian noise) is obtained. Further-more, the problem of estimating of the envelope Gaussian mixture parameters is addressed. The proposed estimator of weights and variances is based upon the Expectation-Maximization (EM) algorithm.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"8 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":"131915665","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}