{"title":"Performance of Space-Time Coded Systems with Transmit Antenna Selection","authors":"T. Gucluoglu, T. Duman","doi":"10.1109/CISS.2007.4298430","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298430","url":null,"abstract":"We deal with transmit antenna selection for space-time coded (STC) systems over multiple input multiple output (MIMO) channels. Using pairwise error probability analysis and simulation results, we show that transmit antenna selection based on received power levels does not reduce the achievable diversity order for full rank STCs. Initially, we prove the results for Rayleigh flat fading channels, and then we state our expectations for the case of frequency selective (FS) fading. In addition to the study of full rank codes, we also consider rank deficient space-time codes, and determine achievable diversity orders with transmit antenna selection.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123078","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":"Detecting Information Flows: Improving Chaff Tolerance by Joint Detection","authors":"T. He, L. Tong","doi":"10.1109/CISS.2007.4298272","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298272","url":null,"abstract":"The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant packets called chaff. A relay node can perturb the timing of information-carrying packets as well as adding or removing chaff packets. The goal is to detect whether there is an information flow through certain nodes of interest by analyzing the transmission times of these nodes. Under the assumption that the relay of information-carrying packets is subject to a bounded delay constraint, fundamental limits on detection are characterized as the minimum amount of chaff needed for an information flow to mimic independent traffic. A detector based on the optimal chaff-inserting algorithms is proposed. The detector guarantees detection in the presence of an amount of chaff proportional to the total traffic size; furthermore, the proportion increases to 100% exponentially fast as the number of hops on the flow path increases.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117294797","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":"Impact of the Number of users on Error Probabilities in Multiuser Diversity Systems","authors":"Y. Ko, C. Tepedelenlioğlu","doi":"10.1109/CISS.2007.4298372","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298372","url":null,"abstract":"Multiuser diversity gain has been investigated well in terms of a system capacity formulation in the literature. In practice, however, designs on multiuser systems with nonzero error rates require a relationship between the error rates and the number of users within a cell. Considering a best-user scheduling, where the user with the best channel condition is scheduled to transmit per scheduling interval, our focus is on the uplink. We assume that each user communicates with the base station through a single-input multiple-output channel. We derive a closed-form expression for the average BER, and analyze how the average BER goes to zero asymptotically as the number of users increases for a given SNR. Note that the analysis of average BER even in SI SO multiuser diversity systems has not been done with respect to the number of users for a given SNR. Our analysis can be applied to multiuser diversity systems with any number of antennas.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124754493","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":"Opportunistic MAC Protocols for Cognitive Radio Based Wireless Networks","authors":"Hang Su, Xi Zhang","doi":"10.1109/CISS.2007.4298329","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298329","url":null,"abstract":"Recently, cognitive radio technology has attracted more and more attention since it is a novel and effective approach to improve the utilization of the precious radio spectrum. We propose MAC protocols for the cognitive radio based wireless networks. Specifically, the cognitive MAC protocols allow secondary users to identify and use the available frequency spectrum in a way that constrains the level of interference to the primary users. In our schemes, each secondary user is equipped with two transceivers. One of the transceivers is tuned to a dedicated control channel, while the other is used as a cognitive radio that can periodically sense and dynamically use an identified available channels. Our proposed schemes integrate the spectrum sensing at the PHY layer and packet scheduling at the MAC layer. Our schemes smoothly coordinate the two transceivers of the secondary users to enable them to collaboratively sense and dynamically utilize the available frequency spectrum.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544910","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 Spectrally Efficient Frequency Hopping Scheme","authors":"Qi Ling, Tongtong Li","doi":"10.1109/CISS.2007.4298298","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298298","url":null,"abstract":"Frequency hopping systems have been widely used in military communications to prevent hostile jamming, interception and detection. In traditional frequency hopping (FH) systems, hopping frequency selection at the transmitter end is controlled by a pseudo-random code sequence, and the receiver operates accordingly in exact synchronization with the transmitters hopping pattern. In an effort to meet the ever increasing requirement on information capacity and reduce the burden of synchronization, in this paper, an innovative message-driven frequency hopping (MDFH) system is proposed. By embedding part of information into the process of hopping frequency selection, the spectral efficiency of the FH system can be significantly improved. Quantitative analysis on the proposed scheme is presented to demonstrate its superior performance and enhanced security features.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122639409","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":"Ultra-Wideband Channel Measurement Characterization for Wireless Magnetic Resonance Imaging Applications","authors":"N. Alsindi, D. Birru, Dong Wang","doi":"10.1109/CISS.2007.4298287","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298287","url":null,"abstract":"The growing wireless technology is providing new potential for emerging applications such as wireless communication in medical systems. Wireless transfer of the magnetic resonance imaging (MRI) sensor data is a new field that will facilitate transfer of imaging data conventionally done through cables. Such application requires high-speed short-range connectivity. The recently emerging technology, ultra-wide band (UWB), is a promising choice for this application. While the conventional open-air UWB communication is well studied, the use of UWB in an MRI environment is not addressed. This paper provides results and analysis of a measurement campaign in makeshift MRI metallic barrel to provide an understanding of the characteristics of such unknown environment. The pathloss characteristic of MRI channel is analyzed and the results show that MRI UWB channels have much less pathloss compared with conventional UWB channels. This is caused by \"waveguide effect\". Moreover, the root mean square (RMS) delay analysis is presented. Different scenarios, such as empty MRI and loaded MRI were measured and compared. The results show that MRI channels have some unique properties and are different from previous proposed channel models, such as IEEE 802.15 3a CM channel models. These results can be used to conduct future UWB system design for MRI applications.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122697434","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":"Channel-Adaptive Optimal OFDMA Scheduling","authors":"X. Wang, G. Giannakis, Yingqun Yu","doi":"10.1109/CISS.2007.4298365","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298365","url":null,"abstract":"Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless transmissions. Using a time-sharing argument, a convex formulation is obtained avoiding the NP-hardness of the usual 0-1 integer program solution. It is rigourously established that the optimal allocation can be obtained almost surely through a greedy water-filling approach with linear complexity in the number of users and subcarriers. Stochastic approximation is further employed to develop on-line algorithms which are capable of dynamically learning the underlying channel distribution and asymptotically converges to the off-line optimal solution from arbitrary initial values.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643588","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":"Discrete-Time Dithering Technique for Designing Time-Varying Signal Adapted Filter Banks","authors":"P. Vouras, T. Tran","doi":"10.1109/CISS.2007.4298425","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298425","url":null,"abstract":"This paper describes the use of sinusoidal dithers in a lattice filter bank structure to create a time-varying paraunitary filter bank that approximates and tracks in near real-time the ideal principal component filter bank corresponding to a nonstationary random input process. The sinusoidal dithers are used to estimate the gradient of a cost function which is minimized using non-linear minimization techniques.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121335189","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":"Limited Feedback Precoder Design for Spatially Correlated MIMO Channels","authors":"V. Raghavan, A. Sayeed, V. Veeravalli","doi":"10.1109/CISS.2007.4298283","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298283","url":null,"abstract":"It is well-known that perfect channel state information (CSI) at the transmitter and the receiver (CSIT/CSIR) can be used to decompose a multi-antenna channel into a bank of parallel channels. While perfect CSIR maybe a reasonable assumption for practical systems, perfect CSIT is generally difficult to achieve. Recent attention in communication systems design has thus shifted towards limited feedback schemes where partial CSI is fed back from the receiver to the transmitter. In this work, we consider a preceding scheme which excites a subset of the transmit dimensions with independent data. The main focus is on systematic quantized precoder designs that bridge the gap between statistical preceding and perfect CSIT preceding in spatially correlated channels. In this work, we propose an asymptotic perturbation theory-inspired codebook design obtained from a quantization of the local neighborhood around the statistically dominant preceding direction(s). This design is implemented in practice by maps that can rotate and shrink sets on the Grassmannian manifold. Numerical results show substantial gains can be achieved with the proposed design over statistical preceding.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121173794","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 Game-Theoretic Analysis of Decode-and-Forward Cooperation in Gaussian Channels","authors":"Yingda Chen, S. Kishore","doi":"10.1109/CISS.2007.4298316","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298316","url":null,"abstract":"A game-theoretic analysis of decode-and-forward user cooperation is presented. Cooperative communications is modeled as a game in which the two participating terminals are selfish and seek to maximize their own payoff, a general utility function that monotonically increases with signal-to-noise ratio. The terminals communicate to a common destination terminal using orthogonal additive white Gaussian noise (AWGN) channels. Both deterministic and mixed-strategy Nash Equilibria are studied. Results show the selfish nature drives users away from a mutually cooperative equilibrium in a one-shot game. However, when the communication scenario is modeled as a repeated game, a Nash Equilibrium in which users cooperate can be achieved. The requirement for such an equilibrium is that users value future payoff and a proper power control scheme is utilized. Examinations of two possible payoffs (i.e., channel capacity and transmission reliability) show that such a power control scheme can be easily implemented.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122326734","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}