Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306370
P. Montezuma, R. Dinis, Miguel Luzio
Based on nonlinear OQPSK (Offset Quadrature Phase Shift Keying) format it is possible to define a wide class of TC-OQAM signals (Trellis Coded-Offset Quadrature Amplitude Modulation) with good gains. This paper investigates nonlinear effects in TC-OQAM signals, taking advantage of the the nonlinear OQPSK format. This allows an analytical characterization of the transmitted signals when affected by nonlinear devices such as those inherent to a nonlinear power amplification, which can be used for obtaining the PSD (Power Spectral Density) of the transmitted signals, the design of the optimum receiver as the corresponding performance.
{"title":"Analytical characterization of nonlinearly distorted TC-OQAM signals","authors":"P. Montezuma, R. Dinis, Miguel Luzio","doi":"10.1109/ICSPCS.2009.5306370","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306370","url":null,"abstract":"Based on nonlinear OQPSK (Offset Quadrature Phase Shift Keying) format it is possible to define a wide class of TC-OQAM signals (Trellis Coded-Offset Quadrature Amplitude Modulation) with good gains. This paper investigates nonlinear effects in TC-OQAM signals, taking advantage of the the nonlinear OQPSK format. This allows an analytical characterization of the transmitted signals when affected by nonlinear devices such as those inherent to a nonlinear power amplification, which can be used for obtaining the PSD (Power Spectral Density) of the transmitted signals, the design of the optimum receiver as the corresponding performance.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"6 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":"128528607","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.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.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.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.5306408
F. Muhammad, J. Baudais, J. Hélard
The resource allocation problem to maximize the bit rate of a linear precoded orthogonal frequency division multiplexing (LP-OFDM) system is considered taking into account the effects of imperfect channel state information. A discrete bit loading algorithm is proposed, which sustains the target bit error rate even under high mean square error (MSE) of estimation. The proposed scheme enhances the robustness of the system against noisy channel estimation without significantly compromising on the system throughput. It is shown that the proposed LP-OFDM allocation is more robust to estimation noise than OFDM allocations and provides sustainable mean bit error rate performance even at high MSEs. The results are shown for a power line communication system using a well-known multipath channel model.
{"title":"Bit rate maximization for LP-OFDM with noisy channel estimation","authors":"F. Muhammad, J. Baudais, J. Hélard","doi":"10.1109/ICSPCS.2009.5306408","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306408","url":null,"abstract":"The resource allocation problem to maximize the bit rate of a linear precoded orthogonal frequency division multiplexing (LP-OFDM) system is considered taking into account the effects of imperfect channel state information. A discrete bit loading algorithm is proposed, which sustains the target bit error rate even under high mean square error (MSE) of estimation. The proposed scheme enhances the robustness of the system against noisy channel estimation without significantly compromising on the system throughput. It is shown that the proposed LP-OFDM allocation is more robust to estimation noise than OFDM allocations and provides sustainable mean bit error rate performance even at high MSEs. The results are shown for a power line communication system using a well-known multipath channel model.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"73 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":"124647374","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.5306410
Le Chung Tran, Alfred Mertins, Xiaojing Huang, E. Dutkiewicz
Cooperative communication has been intensively considered for general wireless and sensor networks. However, it has been almost untouched in Space-Time-Frequency Coded Multi-band OFDM Ultra-Wideband (STFC MB-OFDM UWB) systems. This paper thus proposes two cross-layer designs for cooperative communication, namely Simple Cooperative Communication Scheme (SCCS) and Advanced Cooperative Communication Scheme (ACCS), in slow fading scenarios. In the former, nodes always cooperate with one another despite the possibly erroneous reception at the partner nodes, while in the latter, nodes cooperate only in the case of successful reception. Simulations show that these schemes may considerably improve the performance of STFC MB-OFDM UWB without any increase of transmission power.
{"title":"Novel cooperative communication schemes for Space-Time-Frequency Coded MB-OFDM UWB","authors":"Le Chung Tran, Alfred Mertins, Xiaojing Huang, E. Dutkiewicz","doi":"10.1109/ICSPCS.2009.5306410","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306410","url":null,"abstract":"Cooperative communication has been intensively considered for general wireless and sensor networks. However, it has been almost untouched in Space-Time-Frequency Coded Multi-band OFDM Ultra-Wideband (STFC MB-OFDM UWB) systems. This paper thus proposes two cross-layer designs for cooperative communication, namely Simple Cooperative Communication Scheme (SCCS) and Advanced Cooperative Communication Scheme (ACCS), in slow fading scenarios. In the former, nodes always cooperate with one another despite the possibly erroneous reception at the partner nodes, while in the latter, nodes cooperate only in the case of successful reception. Simulations show that these schemes may considerably improve the performance of STFC MB-OFDM UWB without any increase of transmission power.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"115 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":"131026288","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
扫码关注我们
求助内容：
应助结果提醒方式：