发布求助
文献互助 智能选刊 最新文献

2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel最新文献

筛选
英文 中文
Broadcast Channels and Input-Cost Side Information 广播频道和投入成本方信息
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321127
E. Haim, R. Zamir
{"title":"Broadcast Channels and Input-Cost Side Information","authors":"E. Haim, R. Zamir","doi":"10.1109/EEEI.2006.321127","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321127","url":null,"abstract":"We consider two problems: the first one is input constrained channels where the cost function depends on a state, and the state is known only to the encoder. We show that this model is similar both in theoretical aspects and in practical coding aspects to the problem of source coding with distortion side information. We explore the capacity loss due to not knowing the cost state at the decoder and show that it is small under various assumptions. This model plays an important role in the second problem we consider, which is broadcast channel. We explore the gap between the best known single letter achievable region and the true capacity region, using tools developed for the first problem.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"34 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":"122144445","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}
引用次数: 2
Recent Results on Capacity-Achieving Codes for the Erasure Channel with Bounded Complexity 具有有界复杂度的Erasure信道的容量实现码研究进展
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321096
I. Sason, H. Pfister
{"title":"Recent Results on Capacity-Achieving Codes for the Erasure Channel with Bounded Complexity","authors":"I. Sason, H. Pfister","doi":"10.1109/EEEI.2006.321096","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321096","url":null,"abstract":"The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity (per information bit). It also introduces symmetry properties which play a central role in the construction of various capacity-achieving ensembles for the BEC. The results improve on the tradeoff between performance and complexity provided by the first capacity-achieving ensembles of irregular repeat-accumulate (IRA) codes with bounded complexity (constructed by Pfister, Sason and Urbanke). The superiority of ARA codes with moderate to large block lengths is exemplified by computer simulations comparing their performance with those of previously reported capacity-achieving ensembles of LDPC and IRA codes. ARA codes also have the advantage of being systematic.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"24 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":"125333598","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}
引用次数: 1
Packet Loss Concealment for Audio Streaming based on the GAPES and MAPES Algorithms 基于GAPES和MAPES算法的音频流丢包隐藏
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321071
H. Ofir, D. Malah
{"title":"Packet Loss Concealment for Audio Streaming based on the GAPES and MAPES Algorithms","authors":"H. Ofir, D. Malah","doi":"10.1109/EEEI.2006.321071","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321071","url":null,"abstract":"Packet loss in internet audio streaming applications is a well-known and difficult problem. Unless concealed, each such loss produces an annoying disturbance. In this work we present a new algorithm for audio packet loss concealment, designed for MPEG-Audio streaming, based only on the data available at the receiver. The proposed algorithm reconstructs the missing data in the DSTFT (Discrete Short-Time Fourier-Transform) domain using either the GAPES (Gapped-data Amplitude and Phase Estimation) or the MAPES (Missing-data Amplitude and Phase Estimation) algorithm. The algorithm was implemented on an MP3 coder but is also suitable for MPEG-2/4 AAC. Examined subjectively by a group of listeners, the proposed algorithm performs better than other previously reported methods, even at high loss rates.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"10 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":"126372155","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}
引用次数: 8
Designing Self-checking Circuits with Smooth Power Dissipation 设计具有平滑功耗的自检电路
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321147
B. Abramov, V. Ostrovsky, I. Levin
{"title":"Designing Self-checking Circuits with Smooth Power Dissipation","authors":"B. Abramov, V. Ostrovsky, I. Levin","doi":"10.1109/EEEI.2006.321147","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321147","url":null,"abstract":"The paper discuses a new approach for designing self-checking sequential circuits with smooth power dissipation The proposed approach enables achievement of circuits with a lower overhead. At the same time it provides for circuits a specific property to have approximately the same power dissipation on all codewords. A new architecture of the self-checking sequential circuit with smooth power dissipation is proposed. The architecture is investigated on a number of standard benchmarks.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"270 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":"121358004","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}
引用次数: 1
Log-Domain Calculation of the 1959 Sphere-Packing Bound with Application to M-ary PSK Block Coded Modulation 1959球填充界的对数域计算及其在m - PSK分组编码调制中的应用
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321097
I. Sason, G. Wiechman
{"title":"Log-Domain Calculation of the 1959 Sphere-Packing Bound with Application to M-ary PSK Block Coded Modulation","authors":"I. Sason, G. Wiechman","doi":"10.1109/EEEI.2006.321097","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321097","url":null,"abstract":"The 1959 sphere-packing bound of Shannon is reviewed, and a new algorithm is derived for its calculation. This algorithm performs the entire calculation in the logarithmic domain, thus facilitating the exact calculation of the bound for moderate to large block lengths. The new algorithm circumvents the numerical difficulties associated with a previously suggested algorithm by Valembois and Fossorier. We also compare the bound with a new sphere-packing bound which was recently derived by the authors. By applying the bound to M-ary PSK block coded modulation, the new bound suggests an interesting alternative to the Shannon bound.","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":"126834811","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}
引用次数: 2
Capacity of a Bandwidth Constrained Constant Envelope Signal 带宽受限的恒定包络信号的容量
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321134
I. Kalet
{"title":"Capacity of a Bandwidth Constrained Constant Envelope Signal","authors":"I. Kalet","doi":"10.1109/EEEI.2006.321134","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321134","url":null,"abstract":"The capacity of constant envelope signals with bandwidth constraints has been an open problem for many years. In this paper we find a lower bound on this capacity, for second-moment bandwidth constrained signals. The bound is found by utilizing classic results on optimum angle modulation. We found that the capacity of constant envelope signals, in the range investigated, was about two-thirds to three-quarters of the capacity of signals with no amplitude constraints. This indicates that it should be possible to find constant envelope modulations, with spectral efficiencies, which more closely approach the efficiencies of QAM signals.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"30 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":"126359087","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}
引用次数: 0
Reduction of common-mode electromagnetic interference in isolated converters using Negative feedback 利用负反馈减少隔离变换器中的共模电磁干扰
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321136
L. Katzir, S. Singer
{"title":"Reduction of common-mode electromagnetic interference in isolated converters using Negative feedback","authors":"L. Katzir, S. Singer","doi":"10.1109/EEEI.2006.321136","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321136","url":null,"abstract":"In the field of power electronics, there is a trend for pushing up switching frequencies of switched-mode power supplies to reduce volume and weight. This trend causes an increasing level of electromagnetic interference (EMI) emissions. It is well known that common-mode EMI is resulted in by the switching of a parasitic capacitance of transistors, diodes, and transformers the power circuit consists of, which implies current flow to ground (actually the shielding) of the circuit. In this paper a method of common-mode EMI reduction, based on a negative feedback which implies compensating current flow is presented. More specifically, desired EMI reduction in the family of isolated DC/DC converters is achieved by means of a compensating transformer winding and a capacitor. An isolated flyback converter was constructed and tested in the Power laboratory in Tel-Aviv University. Using a spectrum analyzer, it was found that the common-mode EMI created by the parasitic capacitance of the switching transistor decreased between 10 and 15 dB in the low frequency harmonics of the converter.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"13 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":"127315069","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}
引用次数: 2
A Study of Real Time Scheduling for Multiprocessor Systems 多处理器系统实时调度研究
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321087
Moshe Pelleh
{"title":"A Study of Real Time Scheduling for Multiprocessor Systems","authors":"Moshe Pelleh","doi":"10.1109/EEEI.2006.321087","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321087","url":null,"abstract":"There is a variety of algorithms for scheduling tasks on a processor. Some of these algorithms are also used for multiprocessor scheduling under the partitioning scheme or under the global scheduling scheme. The most common scheduling algorithms are: RM, EDF and LST. They are optimal for a single processor scheduling, but at the same time anomalies occur when the algorithms are used for multiprocessor scheduling. To be clear, in this context, an anomaly is a deadline miss. In this paper we introduce a new multiprocessor scheduling algorithm (HAD). The HAD multiprocessor scheduling algorithm avoids the anomalies and it is compact and easy to use. We also compare it with other well known algorithms","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"177 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":"133587353","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}
引用次数: 3
Cooperative Protocols for a Source and an Occasional Nearby Relay 一个源和一个偶然的附近中继的合作协议
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321138
M. Katz, S. Shamai
{"title":"Cooperative Protocols for a Source and an Occasional Nearby Relay","authors":"M. Katz, S. Shamai","doi":"10.1109/EEEI.2006.321138","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321138","url":null,"abstract":"We consider a wireless network where a source is communicating with a remote destination, and where a relay terminal is occasionally present in the source's vicinity without the source's knowledge. Cooperative protocols based on decode-and-forward (DF) and quantize-and-forward (QF) are proposed which improve upon single-user performance when the relay is present, and do not degrade single-user performance in the relay's absence. For DF, optimal correlation between the source's and relay's transmissions is investigated, and for QF, a scheme is suggested for incorporating partial side information without the relay terminal knowing the destination's channel state.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"2012 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":"128123617","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}
引用次数: 1
Automatic Clustering of Hyperspectral Data 高光谱数据的自动聚类
2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel Pub Date : 2006-11-01 DOI: 10.1109/EEEI.2006.321094
R. Salomon, S. Dolberg, S. Rotman
{"title":"Automatic Clustering of Hyperspectral Data","authors":"R. Salomon, S. Dolberg, S. Rotman","doi":"10.1109/EEEI.2006.321094","DOIUrl":"https://doi.org/10.1109/EEEI.2006.321094","url":null,"abstract":"The main goal of this research is to examine some new methods for the automatic clustering of hyperspectral data. Hyperspectral data consists of images which originate from the same physical phenomena at various wavelengths. Use of this data is common not only for medical processing but also for military purposes. In this unique research we will analyze hyperspectral data which has been taken of different types of events that evolve both temporally and spectrally. These events would seemingly be indistinguishable if only the spectral or the temporal dimensions were used. By exploiting the unique attributes of the hyperspectral temporal data, we show that we can significantly improve our target assignment capabilities. We will develop methods to evaluate our ability to correctly assign these events from each other. We will discuss how to automatically cluster such events and determine how many different types of events actually exist. Practical problems previously discussed in the literature will be demonstrated.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"7 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":"122290861","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信