{"title":"On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets","authors":"E. Hof, S. Bross","doi":"10.1109/EEEI.2006.321130","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321130","url":null,"abstract":"An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszar and Narayan's result for the single- user AVC establishes the missing part in Jahn's characterization. Nevertheless, being based on Ahlswede's elimination technique, Jahn's characterization is not applicable for symmetrizable channels under state constraint. Here, the various notions of symmetrizability for the two-user broadcast AVC are defined. Sufficient nonsymmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's. The decoding rules we use establish an achievable region under state and input constraints for the family of degraded message sets codes over the AVGBC.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129080366","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":"Minimax Regression with Bounded Noise","authors":"Yonina C. Eldar, A. Beck","doi":"10.1109/EEEI.2006.321098","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321098","url":null,"abstract":"We consider the problem of estimating a vector z in the regression model b = Az + w where w is an unknown but bounded noise and an upper bound on the norm of z is available. To estimate z we propose a relaxation of the Chebyshev center, which is the vector that minimizes the worst-case estimation error over all feasible vectors z. Relying on recent results regarding strong duality of nonconvex quadratic optimization problems with two quadratic constraints, we prove that in the complex domain our approach leads to the exact Chebyshev center. In the real domain, this strategy results in a \"pretty good\" approximation of the true Chebyshev center. As we show, our estimate can be viewed as a Tikhonov regularization with a special choice of parameter that can be found efficiently. We then demonstrate via numerical examples that our estimator can outperform other conventional methods, such as least-squares and regularized least-squares, with respect to the estimation error.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132063061","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}
M. Zenou, S. Goldin, M. Klebanov, V. Lyubin, A. Bruner, B. Sfez
{"title":"Design, Fabrication and Characterization of Thermally Evaporated Photonic Crystal Mirrors.","authors":"M. Zenou, S. Goldin, M. Klebanov, V. Lyubin, A. Bruner, B. Sfez","doi":"10.1109/EEEI.2006.321124","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321124","url":null,"abstract":"In the present work, we design and fabricate omnidirectional mirrors based on 1D photonic crystals made of chalcogenide and cryolite using thermal evaporation. In particular, a two-dimensional mapping that provides a direct, visual signature of the mirrors is proposed. An experimental measurement of the reflectivity is shown. Finally a mirror with an omnidirectional reflectivity of more than 94% for a general polarization, a TE omnidirectional reflectivity of more than 99%, and a TE reflectivity of more than 99.99% for high incident angles is presented. The surface roughness of the mirrors is less than 5nm.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133138147","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":"Point Target Detection in Hyper-Spectral Images","authors":"S. Rotman, Irena Yatskaer","doi":"10.1109/EEEI.2006.321089","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321089","url":null,"abstract":"The analysis of hyperspectral imagery promises to provide technical solutions to problems in many areas of research; this is particularly true of target acquisition. Exploiting high spectral resolution data contributes greatly to the discrimination power of standard image processing techniques. This additional dimension of information is based on the physical characteristics of the target material under consideration. The present research addresses the problem of the detection of a point target, moving with sub-pixel velocity, from a time sequence of hyperspectral data cubes. The emphasis in this paper will be on the degree of improvement in target detection algorithms that can be expected as a function of the degree of difference between the target and background signatures. Differences obtained between the use of real spectral signatures, compared to synthetic ones, for the noise, background and target end-members, and their implication on the detection results will be discussed. The standard matched filter for target detection is broadened and improved by advanced non-data dependent techniques. In order to estimate algorithm performance, five different tests (detection methods of varying sophistication) were applied to the real hyper-spectral data. The results were compared to the synthetic data outcome; conclusions regarding the threshold needed for spectral differences for the target detection to be notably improved are reached. The major focus of the research is a comparative understanding of the target detection results in different scenarios: strongly, partially and lightly cluttered sequences.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198303","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":"Compression at the Source","authors":"Nir Maor, A. Feuer","doi":"10.1109/EEEI.2006.321060","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321060","url":null,"abstract":"In this work we propose a novel approach to simultaneous resolution enhancement in both spatial and temporal domains. We provide an analytical justification to our approach and prove that under certain system assumptions it is possible to reconstruct a signal perfectly from its non-uniform sub-samples. We establish mathematical framework for the reconstruction process under these assumptions and further show that these assumptions fit many typical video data-streams and thus, have not only theoretical value but also a practical implementation.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125513318","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":"Tracking of a Point Target in an IR Sequence using Dynamic Programming Approach","authors":"Ofir Nichtern, S. Rotman","doi":"10.1109/EEEI.2006.321068","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321068","url":null,"abstract":"Examination of more than one image is often needed for the detection of dim point targets in IR backgrounds. We introduce a novel tracking system based on the Track Before Detect Approach (TBD), designed to track and detect such dim maneuvering targets from an image sequence under low SNR conditions. The IR sequence is preprocessed first by using a whitening algorithm to reject clutter and emphasize targets. Afterwards, we use a Dynamic Programming Algorithm (DPA) which is not general since it requires a number of assumptions to hold, all satisfied in a first-order Hidden Markov Model (HMM). An IR sequence containing background noise, clutter, and a sub-pixel maneuvering target satisfies such model, where the target track is the hidden sequence of events, and the IR sequence frames are the observed sequence of events. At the end of this stage, after the last frame of the IR sequence has been processed, the pixel with the highest accumulated score is chosen as the Target, and its path is found. The paper deals with the different issues characterizing the system, enabling it to have versatility over a wide range of scenes. Future work will involve the use of the system for tracking of targets in hyperspectral cubes.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"189 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117320962","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":"An Informational Search for a Moving Target","authors":"E. Kagan, I. Ben-Gal","doi":"10.1109/EEEI.2006.321133","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321133","url":null,"abstract":"We consider the problem of search for a randomly moving target in a discrete domain. The action available to the searcher is checking a sub-domain to detect whether the target is somewhere in this sub-domain or not. The procedure terminates if the searcher finds the target in a sub-domain that contains only one point. Starting from the Korf and Ishida-Korf algorithms, we suggest the informational learning real-time algorithm and the informational moving target search algorithm running on a states space with informational metric. We describe the properties of these algorithms and compare them with the known Zimmerman search procedure, with the generalized optimal testing algorithm, designed by Hartmann et al, and with the Pollock model of search. To illustrate the work of the informational moving target search algorithm, we present the results of simulative trials in comparison with the greedy probabilistic search procedure.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115064652","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 Photovoltaic Maximum Power Point Tracking Scheme Realizing Nearly Optimal Load Emulation","authors":"M. Sokolov, D. Shmilovitz","doi":"10.1109/EEEI.2006.321115","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321115","url":null,"abstract":"Photovoltaic (PV) generated power exhibits a convex dependency with respect to the chosen operation point parameter (for instance voltage), implying the existence of operation points at which power maxima are attained, termed Maximum Power Points (MPPs). This article presents a new approach to MPP tracking implementation, based on emulation of nearly optimal load, with can be adjusted to meet the MPP. With this technique, the controller of a DC/DC converter reflects a virtual load towards the PV array. The virtual load is optimized to intersect with the PV generator's output characteristics in the vicinity of the MPP even under varying irradiation conditions. The results demonstrate the superiority of the newly proposed scheme under varying operating conditions","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127196834","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 Gaussian MAC with Imperfect Feedback","authors":"A. Lapidoth, M. Wigger","doi":"10.1109/EEEI.2006.321145","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321145","url":null,"abstract":"New achievable regions are derived for the two-user additive white Gaussian multiple-access channel (MAC) with noisy feedback. We treat the general scenario as well as the symmetric setting and the partial feedback setting. Unlike previously-known achievable regions, the new regions yield sum-rates that are strictly larger than the no-feedback sum-rate capacity, irrespective of the (positive & finite) Gaussian feedback-noise variance. In the symmetric setting, our proposed coding scheme achieves sum-rates that converge to Ozarow's noiseless-feedback sum-rate capacity as the feedback-noise variance tends to zero. In the partial-feedback setting, where one of the transmitters has a perfect feedback link and the other has no feedback at all, we show that the Cover-Leung region (which was originally proposed for perfect-feedback channels but which was later shown to be achievable also with partial feedback) is not tight. This answers in the negative the question posed by van der Meulen as to whether the Cover-Leung region is tight for the Gaussian multiple-access channel with partial feedback. We also propose a coding scheme for the case where the receiver is cognizant of the realization of the noise on the feedback-link.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122266509","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":"Searching for a Lion in the Desert Acquisition Algorithms for Networks of Sensors","authors":"Ronen I. Kat, D. Kedar, S. Dolev, S. Arnon","doi":"10.1109/EEEI.2006.321139","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321139","url":null,"abstract":"Networks of sensors are a promising emerging technology for high accuracy real-time data gathering in applications such as pollution monitoring, home security, surveillance, industrial control, etc. One of the possible communication modalities for sensor networks is optical wireless communication. A notable advantage of this method is the facility of passive communication where a base station illuminates an area containing sensor nodes equipped with retroreflecting mirrors. Thus, sensors can communicate with the base station, with minimal energy expenditure on the part of the sensors, by modulating the retroreflected light. Moreover, the location of the sensors can be mapped, with no energy expenditure by the sensors, using only the retroreflected light received at the base station. In this paper we analyze and compare different acquisition algorithms for networks of sensors using passive optical wireless communication. The goal of the acquisition algorithm is to locate sensors in a given area. We present a hexagonal search that is based on the binary search principle in order to locate a single sensor node. We use varying-diameter beams of constant power density to delineate the possible locations of a sensor node and reject areas where there are no sensors. The trade-off between the scan time and the achievable signal-to-noise ratio (SNR) (and consequent probability of detection) is investigated. Upon locating a sensor node, the base station can query and interrogate the node regarding its data. We compare the acquisition times for the binary search with a classical grid search that employs a small single size beam-spot.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127804287","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}