{"title":"Symbol error probability analysis of the Decode and Forward relaying over the composite fading multipath/shadowing channels","authors":"A. Dziri, D. L. Ruyet, D. Roviras, M. Terré","doi":"10.1109/ISSPIT.2010.5711768","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711768","url":null,"abstract":"In this paper, we analyze the performance of cooperative diversity using adaptive Decode and Forward (DF) relaying over independent non identical flat composite fading channels which include multipath fading and shadowing simultaneously. We have considered the generalized-K model which is very versatile and accurately approximates many of the commonly used channel models as Nakagami-m, log-normal distribution and the mixture of the two distributions for the composite fading. We give an analytical expression for the symbol error probability of the proposed scenario and analyze its dependence on the channel parameters. We assume in our context, that the relay decides independently whether or not to forward the signal to the destination based on the received signal quality. Simulation results are in good agreement with our theoretical analysis.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116417","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":"Development of full-featured ECG system for visual stress induced heart rate variability (HRV) assessment","authors":"Wanqing Wu, Jungtae Lee","doi":"10.1109/ISSPIT.2010.5711762","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711762","url":null,"abstract":"Visual stress which can induce headache, migraines and eyestrain affects our body often detrimentally. Heart rate variability (HRV) analysis is commonly used as a quantitative marker depicting the activity of autonomic nervous system (ANS) that may be related to visual stress. In this paper, we proposed an improved HRV methodology for HRV features extraction and analysis. Firstly, a multi-channel portable ECG device has been developed for signal collection, and then we designed full-featured ECG monitoring system which suitable for real-time ECG display, signal processing, high accuracy R wave detection and HRV analysis in time and frequency domain. Taking consideration of the simplicity and real-time, the design of processing flow includes three stages. The first stage is signal preprocessing, we introduced a simple and reliable method termed the Mathematical Morphology (MM) and Difference Operation Method (DOM) for de-noising and R wave amplification. The second stage is to look for the point R and extract R-R interval series based on the above processing. The last stage focuses on HRV analysis from the aspects of time domain and frequency domain. Moreover, this research investigates the relationship between visual stress and HRV, 15 healthy, right-handed volunteers (all males aged from 19 to 25 years) participated in the experiment; there is significant changes of HRV features of visual stress condition compared to reference state. These results show that the HRV is affected by the presence of visual stress and long-term visual stress may weak the function of ANS, which may enable us for visual stress monitoring and management in daily life. Keywords: Portable ECG, Heart Rate Variability (HRV), Signal Processing, Visual Stress, Autonomic Nervous System","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117259800","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":"Localization of wireless sensor network using Bees Optimization Algorithm","authors":"A. Moussa, N. El-Sheimy","doi":"10.1109/ISSPIT.2010.5711760","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711760","url":null,"abstract":"Wireless Sensor Networks (WSNs) are an emerging technology that draws a significant amount of research attention. Localization of the nodes in these networks plays a key enabling role in WSN applications. In this paper, the use of Bees Optimization Algorithm (BOA) for localizing the nodes of the wireless sensor networks is investigated. BOA is population-based search algorithm that performs a neighborhood search combined with random search. It is inspired by the natural foraging behavior of honey bees. The summation of the squared range error between the node and the anchors is used as the objective function to be minimized in this work. Different simulation tests with different topologies are conducted based on normal random distribution for time of arrival (TOA) measurements and log-normal distribution for received signal strength (RSS) measurements. The simulation test results showed effectiveness of the proposed approach in case of TOA measurements when compared with the lower variance achievable by any unbiased location estimator.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127188463","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":"Enhanced channel estimation using Cyclic Prefix in MIMO STBC OFDM sytems","authors":"A. A. Quadeer, M. S. Sohail","doi":"10.1109/ISSPIT.2010.5711794","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711794","url":null,"abstract":"Channel estimation is an important part of any receiver design. This paper presents an improved iterative joint channel estimation and data detection algorithm for Space Time Block Coded (STBC) MIMO OFDM systems in fast fading environments. The algorithm utilizes both time and frequency correlation information. We show how the Cyclic Prefix (CP) can be used to enhance the joint channel estimation and data detection process. We present two variations of the Expectation Maximization (EM) based Forward Backward (FB) Kalman filter algorithm utilizing the CP information and provide their performance comparison. Simulation results show that the proposed use of CP to aid the EM based FB Kalman algorithm results in improved performance.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125799281","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":"Robust digital image watermarking using singular value decomposition","authors":"Morteza Makhloghi, F. Tab, H. Danyali","doi":"10.1109/ISSPIT.2010.5711780","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711780","url":null,"abstract":"This paper presents a blind robust digital image watermarking scheme based on singular value decomposition in wavelet domain for copyright protection. The proposed algorithm inserts bits of singular values of the watermark image in the wavelet coefficients of the host image. In the first step, the wavelet coefficients of each sub-band of the transformed image are grouped into 2×2 blocks. These blocks are sorted according to the defined sequence of singular values of watermark image embedding. To access to bits, we define an algorithm which converts the entries of each wavelet block and the singular values of grey-scale watermark image to new defined semi-binary arrays. Then, the bits of singular values of the watermark are inserted into the arrays of the blocks entries. Finally, the new entries of each block are constructed to make the watermarked image. The experimental results show that the proposed method is more robust against different attacks and the watermarked image has good transparency.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123309772","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. Elhaji, A. Zitouni, S. Meftali, J. Dekeyser, R. Tourki
{"title":"A Low power and highly parallel implementation of the H.264 8 × 8 transform and quantization","authors":"M. Elhaji, A. Zitouni, S. Meftali, J. Dekeyser, R. Tourki","doi":"10.1109/ISSPIT.2010.5711774","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711774","url":null,"abstract":"With the appearance of new video standards like H.264/AVC, demands of real-time encoding are increasing. Real-time is a main necessity for video compression and transmission. Discrete Cosine Transform (DCT) and quantization in H.264 have an important role to express real-time. Nevertheless, for real time operation, parallel processing is the most powerful approach that can be used to give considerable compression performance at standard definition (SD) and high definition (HD) resolution. In this paper a highly parallel hardware implementation of the H.264 8×8 integer transformation and quantization is presented. Experiment results show that this architecture satisfies the real-time constraints intended by different video mobile application.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129079629","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":"Decimation-in-frequency split-radix algorithm for computing new Mersenne number transform","authors":"M. T. Hamood, S. Boussakta","doi":"10.1109/ISSPIT.2010.5711798","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711798","url":null,"abstract":"The new Mersenne number transform (NMNT) has proved to be an important number theoretic transform (NTT) for error-free calculation of convolutions and correlations. Its main feature is that for a suitable Mersenne prime number (p), the allowed power-of-two transform lengths can be very large. In this paper, a new decimation-in-frequency split-radix algorithm for efficient computation of the 1-D NMNT is developed by deriving a general radix-based algorithm in finite fields modulo Mersenne numbers and applying the principles of the split-radix algorithm to the NMNT. The proposed algorithm possesses the in-place computation property, leading to substantial reductions in the number of multiplications and additions. The validity of the proposed algorithm is verified through examples involving numerical calculations of the forward and inverse transforms and digital filtering applications, using both the 1-D NMNT and the developed algorithm.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123373416","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":"Parallel image transmission and compression Using windowed kriging interpolation","authors":"Mauritz Panggabean, O. Tamer, L. A. Rønningen","doi":"10.1109/ISSPIT.2010.5711801","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711801","url":null,"abstract":"We propose the use of windowed kriging to enable ordinary kriging to interpolate sampled natural images of much higher resolution. Due to its high computational cost, applying ordinary kriging on a whole image can interpolate samples from only 5% of a 64×64 image, while windowed kriging can process images with resolutions higher than 512×512 pixels. Our proposal is motivated by our vision of real-time near-natural collaboration from distributed places based on Distributed Multimedia Plays (DMP) architecture that is realizable in another decade. Windowed kriging allows parallel transmission and compression of sampled natural images to facilitate controlled packets dropping by network nodes for graceful video quality degradation with guaranteed maximum end-to-end delay. Our simple window scheme makes parallel interpolation at the receiver side possible, for which a design of parallel hardware implementation is presented. Typical artifacts due to applying the technique can easily be eliminated completely to produce images of decent quality.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114729059","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":"Skin region based method for reducing motion estimation time","authors":"M. Shirali-Shahreza, S. Shirali-Shahreza","doi":"10.1109/ISSPIT.2010.5711790","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711790","url":null,"abstract":"Video compression algorithms are time consuming processes. A key part of video compression algorithms which is also time consuming is motion estimation (ME) and computation of motion vectors (MVs). During this process, a series of candidate blocks should be searched to find the best motion vectors. In this paper, we propose a method for reducing the motion estimation process time. The idea of our method is to compare skin regions of candidate blocks with current frame block and skipping some candidate blocks during the search. We propose some conditions for comparing the skin regions of two blocks and describe how we can check these conditions quickly. Our method provides two parameters that can be used to create a balance between the processing time and the motion estimation accuracy.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128202259","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 cyclic prefix based adaptive channel estimation algorithm for multicarrier systems","authors":"H. Ali","doi":"10.1109/ISSPIT.2010.5711779","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711779","url":null,"abstract":"This paper presents an adaptive channel estimation algorithm that exploits cyclic prefix (CP) from its data detection part and employs systolic block Householder transformation recursive least squares (SBHT-RLS) algorithm for channel tracking in multicarrier systems. The new method is computationally cheaper than CP exploiting correlation matrix based block RLS (CMB-RLS) channel estimation approach, and possesses desirable properties for very large-scale integration (VLSI) implementation. Our floating point simulations show that the new algorithm can track the channel with better steady state performance. Also, it is determined that the precision of floating-point computation of the proposed method can be well approximated with a 24-bit word length fixed point computation.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115785870","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}