{"title":"Cramer-Rao bound for joint location and velocity estimation in multi-target non-coherent MIMO radars","authors":"Chuanming Wei, Qian He, Rick S. Blum","doi":"10.1109/CISS.2010.5464895","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464895","url":null,"abstract":"In this paper, we focus on a performance bound for joint location and velocity estimation in non-coherent MIMO radars with multiple targets, which has not been studied before. Closed-form expressions for the Cramer-Rao bound are provided for a two-target case. We use numerical simulations to validate the Cramer-Rao bounds and use these bounds to study the performance of a non-coherent MIMO radar system. We analyze the influence of the distance between two targets on the estimation performance. Simulation results reveal that the spatial advantage, which was uncovered previously for a single-target case, also applies for two targets.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"3 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":"115058658","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":"Optical fiber and information theory","authors":"R. Essiambre, G. Kramer, G. Foschini, P. Winzer","doi":"10.1109/CISS.2010.5464721","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464721","url":null,"abstract":"We apply information theory to optical fibers in the context of transmitting information in optical networks. We define a ¿fiber channel¿ suitable for such networks and present fiber capacity estimates for transmission over 500 km. We compare our capacity estimates to recent record capacity experiments.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"94 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":"114622480","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":"Coded rate control protocol (C-RCP) for lossy channels","authors":"Ali Munir, Saad B. Qaisar","doi":"10.1109/CISS.2010.5464802","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464802","url":null,"abstract":"Among transport layer protocols Nandita et al, in their work has shown that rate control protocol (RCP) is superior in its performance as compared to Transmission Control Protocol (TCP) and explicit control protocol (XCP), and emulates processor sharing in a much better way. A lot of work has been done for the improvement of RCP but the performance improvement for lossy networks is still an open issue. The main objective of RCP is to achieve ideal processor sharing and Nandita et al have shown that RCP meets this goal irrespective of the flow sizes. In this work we make use of this property and provide a scheme that improves RCP's performance for lossy channels. Our scheme makes use of erasre coding to ensure end-to-end reliability for lossy links, using Luby Transform (LT). We propose a new strategy for incorporating erasure coding with rate control protocol (RCP). Our scheme works by adjusting the rate of transmission depending on the packet erasure rate (PER) feedback from routers, therefore it achieves the reliability on top of the congestion control at transport layer, thus it eliminates need of a separate erasure correction scheme at link layer. Simulation results show that RCP's performance over lossy links improves by using proposed methodology. We observe that using erasure coding we can achieve same throughput for lossy links, as that of lossless links, without having significant effect on the AFCT of the flows.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"75 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":"115154793","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":"Quasi-cyclic ldpc code design for block-fading channels","authors":"Yueqian Li, M. Salehi","doi":"10.1109/CISS.2010.5464729","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464729","url":null,"abstract":"We investigate quasi-cyclic low-density parity-check (QC-LDPC) codes for nonergodic block-fading channels. A construction method for designing QC-LDPC codes is presented. With careful design, the proposed QC-LDPC codes exhibit the same good performance as their corresponding random root- LDPC codes introduced in [1] using iterative belief-propagation (BP) decoding. Moreover, the structure of the proposed QCLDPC codes makes an efficient encoding method possible.","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":"130557342","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 KLT-inspired node centrality for identifying influential neighborhoods in graphs","authors":"M. Ilyas, H. Radha","doi":"10.1109/CISS.2010.5464971","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464971","url":null,"abstract":"We present principal component centrality (PCC) as a measure of centrality that is more general and encompasses eigenvector centrality (EVC). We explain some of the difficulties in applying EVC to graphs and networks that contain more than just one neighborhood of nodes with high influence. We demonstrate the shortcomings of traditional EVC and contrast it against PCC. PCC's ranking procedure is based on spectral analysis of the network's graph adjacency matrix and identification of its most significant eigenvectors.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"120 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":"131591421","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}
Ananth V. Kini, S. Weber, F. Aloul, Nagarajan Kandasamy
{"title":"Transmission coordination for ad hoc networks","authors":"Ananth V. Kini, S. Weber, F. Aloul, Nagarajan Kandasamy","doi":"10.1109/CISS.2010.5464846","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464846","url":null,"abstract":"AHNs are wireless networks operating without the benefits of network infrastructure (basestations) or centralized control. AHNs working with limited spectrum perform best when simultaneous transmissions are coordinated to avoid collisions. Optimal transmission coordination is a combinatorial optimization problem that is, in general, intractable for large size networks, even with global information and central control. Constraints on simultaneous transmissions may arise from both transceiver limitations (e.g., half-duplex designs) and from requirements on the signal to interference ratio. We study the transmission coordination optimization problem under a variety of natural communication constraints. Our work identifies particular instances where the problem may be solved by greedy algorithms, and studies the performance of several natural heuristic solutions.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"49 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":"130053070","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":"Characterization of delay and Doppler spreads of underwater particle velocity channels using zero crossing rates","authors":"Huaihai Guo, A. Abdi, A. Song, M. Badiey","doi":"10.1109/CISS.2010.5464725","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464725","url":null,"abstract":"Communication in acoustic particle velocity channel using vector sensors is recently proposed for the underwater medium. Due to the presence of multiple propagation paths, a mobile receiver collects the transmitted signal with different delays and Doppler shifts. This introduces certain delay and Doppler spreads in particle velocity communication channels. In this paper, these channel spreads are characterized using the zero crossing rates of channel responses in frequency and time domain. Useful expressions for delay and Doppler spreads are derived in terms of the key channel parameters, mean angle of arrivals and angle spreads. Closed-form expressions for the temporal correlations of underwater acoustic particle velocity channels are presented as well. These results are needed for design and performance predication of communication systems in time-varying and frequency-selective underwater particle velocity channels.","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":"126580440","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":"Comprehensive node selection and power allocation in multi-source cooperative mesh networks","authors":"Kianoush Hosseini, R. Adve","doi":"10.1109/CISS.2010.5464924","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464924","url":null,"abstract":"This paper considers resource allocation with relay selection in a multi-source multi-destination mesh network wherein dedicated relay nodes use the decode-and-forward (DF) protocol. The key difference from previous work is that we consider resource allocation across the source-relay, relay-destination, and source-destination channels in a multi-source network. The solution to the related optimization problem simultaneously solves for relay selection, power allocation, and the cooperation strategy (direct transmission, if optimal, is a valid solution). Since the jointly optimal solution is of exponential complexity, we introduce a set of time-sharing factors and relax the selection constraint, resulting in an upper bound to the true solution. Imposing selection leads to a feasible, but tight, lower bound on the optimal solution. Second, we propose a decentralized selection and power allocation scheme. Simulation results show that the performance of the decentralized selection scheme almost exactly tracks that of the upper bound for both the max-sum and max-min rate metrics while offerring computational benefits.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"56 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":"127423635","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":"Effect of spatial correlation on blind source separation in MIMO systems","authors":"A. Cole-Rhodes, Ermias Shiferaw, F. Moazzami","doi":"10.1109/CISS.2010.5464882","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464882","url":null,"abstract":"In this work, we investigate the effect of spatial correlation in MIMO channels on the performance of multistage CMA+AMA blind equalization and signal separation method. A modified Constant Modulus Algorithm (CMA), which minimizes a linear combination of the CMA and Alphabet Matched Algorithm (AMA) is used as the blind equalizer for blocks of QAM signals. It has been shown that a multistage CMA+AMA equalizer with a blind channel estimator among stages successfully equalizes and separates multiple data signals when the channel model used is that of identically and independently distributed (iid) Rayleigh fading. In this paper a different channel model from work of H.Bolcskei is adopted to investigate the effectiveness of multistage CMA+AMA equalizer and the channel estimator on the channels which are spatially correlated. The performance of the multistage equalization and estimation scheme is compared with uncorrelated iid channels versus transmit and/or receive correlated channels and presented in terms of symbol error rate (SER) and mean square error MSE) for the signals and for the channel estimate.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"30 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":"132282609","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 decoding equations with partial channel state information","authors":"B. Nazer, M. Gastpar","doi":"10.1109/CISS.2010.5464767","DOIUrl":"https://doi.org/10.1109/CISS.2010.5464767","url":null,"abstract":"We have shown that over interfering links, it is possible to decode a function of the involved messages much more efficiently than the full messages themselves. This is useful for example as a physical layer for network coding. Typically, some degree of channel state information at the receiver is required. In this note, we study the effect of only partial channel state information. For several models of interference, novel achievable rates are derived. These may prove to be useful as a physical layer for non-coherent network codes.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"17 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":"133738892","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}