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

2011 IEEE Workshop on Signal Processing Systems (SiPS)最新文献

筛选
英文 中文
Classification of multichannel uterine EMG signals by using unsupervised competitive learning 基于无监督竞争学习的多通道子宫肌电信号分类
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088987
Bassam Moslem, M. Diab, M. Khalil, C. Marque
{"title":"Classification of multichannel uterine EMG signals by using unsupervised competitive learning","authors":"Bassam Moslem, M. Diab, M. Khalil, C. Marque","doi":"10.1109/SiPS.2011.6088987","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088987","url":null,"abstract":"Multichannel analysis is an innovative technique used for the analysis of bioelectrical signals. In this paper, we analyzed uterine Electromyogram (EMG) signals recorded by means of a 4×4 electrode matrix positioned on the woman's abdomen by using a multichannel approach. Relevant features were extracted from each channel and fed to a competitive neural network (CNN). First, we evaluated the classification performance of each channel. Then, we compared these performances to see which channel ranks better than the others. Finally, a decision fusion method based on the weighted sum of the individual decision of each channel was tested. The results showed that data can be grouped into 2 different groups. Furthermore, they showed that the classification performance varies according to the position of the electrode. Therefore, when a decision fusion rule was applied, the network yielded better classification accuracy than any individual channel could provide. These encouraging results prove that multichannel analysis can improve the classification of uterine EMG signals.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127242687","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}
引用次数: 10
Automatic synthesis of TTA processor networks from RVC-CAL dataflow programs 从RVC-CAL数据流程序自动合成TTA处理器网络
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088944
J. Boutellier, O. Silvén, M. Raulet
{"title":"Automatic synthesis of TTA processor networks from RVC-CAL dataflow programs","authors":"J. Boutellier, O. Silvén, M. Raulet","doi":"10.1109/SiPS.2011.6088944","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088944","url":null,"abstract":"The RVC-CAL dataflow language has recently become standardized through its use as the official language of Recon-figurable Video Coding (RVC), a recent standard by MPEG. The tools developed for RVC-CAL have enabled the transformation of RVC-CAL dataflow programs into C language and VHDL (among others), enabling implementations for instruction processors and HDL synthesis. This paper introduces new tools that enable automatic creation of heterogeneous multiprocessor networks out of RVC-CAL dataflow programs. Each processor in the network performs the functionality of one RVC-CAL actor. The processors are of the Transport Triggered Architecture (TTA) type, for which a complete co-design toolset exists. The existing tools enable customizing the processors according to the requirements of individual dataflow actors. The functionality of the tool chain has been demonstrated by synthesizing an MPEG-4 Simple Profile video decoder to an FPGA. This particular decoder is automatically realized into 21 tiny, heterogeneous processors.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121782852","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}
引用次数: 9
Design and implementation of a high data rate MICS digital baseband transmitter 高数据速率MICS数字基带发射机的设计与实现
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-12-01 DOI: 10.1109/SiPS.2011.6088942
Junha Im, Sangmin Lee, Jaeseok Kim
{"title":"Design and implementation of a high data rate MICS digital baseband transmitter","authors":"Junha Im, Sangmin Lee, Jaeseok Kim","doi":"10.1109/SiPS.2011.6088942","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088942","url":null,"abstract":"An efficient design and VLSI implementation of a high data rate Medical Implant Communications Service (MICS) digital baseband transmitter for implantable medical devices is proposed in this paper. An orthogonal frequency division multiplexing (OFDM)-based multicarrier scheme is used to overcome the data rate limitation caused by the narrow bandwidth of 300 kHz. The proposed transmitter can support enhanced data rate by utilizing multiple channels simultaneously. Furthermore, to satisfy the MICS regulation, various schemes are applied including optimized subcarrier allocation for inverse fast Fourier transform (IFFT) and additional sidelobe suppression technique. The proposed transmitter with optimized hardware architecture is verified by VLSI implementation and it can support a maximum data rate of 4.86 Mbps, which is more than ten times faster than the previous systems.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116796300","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
Computational complexity of cyclotomic fast Fourier transforms over characteristic-2 fields 特征-2场的分圈快速傅里叶变换的计算复杂度
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-08-21 DOI: 10.1109/SiPS.2011.6088940
Xuebin Wu, Zhiyuan Yan
{"title":"Computational complexity of cyclotomic fast Fourier transforms over characteristic-2 fields","authors":"Xuebin Wu, Zhiyuan Yan","doi":"10.1109/SiPS.2011.6088940","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088940","url":null,"abstract":"Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of their low multiplicative and overall complexities. However, their advantages are shown by inspection in the literature, and there is no asymptotic computational complexity analysis for CFFTs. Their high additive complexity also incurs difficulties in hardware implementations. In this paper, we derive the bounds for the multiplicative and additive complexities of CFFTs, respectively. Our results confirm that CFFTs have the smallest multiplicative complexities among all known algorithms while their additive complexities render them asymptotically suboptimal. However, CFFTs remain valuable as they have the smallest overall complexities for most practical lengths. Our additive complexity analysis also leads to a structured addition network, which not only has low complexity but also is suitable for hardware implementations.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128275269","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}
引用次数: 4
Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN SFN数字广播的代数星地混合空时编码
2011 IEEE Workshop on Signal Processing Systems (SiPS) Pub Date : 2011-03-02 DOI: 10.1109/SiPS.2011.6088980
C. Hollanti, R. Vehkalahti, Y. Nasser
{"title":"Algebraic hybrid satellite-terrestrial space-time codes for digital broadcasting in SFN","authors":"C. Hollanti, R. Vehkalahti, Y. Nasser","doi":"10.1109/SiPS.2011.6088980","DOIUrl":"https://doi.org/10.1109/SiPS.2011.6088980","url":null,"abstract":"Lately, different methods for broadcasting future digital TV in a single frequency network (SFN) have been under an intensive study. To improve the transmission to also cover suburban and rural areas, a hybrid scheme may be used. In hybrid transmission, the signal is transmitted both from a satellite and from a terrestrial site. In 2008, Y. Nasser et al. proposed to use a double layer 3D space-time (ST) code in the hybrid 4×2 MIMO transmission of digital TV. In this paper, alternative codes with simpler structure are proposed for the 4×2 hybrid system, and new codes are constructed for the 3×2 system. The performance of the proposed codes is analyzed through computer simulations, showing a significant improvement over simple repetition schemes. The proposed codes prove in addition to be very robust in the presence of power imbalance between the two sites.","PeriodicalId":368538,"journal":{"name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134151448","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}
引用次数: 5
首页 上一页
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学术官方微信
小红书