{"title":"Cost-constrained transmit processing in wireless cellular networks with universal frequency reuse","authors":"R. Bendlin, Yih-Fang Huang, M. Ivrlac, J. Nossek","doi":"10.1109/CISS.2010.5464842","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464842","url":null,"abstract":"To improve link reliability and data throughput in wireless communications, it is well known that we can exploit both the spatial and the temporal domain by precoding and scheduling, respectively. For cellular networks, however, most of these gains can only be obtained when frequency resources are carefully allocated to the different base stations as otherwise, they are compromised by the presence of intercell interference. To achieve universal frequency reuse among base stations, the idea of base station cooperation has recently attracted much attention. Unfortunately, the costs of this cooperation in terms of channel state information diminish most of the benefits. This paper proposes scheduling and precoding techniques under universal frequency reuse that address these costs to recover the gains of temporal scheduling and spatial precoding in the downlink of cellular multiple input single output (MISO) systems with multiple non-cooperative users per cell.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116146583","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":"High resolution channel quantization rules for multiuser spatial multiplexing systems","authors":"B. Khoshnevis, Wei Yu","doi":"10.1109/CISS.2010.5464829","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464829","url":null,"abstract":"This paper addresses the optimal channel quantization codebook design for limited feedback multiple-antenna multiuser channels. The base station is equipped with M antennas and serves M single-antenna users, which share a total feedback rate B. We assume real space channels for convenience; the extension of the analysis to complex space is straightforward. The codebook optimization problem is cast in form of minimizing the average downlink transmission power subject to the users' outage probability constraints. This paper adopts a product codebook structure for channel quantization comprising a uniform (in dB) channel magnitude quantization codebook and a spatially uniform channel direction quantization codebook. We first formulate a robust power control problem that minimizes the sum power subject to the worst-case SINR constraints over the channel quantization regions. By using an upper bound solution to this problem, we then optimize the quantization codebooks given the target outage probabilities and the target SINR's. In the asymptotic regime of B → ∞, the optimal number of channel direction quantization bits is shown to be M-1 times the number of channel magnitude quantization bits. It is further shown that the users with higher requested QoS (lower target outage probabilities) and higher requested downlink rates (higher target SINR's) should receive larger shares of the feedback rate. The paper also shows that, for the target parameters to be feasible, the total feedback bandwidth should scale logarithmically with γ̄, the geometric mean of the target SINR values, and 1/q̄, the geometric mean of the inverse target outage probabilities. Moreover, the minimum required feedback rate increases if the users' target parameters deviate from the average parameters γ̄ and q̄. Finally, we show that, as B increases, the multiuser system performance approaches the performance of the perfect channel state information system as 1 over q̄ times 2 raise to minus B over M raise to 2.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"98 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121015198","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":"Joint scheduling and dynamic power spectrum optimization for wireless multicell networks","authors":"Wei Yu, T. Kwon, Changyong Shin","doi":"10.1109/CISS.2010.5464889","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464889","url":null,"abstract":"This paper proposes a joint proportionally fair scheduling and dynamic power spectrum adaptation algorithm for wireless multicell networks. The proposed system allows multiple base-stations in a multicell network to be coordinated by exchanging interference pricing messages among each other. The messages summarize the effect of intercell interference, and they are functions of transmit power spectra, signal-to-noise ratios, direct and interfering channel gains, and the proportional fairness variables for each user. The use of interference pricing allows the transmit power spectra and user schedule within each base-station to be optimized jointly, while taking into consideration both the intercell interference and the fairness among the users in multiple cells. This paper proposes two power spectrum optimization methods, one based on the Karush-Kuhn-Tucker (KKT) condition of the optimization problem, and another based on the Newton's method. The proposed methods can achieve a throughput improvement of 40%–55% for users at the cell edge as compared to a conventional per-cell optimized system, while maintaining proportional fairness.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121804879","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":"Investigating symmetric and asymmetric stereoscopic compression using the PSNR image quality metric","authors":"Paul W. Gorley, N. Holliman","doi":"10.1109/CISS.2010.5464938","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464938","url":null,"abstract":"Context: In this paper we will assess the two different stereoscopic image compression methods, symmetric and asymmetric encoding. As stereoscopic images require an increase in storage space compared to monoscopic images, the compression of stereo images is one of the most important factors to enable the extensive use of three-dimensional systems. Substantial research effort has been focused on digital image compression using JPEG, however, the question of how much compression to apply and the most appropriate compression method to use still remains unresolved [1].","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123827457","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":"Double overrelaxation thresholding methods for sparse signal reconstruction","authors":"Kun Qiu, Aleksandar Dogandzic","doi":"10.1109/CISS.2010.5464879","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464879","url":null,"abstract":"We propose double overrelaxation (DORE) and automatic double overrelaxation (ADORE) thresholding methods for sparse signal reconstruction. The measurements follow an underdetermined linear model, where the regression-coefficient vector is a sum of an unknown deterministic sparse signal component and a zero-mean white Gaussian component with an unknown variance. We first introduce an expectation-conditional maximization either (ECME) algorithm for estimating the sparse signal and variance of the random signal component and then describe our DORE thresholding scheme. The DORE scheme interleaves two successive overrelaxation steps and ECME steps, with goal to accelerate the convergence of the ECME algorithm. Both ECME and DORE algorithms aim at finding the maximum likelihood (ML) estimates of the unknown parameters assuming that the signal sparsity level is known. If the signal sparsity level is unknown, we propose an unconstrained sparsity selection (USS) criterion and show that, under certain conditions, maximizing the USS objective function with respect to the signal sparsity level is equivalent to finding the sparsest solution of the underlying underdetermined linear system. Our ADORE scheme demands no prior knowledge about the signal sparsity level and estimates this level by applying a golden-section search to maximize the USS objective function. We employ the proposed methods to reconstruct images from sparse tomographic projections and compare them with existing approaches that are feasible for large-scale data. Our numerical examples show that DORE is significantly faster than the ECME and related iterative hard thresholding (IHT) algorithms.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121382048","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":"UWB MIMO cooperative relay systems: BER analysis and relay regions","authors":"K. Maichalernnukul, Feng Zheng, T. Kaiser","doi":"10.1109/CISS.2010.5464739","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464739","url":null,"abstract":"In this paper, bit error rate (BER) analysis is presented for ultra-wideband (UWB) multiple-input multiple-output (MIMO) cooperative relay systems, where partial channel state information (CSI) is only available at the receiver side. In the analysis, decouple-and-forward (DCF) and decode-and-forward (DF) relaying schemes are considered. For these schemes, the relay regions, in which cooperative relaying outperforms direct transmission, and the effects of power optimization are studied through numerical results.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122509054","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. Jemmott, R. L. Culver, B. Bissinger, C. Gaumond
{"title":"An information theoretic performance bound for passive sonar localization of a moving source","authors":"C. Jemmott, R. L. Culver, B. Bissinger, C. Gaumond","doi":"10.1109/CISS.2010.5464728","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464728","url":null,"abstract":"Several passive sonar signal processing methods have previously been developed for determining the location of a source radiating tonal acoustic energy while moving through a shallow water environment. These localization algorithms rely on the complex interference pattern resulting from multipath acoustic propagation. By treating passive sonar localization as a communications problem, an information theoretic upper bound on performance can be derived. The bound is based on acoustic propagation, and depends on radial distance the source travels through the waveguide, signal to noise ratio, frequency of the radiated acoustic tone, and minimum sound speed of the problem, and resolution of the localization. An example using parameters from the SWellEx-96 experiment is shown.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853425","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}
Jan-Michael Frahm, M. Pollefeys, S. Lazebnik, Brian Clipp, D. Gallup, R. Raguram, Changchang Wu
{"title":"Fast robust reconstruction of large-scale environments","authors":"Jan-Michael Frahm, M. Pollefeys, S. Lazebnik, Brian Clipp, D. Gallup, R. Raguram, Changchang Wu","doi":"10.1109/CISS.2010.5464819","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464819","url":null,"abstract":"This paper tackles the active research problem of fast automatic modeling of large-scale environments from videos and unorganized still image collections. We describe a scalable 3D reconstruction framework that leverages recent research in robust estimation, image-based recognition, and stereo depth estimation. High computational speed is achieved through parallelization and execution on commodity graphics hardware. For video, we have implemented a reconstruction system that works in real time; for still photo collections, we have a system that is capable of processing thousands of images in less than a day on a single commodity computer. Modeling results from both systems are shown on a variety of large-scale real-world datasets.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132657352","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":"Partitioned one-bit feedback for cooperative beamforming","authors":"Gubong Lim, L. Cimini","doi":"10.1109/CISS.2010.5464769","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464769","url":null,"abstract":"Recently, it has been shown that a cooperative beamforming scheme can achieve considerable gain using node cooperation. Due to the distributed nature of cooperating nodes, it is necessary to obtain phase synchronization such that the common message transmitted from the different cooperating nodes can be added coherently at the receiver. In this paper, we present a phase synchronization algorithm which is a modified version of a previously proposed 1-bit feedback scheme. In the proposed algorithm, the total number of nodes are partitioned into subsets and each subset performs an independent 1-bit iterative process until it reaches the desired gain. We present simulation results which compare the convergence performance with the original 1-bit feedback algorithm and show that a 30% reduction in the number of iterations can be obtained when the total number of nodes are divided into 2 subsets. We also investigate the impact of the composite phase estimation of each subset on the achievable gain.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134237432","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 the symmetric capacity of the K-user symmetric cyclic Gaussian interference channel","authors":"Lei Zhou, Wei Yu","doi":"10.1109/CISS.2010.5464891","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464891","url":null,"abstract":"The capacity region of Gaussian interference channel in the weak interference regime is an open problem. Recently, Etkin, Tse and Wang derived an outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi signaling scheme can achieve within one bit of the capacity region for all values of channel parameters. In this paper, we extend their result to the K-user symmetric cyclic Gaussian interference channel. Our result shows that both the Etkin, Tse and Wang's upper bound and their one-bit achievability result on the symmetric rate continue to hold for the symmetric rate of the K-user symmetric cyclic channel using the same Han-Kobayashi strategy.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130315523","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}