Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306363
M. Mroué, S. Mallégol, S. Haese, G. Elzein, A. Bisiaux, S. Paquelet
This paper presents an architecture of an IR-UWB MB-OOK non-coherent transceiver realized at Mitsubishi Electric. Channel measurements in real indoor environment based on this realized prototype are provided. The different components of this transceiver are described. A comparison between the use of directional and omnidirectional antennas at both emission and reception is presented. Then, a data rate estimation of the communicating system is given. Measurements are performed for both LOS and NLOS short-range indoor communications.
{"title":"A multi-band IR-UWB HDR transceiver: architecture and indoor channel measurements","authors":"M. Mroué, S. Mallégol, S. Haese, G. Elzein, A. Bisiaux, S. Paquelet","doi":"10.1109/ICSPCS.2009.5306363","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306363","url":null,"abstract":"This paper presents an architecture of an IR-UWB MB-OOK non-coherent transceiver realized at Mitsubishi Electric. Channel measurements in real indoor environment based on this realized prototype are provided. The different components of this transceiver are described. A comparison between the use of directional and omnidirectional antennas at both emission and reception is presented. Then, a data rate estimation of the communicating system is given. Measurements are performed for both LOS and NLOS short-range indoor communications.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130262917","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306380
F. Foroughi, J. Lofgren, O. Edfors
In this paper, we present an analysis of different channel estimator structures that can be used and efficiently implemented with minor configuration changes of a common hardware for both LTE and DVB-H. Such common estimator structures for LTE and DVB-H allow algorithm and hardware reuse when both standards are implemented on the same platform. In this approach, a core estimator will be utilized to address parameter estimation for the two standards. The estimators exploit similarities in pilot patterns between LTE and DVB-H. The estimation techniques are discussed taking both algorithm and complexity issues into account.
{"title":"Channel estimation for a mobile terminal in a multi-standard environment (LTE and DVB-H)","authors":"F. Foroughi, J. Lofgren, O. Edfors","doi":"10.1109/ICSPCS.2009.5306380","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306380","url":null,"abstract":"In this paper, we present an analysis of different channel estimator structures that can be used and efficiently implemented with minor configuration changes of a common hardware for both LTE and DVB-H. Such common estimator structures for LTE and DVB-H allow algorithm and hardware reuse when both standards are implemented on the same platform. In this approach, a core estimator will be utilized to address parameter estimation for the two standards. The estimators exploit similarities in pilot patterns between LTE and DVB-H. The estimation techniques are discussed taking both algorithm and complexity issues into account.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131453531","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306355
T. Wysocki, B. Wysocki, Sarah Spence Adams
Quaternion orthogonal designs (QODs) have been previously introduced as a basis for orthogonal space-time polarization block codes (OSTPBCs). This note will serve to correct statements concerning the optimality of a decoupled maximum-likelihood (ML) decoding algorithm. It will be shown that when compared to coupled decoding, the decoupled decoding is only optimal in certain cases. This raises several open problems concerning the decoding of OSTPBCs.
{"title":"On the issue of decoupled decoding of codes derived from quaternion orthogonal designs","authors":"T. Wysocki, B. Wysocki, Sarah Spence Adams","doi":"10.1109/ICSPCS.2009.5306355","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306355","url":null,"abstract":"Quaternion orthogonal designs (QODs) have been previously introduced as a basis for orthogonal space-time polarization block codes (OSTPBCs). This note will serve to correct statements concerning the optimality of a decoupled maximum-likelihood (ML) decoding algorithm. It will be shown that when compared to coupled decoding, the decoupled decoding is only optimal in certain cases. This raises several open problems concerning the decoding of OSTPBCs.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"72 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123264887","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306413
T. Childers, Y. T. Poh, J. McEachen, M. Tummala
A method for file transfer utilizing forward error correction (FEC) to pass traffic over deployed wireless sensor networks is studied. The entire wireless sensor network is modeled as an error-prone virtual physical link. Previous work in the area of terminal communication across the sensor network is expanded upon to include file transfer in order to provide a more capable channel and a basis for testing the performance obtained through erasure coding. The results of the FEC implementation are examined using multiple sensor network configurations. While the error correction method proved effective, larger topologies presented congestion issues due to the sensors' use of CSMA. Recommendations for future improvements are proposed.
{"title":"A model for virtual physical layer communication over deployed wireless sensor networks","authors":"T. Childers, Y. T. Poh, J. McEachen, M. Tummala","doi":"10.1109/ICSPCS.2009.5306413","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306413","url":null,"abstract":"A method for file transfer utilizing forward error correction (FEC) to pass traffic over deployed wireless sensor networks is studied. The entire wireless sensor network is modeled as an error-prone virtual physical link. Previous work in the area of terminal communication across the sensor network is expanded upon to include file transfer in order to provide a more capable channel and a basis for testing the performance obtained through erasure coding. The results of the FEC implementation are examined using multiple sensor network configurations. While the error correction method proved effective, larger topologies presented congestion issues due to the sensors' use of CSMA. Recommendations for future improvements are proposed.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122640469","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306414
G. Al-Suhail, R. Kennedy
Conventional transmission schemes perform poorly in wireless channels. In this paper, an analytical adaptive model for wireless link svia heuristic TCP/FEC functions is proposed with chosen modulation format for transporting mobile MPEG-4 video. A wireless channel introduces that the bit errors at the link-layer packets are due to time-invariant features over UMTS network and consequently the optimal perceived video quality at the client can be improved when adaptive TCP throughput after error-corrections is achieved for the certain predefined system threshold of the residual packet error rate. The simulation results show that a video quality can dynamically adapt to the optimal FEC codes at an appropriate selection for modulation scaling in the radio-link layer.
{"title":"Modeling of adaptive wireless link for MPEG-4 video transport in UMTS network","authors":"G. Al-Suhail, R. Kennedy","doi":"10.1109/ICSPCS.2009.5306414","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306414","url":null,"abstract":"Conventional transmission schemes perform poorly in wireless channels. In this paper, an analytical adaptive model for wireless link svia heuristic TCP/FEC functions is proposed with chosen modulation format for transporting mobile MPEG-4 video. A wireless channel introduces that the bit errors at the link-layer packets are due to time-invariant features over UMTS network and consequently the optimal perceived video quality at the client can be improved when adaptive TCP throughput after error-corrections is achieved for the certain predefined system threshold of the residual packet error rate. The simulation results show that a video quality can dynamically adapt to the optimal FEC codes at an appropriate selection for modulation scaling in the radio-link layer.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124472027","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306372
Ali Hassan, C. Phillips
In this paper, a novel Chaotic Particle Swarm Optimization (CPSO) based scheme is proposed for solving Dynamic Routing and Wavelength Assignment problem in All-Optical WDM optical networks without any wavelength conversion. A novel fitness function is proposed to improve the connection blocking probability by taking into account normalized path length and wavelength availability over the whole path. Simulation results show that CPSO not only performs better in terms of connection blocking probability performance as compared to other heuristic schemes like Genetic Algorithms, it also presents better solution quality as compared to Particle Swarm Optimization (PSO).
{"title":"Chaotic Particle Swarm Optimization for Dynamic Routing and Wavelength Assignment in All-Optical WDM networks","authors":"Ali Hassan, C. Phillips","doi":"10.1109/ICSPCS.2009.5306372","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306372","url":null,"abstract":"In this paper, a novel Chaotic Particle Swarm Optimization (CPSO) based scheme is proposed for solving Dynamic Routing and Wavelength Assignment problem in All-Optical WDM optical networks without any wavelength conversion. A novel fitness function is proposed to improve the connection blocking probability by taking into account normalized path length and wavelength availability over the whole path. Simulation results show that CPSO not only performs better in terms of connection blocking probability performance as compared to other heuristic schemes like Genetic Algorithms, it also presents better solution quality as compared to Particle Swarm Optimization (PSO).","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158840","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306371
Gang Xiong, S. Kishore
This paper presents the consensus-based distributed detection (CBDD) algorithm for wireless ad hoc networks, where no fusion center is involved in collecting local information and all nodes reach global decision consensus based on local information exchange. The convergence properties and probability of error of the CBDD algorithm are investigated assuming independent and identically distributed (i.i.d.) Gaussian observations with shifted mean under both an ideal and practical multiaccess (MAC) channel. Specifically, with appropriate algorithm design, there exists an optimal number of iterations that yields the minimum probability of error. Finally, simulation results are provided to verify these analytical results.
{"title":"Consensus-based distributed detection algorithm in wireless ad hoc networks","authors":"Gang Xiong, S. Kishore","doi":"10.1109/ICSPCS.2009.5306371","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306371","url":null,"abstract":"This paper presents the consensus-based distributed detection (CBDD) algorithm for wireless ad hoc networks, where no fusion center is involved in collecting local information and all nodes reach global decision consensus based on local information exchange. The convergence properties and probability of error of the CBDD algorithm are investigated assuming independent and identically distributed (i.i.d.) Gaussian observations with shifted mean under both an ideal and practical multiaccess (MAC) channel. Specifically, with appropriate algorithm design, there exists an optimal number of iterations that yields the minimum probability of error. Finally, simulation results are provided to verify these analytical results.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114428607","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306435
Suat Bayram, S. Gezici
Performance of some suboptimal detectors can be improved by adding independent noise to their observations. In this paper, the effects of adding independent noise to observations of a detector are investigated for binary composite hypothesis-testing problems in a generalized Neyman-Pearson framework. Sufficient conditions are derived to determine when performance of a detector can or cannot be improved via additional independent noise. Also, upper and lower limits are derived on the performance of a detector in the presence of additional noise, and statistical characterization of optimal additional noise is provided. In addition, two optimization techniques are proposed to calculate the optimal additional noise. Finally, simulation results are presented to investigate the theoretical results.
{"title":"Effects of additional independent noise in binary composite hypothesis-testing problems","authors":"Suat Bayram, S. Gezici","doi":"10.1109/ICSPCS.2009.5306435","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306435","url":null,"abstract":"Performance of some suboptimal detectors can be improved by adding independent noise to their observations. In this paper, the effects of adding independent noise to observations of a detector are investigated for binary composite hypothesis-testing problems in a generalized Neyman-Pearson framework. Sufficient conditions are derived to determine when performance of a detector can or cannot be improved via additional independent noise. Also, upper and lower limits are derived on the performance of a detector in the presence of additional noise, and statistical characterization of optimal additional noise is provided. In addition, two optimization techniques are proposed to calculate the optimal additional noise. Finally, simulation results are presented to investigate the theoretical results.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125707973","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306434
Xiangyun Zhou, M. Mckay
We consider the problem of secure communication in wireless fading channels in the presence of non-colluding passive eavesdroppers. The transmitter has multiple antennas and is able to simultaneously transmit an information bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form lower bound for secrecy capacity, which is used as the objective function to optimize transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple and generic strategy which achieves near optimal capacity performance. We also find that adaptive power allocation based on each channel realization provides no or insignificant capacity improvement over equal power allocation.
{"title":"Physical layer security with artificial noise: Secrecy capacity and optimal power allocation","authors":"Xiangyun Zhou, M. Mckay","doi":"10.1109/ICSPCS.2009.5306434","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306434","url":null,"abstract":"We consider the problem of secure communication in wireless fading channels in the presence of non-colluding passive eavesdroppers. The transmitter has multiple antennas and is able to simultaneously transmit an information bearing signal to the intended receiver and artificial noise to the eavesdroppers. We obtain an analytical closed-form lower bound for secrecy capacity, which is used as the objective function to optimize transmit power allocation between the information signal and the artificial noise. Our analytical and numerical results show that equal power allocation is a simple and generic strategy which achieves near optimal capacity performance. We also find that adaptive power allocation based on each channel realization provides no or insignificant capacity improvement over equal power allocation.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"36 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114035022","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}
Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306401
Ibrahim El Rube', Maha A. Sharks, Ashor R. Salem
Image registration is the step in many application areas such as computer vision, remote sensing and medical image processing. Image registration is achieved by aligning two or more images according to the estimated transformation between them. In this paper, we present an image registration algorithm, which combines the multi-scale wavelet transform with Scale Invariant Feature Transform (SIFT). First, images are decomposed into multiple scales using Wavelet Transform (WT), then the low frequency (approximation) image at certain level is input to SIFT algorithm. The proposed algorithm speeds up the calculation of the correspondences between images. Experimental results with different remote sensing images illustrate the accuracy of proposed algorithm.
{"title":"Image registration based on multi-scale SIFT for remote sensing images","authors":"Ibrahim El Rube', Maha A. Sharks, Ashor R. Salem","doi":"10.1109/ICSPCS.2009.5306401","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306401","url":null,"abstract":"Image registration is the step in many application areas such as computer vision, remote sensing and medical image processing. Image registration is achieved by aligning two or more images according to the estimated transformation between them. In this paper, we present an image registration algorithm, which combines the multi-scale wavelet transform with Scale Invariant Feature Transform (SIFT). First, images are decomposed into multiple scales using Wavelet Transform (WT), then the low frequency (approximation) image at certain level is input to SIFT algorithm. The proposed algorithm speeds up the calculation of the correspondences between images. Experimental results with different remote sensing images illustrate the accuracy of proposed algorithm.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043983","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：