Vyaghreswara Rao Namuduri, S. Pandit, Kalyan Kothinti, K. Namuduri
{"title":"A Framework for Estimating the Capacity of Multi Channel Digital Image Watermarking","authors":"Vyaghreswara Rao Namuduri, S. Pandit, Kalyan Kothinti, K. Namuduri","doi":"10.1109/CISS.2007.4298438","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298438","url":null,"abstract":"Watermarking channel capacity is defined as the number of bits that can be embedded in an image with an arbitrarily low probability of detection error under a given distortion constraint. In recent literature, multi-channel watermarking channel capacity is defined as a function of the maximum amount of distortions introduced by the hider and attacker. In this paper, we provide a framework for estimating the capacity of multi channel digital image watermarking in practical setting by simulating two types of attacks.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"6 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":"127327378","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 Feedback for Network Coding","authors":"C. Fragouli, D. Lun, M. Médard, Payam Pakzad","doi":"10.1109/CISS.2007.4298308","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298308","url":null,"abstract":"In this paper we examine possible ways that feedback can be used, in the context of systems with network coding capabilities. We illustrate, through a number of simple examples, that use of feedback can be employed for parameter adaptation to satisfy QoS requirements as well as for reliability purposes. We also argue that there are benefits in applying network coding to the feedback packets themselves, and finally, we examine the design of acknowledgment packets.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"97 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":"132881917","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 CRLB and Low-Complexity Channel Estimation for UWB Communications","authors":"Xiaoli Wang, H. Ge","doi":"10.1109/CISS.2007.4298290","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298290","url":null,"abstract":"The Cramer-Rao lower bound (CRLB) is derived for the channel estimation of direct sequence-code division multiple access ultra-wideband (DS-CDMA UWB) communication system. We have modified the channel model and reduced the number of estimation parameters. Furthermore, a low-complexity data-aided Least Square (LS) channel estimation algorithm is proposed for the modified model. In addition, the problem of designing orthogonal training sequence is discussed. Finally, numerical examples are provided to evaluate both the derived CRLB and the proposed channel estimation algorithm.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"32 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":"132064580","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":"Power-Efficient Relay Selection for Decentralized Distributed Space-Time Block Coding","authors":"Lu Zhang, L. Dai, L. Cimini","doi":"10.1109/CISS.2007.4298427","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298427","url":null,"abstract":"Distributed space-time-block-coding (Dis-STBC) achieves diversity through cooperative transmission among geographically dispersed nodes. In this paper, we present a power-efficient relay-selection strategy for decentralized Dis-STBC in a selective decode-and-forward two-stage relaying network. In particular, each decoded node broadcasts a small amount of information with limited power. This node then utilizes its own and its neighbors' information to decide whether or not to act as a relay for the source information. In this way, only part of the decoded set will act as relays. The outage analyses and simulations illustrate the power-efficiency advantage of the proposed strategy.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"11 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":"121172897","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":"Effects of Mutual Coupling on the Diversity Order of EGT Systems","authors":"N. Maleki, E. Karami, M. Shiva","doi":"10.1109/CISS.2007.4298358","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298358","url":null,"abstract":"Multiple-input multiple-output (MIMO) wireless systems have gained attention due to their ability to provide substantial gains in capacity and quality. This paper proposes equal gain transmission (EGT) to provide diversity advantage in MIMO systems experiencing Rayleigh fading and correlation. The applications of EGT with selection diversity combining (SDC), equal gain combining (EGC), and maximum ratio combining (MRC) are addressed. Since in practice full channel knowledge at the transmitter is difficult to realize, a quantized version of EGT is proposed. Because small distances between the antennas on a mobile unit causes mutual coupling, in this paper, first a new approach to calculate the effects of coupling is introduced; and then the diversity-order for systems that use EGT and any different combining schemes with various distances between the antennas on a mobile unit, with coupling calculated by the conventional method and the new method, and without considering the effect of coupling are compared by simulation.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"7 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":"125020541","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 Relay Channel with a Wire-tapper","authors":"M. Yuksel, E. Erkip","doi":"10.1109/CISS.2007.4298265","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298265","url":null,"abstract":"In this work a relay channel with a wire-tapper is studied for both discrete memoryless and Gaussian channels. The wire-tapper receives a physically degraded version of the destination's signal. We find inner and outer bounds for the capacity-equivocation rate region. We also argue that when the destination receives a physically degraded version of the relay's signal, inner and outer bounds meet for some special cases.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"27 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114031258","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":"Broadcast capacity of a WSN employing power control and limited range dissemination","authors":"Ananth V. Kini, N. Singhal, S. Weber","doi":"10.1109/CISS.2007.4298306","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298306","url":null,"abstract":"The broadcast capacity of a wireless sensor network (WSN) is defined as the maximum rate at which the network may generate messages intended for distribution to the entire network subject to coverage and delay constraints. Broadcast capacity depends on factors such as topology, collisions, node failures and queueing delays that may be incurred during heavy load conditions. In our previous work, we studied the improvements in efficiency and collision reduction through the use of information coordination (IC) and communication coordination (CC) respectively. In this paper we extend our work in three aspects: (i) we look at a more realistic topology for sensor networks, a Poisson cluster process, (ii) we allow for variable transmission distances as an abstraction of power control, and (iii) messages have a limited dissemination range, implying that each message may only permeate up to a certain distance r from its originator. We quantify the additional improvement in broadcast capacity when power control is added to IC and CC. We also show that broadcast capacity greatly increases when the reach of the message is restricted irrespective of whether IC and/or CC are employed, however the penalty incurred is reduced coverage.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"19 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":"127632277","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 Utility-Based Power Control and Receive Beamforming","authors":"S. Stańczak, A. Feistel, Daniel Tomecki","doi":"10.1109/CISS.2007.4298436","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298436","url":null,"abstract":"The paper deals with the problem of joint power control and receive beamforming in wireless networks. The objective is to allocate transmit powers and receive beamformers to the users in order to maximize a weighted sum of some utility functions of the signal-to-interference ratios. We propose using a class of utility functions with increasing relative concavity that allows for an arbitrarily close approximation of the max-min fair rate allocation. Then, we consider a gradient projection algorithm for the problem, show its local convergence and address the problem of implementing it in a distributed manner.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"38 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":"132587380","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}
A. O. Kaya, L. Greenstein, D. Chizhik, R. Valenzuela, N. Moayeri
{"title":"Emitter Localization and Visualization (ELVIS): A Backward Ray Tracing Algorithm for Locating Emitters","authors":"A. O. Kaya, L. Greenstein, D. Chizhik, R. Valenzuela, N. Moayeri","doi":"10.1109/CISS.2007.4298332","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298332","url":null,"abstract":"We present ELVIS, a new approach for localizing a first responder (e.g., firefighter) inside a building. We assume that the first responder emits RF energy, which undergoes multiple reflections with the walls, ceilings and floors of the building. There are K receivers, each of which receives ray(s) from the first responder. Each receiver estimates the AOA (angle of arrival), TOA (time of arrival) and power of each ray. We assume that the receivers know the blueprint of the building and the electromagnetic characteristics of the construction material used in the building. We show that, based on this information, the receivers can localize the first responder to a high degree of accuracy by applying ELVIS, which is based on backward ray tracing. We have evaluated the performance of ELVIS, using both single and multiple receivers, under a variety of channel and propagation conditions. We find that, the location prediction error depends mostly on the angular resolution of the receiver antennas. One advantage of ELVIS over other RF-based localization methods is that, if AOA is estimated with high degree of accuracy, a single receiver would be sufficient to do localization in 3D. In this case one could localize 100% of the Bell Labs, Crawford Hill building within 9 cm. With degraded accuracy, including fading and noise effects, plusmn10 degree angular error, and plusmn10 ns temporal error, one could localize 80% of the building within 10 m using multiple receivers.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"44 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":"133587470","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":"Fabrication and Testing of Single Photon Avalanche Detectors in the TSMC 0.18μm CMOS Technology","authors":"M. Marwick, A. Andreou","doi":"10.1109/CISS.2007.4298405","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298405","url":null,"abstract":"We report on the fabrication and preliminary testing of a single photon avalanche detectors (SPAD) fabricated in the TSMC 0.18μm standard CMOS technology (CM018). The detectors exhibit low dark count rate and robust geiger-mode operation at room temperature.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"47 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":"115201378","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}