{"title":"A Theoretical study of peak-to-average power ratio in Reed-Muller coded multicarrier CDMA","authors":"N. Yu","doi":"10.1109/CISS.2010.5464942","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464942","url":null,"abstract":"Reed-Muller codes are studied for peak power control in multicarrier code-division multiple access (MC-CDMA) communication systems. In a coded MC-CDMA system, the information data multiplexed from users is encoded by a Reed-Muller subcode and the codeword is fully-loaded to Walsh-Hadamard spreading sequences. The polynomial representation of a coded MC-CDMA signal is established for theoretical analysis of the peak-to-average power ratio (PAPR). The Reed-Muller subcodes are then defined in a recursive way by the Boolean functions providing the transmitted MC-CDMA signals with the bounded PAPR as well as the error correction capability. A connection between the code rates and the maximum PAPR is theoretically investigated in the coded MC-CDMA. The theoretical study shows that the Reed-Muller subcodes are effective coding schemes for peak power control in MC-CDMA with small and moderate numbers of users, subcarriers, and spreading factors.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"62 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":"126261416","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 Restricted Isometry of deterministically subsampled Fourier matrices","authors":"J. Haupt, L. Applebaum, R. Nowak","doi":"10.1109/CISS.2010.5464880","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464880","url":null,"abstract":"Matrices satisfying the Restricted Isometry Property (RIP) are central to the emerging theory of compressive sensing (CS). Initial results in CS established that the recovery of sparse vectors x from a relatively small number of linear observations of the form y = Ax can be achieved, using a tractable convex optimization, whenever A is a matrix that satisfies the RIP; similar results also hold when x is nearly sparse or the observations are corrupted by noise. In contrast to random constructions prevalent in many prior works in CS, this paper establishes a collection of deterministic matrices, formed by deterministic selection of rows of Fourier matrices, which satisfy the RIP. Implications of this result for the recovery of signals having sparse spectral content over a large bandwidth are discussed.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"39 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":"128408858","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":"Cost constrained spectrum sensing in cognitive radio networks","authors":"Gang Xiong, S. Kishore, A. Yener","doi":"10.1109/CISS.2010.5464978","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464978","url":null,"abstract":"This paper addresses optimal spectrum sensing in cognitive radio networks considering its system level cost that accounts for the local processing cost of sensing (sample collection and energy calculation at each secondary user) as well as the transmission cost (forwarding energy statistic from secondary users to fusion center). The optimization problem solves for the appropriate number of samples to be collected and amplifier gains at each secondary user to minimize the global error probability subject to a total cost constraint. In particular, closed-form expressions for optimal solutions are derived and a generalized water-filling algorithm is proposed when number of samples or amplifier gains are fixed and additional constraints are imposed. Furthermore, when jointly designing the number of samples and amplifier gains, optimal solution indicates that only one secondary user needs to be active, i.e., collecting samples for local energy calculation and transmitting energy statistic to fusion center.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"85 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":"127028998","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":"A performance evaluation study of RPL: Routing Protocol for Low power and Lossy Networks","authors":"J. Tripathi, J. D. Oliveira, J. Vasseur","doi":"10.1109/CISS.2010.5464820","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464820","url":null,"abstract":"In this paper, a performance evaluation of the Routing Protocol for Low power and Lossy Networks (RPL) is presented. Detailed simulations are carried out to produce several routing performance metrics using a set of real-life scenarios. A real outdoor network was reproduced in simulation with the help of topology and link quality data. Behaviors of such a network in presence of RPL, their reason and potential areas of further study/improvement are pointed out.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"34 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":"130553043","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":"Automated registration of 3D-range with 2D-color images: an overview","authors":"I. Stamos","doi":"10.1109/CISS.2010.5464815","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464815","url":null,"abstract":"The automatic creation of photorealistic models of large-scale scenes is an important problem. A new generation of laser range scanners can produce very accurate and dense geometric representations in terms of point clouds of 3D points. One the other hand, images captured by inexpensive regular 2D cameras can populate this geometric representation with a large number of photometric observations. Solutions to the problem of registering these different sources of information thus become crucial. The main difficulty stems from the different acquisition processes: active sensing in 3D and passive sensing in 2D. For example, a normal discontinuity in the 3D world will be captured by both sensors but lighting effects will only be recorded by the 2D camera. This paper provides an overview of the current stat-of-the-art and then summarizes our contributions in the field. There are three categories of solutions to the problem. The first one attacks the problem of registering a single 2D image with the 3D model by matching extracted features from the 2D and 3D space. The second one deals with a textured 3D model and it can thus use 2D-to-2D matching techniques. Finally, the third and more comprehensive approach involves the alignment of a set of 2D images to a 3D model. A number of connections are thus explored (2D-to-2D, 2D-to-3D, and 3D-to-3D) leading to more robust solutions.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"12 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":"132190144","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}
Dan Zhang, K. Nikitopoulos, I-Wei Lai, G. Ascheid, H. Meyr
{"title":"Iterative channel estimation control for MIMO-OFDM Systems","authors":"Dan Zhang, K. Nikitopoulos, I-Wei Lai, G. Ascheid, H. Meyr","doi":"10.1109/CISS.2010.5464953","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464953","url":null,"abstract":"Iterative channel estimation and decoding result in significant performance gains but at high computational cost. In this paper, an iterative channel estimation control is proposed to reduce the complexity by only refining the channel estimates which significantly affect the decoding performance. Simulation results demonstrate that significant complexity savings can be achieved with negligible error rate performance loss.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"52 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":"131568828","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":"The maximum stable broadcast throughput for wireless line networks with network coding and topology control","authors":"Ka-Hung Hui, Y. Sagduyu, Dongning Guo, R. Berry","doi":"10.1109/CISS.2010.5464948","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464948","url":null,"abstract":"We consider broadcasting from a single source to multiple destinations in a linear wireless erasure network with feedback. The problem is to find the maximum stable throughput under different transmission policies with opportunistic network coding and forwarding. Given stochastically varying traffic, we assume that network coding decisions are based on the availability of queued packets. The network is clustered into groups of terminals and network coding is applied locally to packets within each group. This allows us to evaluate the effects of topology control on the maximum stable rate. For each transmission policy we derive the optimal cluster size. We show that network coding improves the stable rate over plain retransmissions, and the network coding gain significantly benefits from opportunistic network coding, forwarding and topology control, ranging from 33% to 410%, depending on the physical channel parameters in the numerical experiments.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"37 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":"132586559","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":"Efficient and stable recovery of Legendre-sparse polynomials","authors":"H. Rauhut, Rachel A. Ward","doi":"10.1109/CISS.2010.5464911","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464911","url":null,"abstract":"We consider the recovery of polynomials that are sparse with respect to the basis of Legendre polynomials from a small number of random sampling points. We show that a Legendre s-sparse polynomial of maximal degree N can be recovered from m ≍ s log<sup>4</sup>(N) random samples that are chosen independently according to the Chebyshev probability measure π<sup>Ȓ1</sup>(1 - x<sup>2</sup>)<sup>Ȓ</sup>dx on [Ȓ1; 1]. As an efficient recovery method, ℓ<inf>1</inf>-minimization can be used. We establish these results by showing the restricted isometry property of a preconditioned random Legendre matrix. Our results extend to a large class of orthogonal polynomial systems on [Ȓ1; 1]. As a byproduct, we obtain condition number estimates for preconditioned random Legendre matrices that should be of interest on their own.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"744 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":"132706840","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 performance evaluation of cooperative spectrum sensing in cognitive radio networks","authors":"Gang Xiong, S. Kishore, A. Yener","doi":"10.1109/CISS.2010.5464933","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464933","url":null,"abstract":"This paper presents the system level performance evaluation for energy-detection based cooperative spectrum sensing in cognitive radio networks. Three performance criteria are quantitively analyzed for cooperative spectrum sensing. First, the average error probability is determined given fixed amplifier gains for a fixed number of secondary users by considering all possible channel realizations. Second, the asymptotic error probability is computed in a power constrained cognitive radio network when the number of secondary user approaches infinity. Third, the outage probability is examined when instantaneous error probability is greater than a predefined threshold. In all three calculations, both additive white Gaussian noise (AWGN) and Rayleigh fading assumptions are used to capture the observation and fusion channels. Numerical results indicate that in order to maintain a desired detection performance in low and moderate fusion signal to noise ratio (SNR) regimes, fusion channels need to be as reliable as possible, while local received SNRs can be dynamic and provide spatial diversity. Moreover, it is shown that under AWGN observation channels and Rayleigh fading fusion channels, a diversity order equal to the number of secondary users can be achieved.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"67 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":"124219070","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":"Statistical resource decoupling in random access interference channel","authors":"P. Santacruz, A. Sabharwal","doi":"10.1109/CISS.2010.5464885","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464885","url":null,"abstract":"We study how the presence of stochastic fading channels can create statistical decoupling between two interfering flows in a basic interference network. We show that under some conditions of interference and power allocations, the sum throughput of the network with fading channels is higher than the sum throughput for Gaussian collision channel with identical average channel conditions. This higher throughput is a result of fading channels, which sometimes decouples the two flows allowing them to receive successfully even if the interfering flow is simultaneously active.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"196 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":"116353830","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}