{"title":"Performance limitations of an optical RZ-DPSK transmission system affected by frequency chirp, chromatic dispersion and polarization mode dispersion","authors":"L. Kassa-Baghdouche, L. M. Simohamed","doi":"10.1109/WOSSPA.2011.5931440","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931440","url":null,"abstract":"The performance limitations due to the combined effects of frequency chirp and CD or PMD in a 40 Gbit/s optical Return-to-Zero Differential Phase-Shift-Keying (RZ-DPSK) transmission system are numerically simulated. By means of numerical simulations, we optimize the bandwidths of the optical and electrical receiver's filters. Then, the impact of the Chirp factor (C) on the Bit Error Rate (BER) performance is analyzed when the received signal is filtered by two types of optical filter (Fabry-Perot filter (FP) or Fiber Bragg Grating filter (FBG)). The optical power penalties caused by the Frequency Chirp impact at BER of 10−9 in the presence of CD or PMD are evaluated. Simulation results show that, without CD and PMD the system suffer a significant amount of power penalties due to the Chirp factor, and the optical filter has no influence on the power penalties. However, it is found that with CD or PMD, the optical filter has significant influence on the power penalty, and with CD the system which uses FBG filter always performs better than the one which uses FP filter, whereas with PMD the better performances switch from FBG filter to FP filter. This provides the basis for tradeoff between FP and FBG filter performances through careful selection of a suitable optical filter to high speed optical transmission system.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"117 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945928","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":"Multiple target tracking and classification using the unscented probability hypothesis density filter","authors":"M. Melzi, A. Ouldali, Z. Messaoudi","doi":"10.1109/WOSSPA.2011.5931461","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931461","url":null,"abstract":"Tracking an unknown and time varying number of targets is a difficult issue. The Unscented Probability Hypothesis Density Filter (UKPHD) tackles this problem, moreover, it allows the estimation of both the number of targets and their states without any data association steps by considering the target states as a single global target state, its a closed-form solution for the probability hypothesis density (PHD) filter that deals with non linear systems, it propagates the first-order moment of the multitarget posterior instead of the posterior distribution itself because evaluating the multiple-target posterior distribution is currently computationally intractable for real-time applications in multiple Target tracking problems. However, targets are poorly described by a single dynamic model, in fact, they may change their kinematic model at any time which makes the tracking algorithm incapable of estimating efficiently the true trajectories. The Interacting Multiple Model (IMM) algorithm is used to address this. The IMM uses multiple models to describe targets behavior and adaptively determines which model(s) are the most appropriate at each time step. In this paper, we present a new interacting multiple model Unscented probability hypothesis density filter (IMM-UKPHD) to deal with the problem of tracking a time varying number of maneuvering targets. In our approach, a bank of Unscented probability hypothesis density filters is used in the interacting multiple model (IMM) framework for updating the state of moving targets. Simulation results show the efficiency of the proposed algorithm.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116757379","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":"Elliptic Curve Cryptography and its applications","authors":"M. Amara, Amar Siad","doi":"10.1109/WOSSPA.2011.5931464","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931464","url":null,"abstract":"The idea of Elliptic Curve Cryptography (ECC), and how it's a better promise for a faster and more secure method of encryption in comparison to the current standards in the Public-Key Cryptographic algorithms of RSA is discussed in this paper. The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. The function used for this purpose is the scalar multiplication k.P which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. This article explains the role of ECC in the network security. ECC's uses with smaller keys to provide high security and high speed.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114874323","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":"Obstacle detection with 3D camera using U-V-Disparity","authors":"Yuan Gao, X. Ai, J. Rarity, N. Dahnoun","doi":"10.1109/WOSSPA.2011.5931462","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931462","url":null,"abstract":"Obstacle detection has been one of the most critical features for reliable driving scene analysis. This paper presents an approach for an automatic obstacle detection system. The proposed system makes use of depth information generated by a 3D camera mounted on the front of a moving vehicle. Obstacles projected as line features in the V-U-Disparity map can be extracted to detect the road surface and obstacles. A Steerable Filter is employed at an early stage to dramatically lower the noise. Furthermore, a modified Hough Transform is placed to extract the straight line feature from the depth map with improved accuracy. The system is robust in dealing with fault detection caused by roadside features which is a commonly shared problem in many other obstacle detection approaches.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673272","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":"LSF-CMA based blind equalization algorithms for MC-CDMA systems","authors":"A. B. Djebbar","doi":"10.1109/WOSSPA.2011.5931452","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931452","url":null,"abstract":"In this paper, a new blind equalization for multiuser multi-carrier code division multiple access (MC-CDMA) systems under Rayleigh multipath fading channel is proposed. The later causes the ICI and ISI that destroy the relationship of the guard interval (GI) redundancy. Through exploiting the structural properties of MC-CDMA transmitted signal, the estimation can be resolved using least square fitting (LSF) and subspace approaches. Indeed, GI redundancy together with excess codes (EC) are used to restore the MC-CDMA properties. In addition, we propose the use of the previous algorithms in conjunction with a constant modulus algorithm (CMA) to improve the performance gain. Our simulation results show the robustness and effectiveness of the proposed algorithms.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878917","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}
D. Cherifi, M. Doghmane, A. Nait-Ali, Zakia Aici, Salim Bouzelha
{"title":"Abnormal tissus extraction in MRI brain medical images","authors":"D. Cherifi, M. Doghmane, A. Nait-Ali, Zakia Aici, Salim Bouzelha","doi":"10.1109/WOSSPA.2011.5931510","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931510","url":null,"abstract":"This study is a comparison between two image segmentation's methods; the first method is based on normal brain's tissue recognition then tumor extraction using thresholding method. The second method is classification based on EM segmentation which is used for both brain recognition and tumor extraction. The goal of these methods is to detect, segment, extract, classify and measure properties of the brain normal and abnormal (tumor) tissues","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127250956","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":"An iterative speech encryption scheme based on subspace technique","authors":"Atef Mermoul","doi":"10.1109/WOSSPA.2011.5931512","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931512","url":null,"abstract":"Among the cryptographic approaches, signal processing techniques has become recently an interesting one. Blind source separation (BSS)-based encryption schemes have been built up using the intractability of the under determined BSS problem. In this paper, we propose a new encryption method. The proposed approach is iterative and based on the subspace concept together with the use of nonlinear functions and key signals. The proposed technique presents an interesting feature: only a part of the secret key parameters used during encryption is necessary for decryption. Furthermore, the iterative encryption algorithm will provide no contents if no plain-text is fed in the input.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116733629","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":"Low complexity image compression algorithm using AMBTC and bit plane squeezing","authors":"Saad Al-Azawi, S. Boussakta, Alexandre Yakovlev","doi":"10.1109/WOSSPA.2011.5931432","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931432","url":null,"abstract":"This paper introduces a low complex image compression algorithm. The proposed algorithm is a combination of pattern squeezing, moments re-quantizing, absolute moments block truncation coding (AMBTC) and a postprocessing unit. One advantage of the proposed algorithm is that it reduces and controls the higher bit rate of the AMBTC while preserving a reasonable image quality. The complexity reduction has been accomplished by utilizing only four (2×2) bit patterns rather than a 32 or 64 (4×4) pattern fitting. This proposed size of pattern fitting reduces the computation costs by reducing the time and arithmetic operations required to search for the best match plane. The four (2×2) bit planes offer the advantage of bit rate control by performing multi level bit plane reduction. This operation has been named pattern squeezing. The algorithm performance has shown good image quality with lower bit rate.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125119372","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":"Differential evolution algorithm for PAPR reduction in OFDM systems","authors":"H. Ait Saadi, A. Guessoum, J. Chouinard","doi":"10.1109/WOSSPA.2011.5931444","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931444","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is is a sophisticated multicarrier modulation technique. It's known by its robustness against frequency selective fading channels. In return, the major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This feature makes the OFDM signals very sensitive to non-linearities of the High Power Amplifier (HPA). Partial transmit sequence (PTS), is one of the most attractive method to reduce the PAPR in OFDM systems. It achieves considerable PAPR reduction without distortion, but it requires an exhaustive search over all the combinations of the given phase factors, which results in a computational complexity increases exponentially with the number of partitions. We propose in this paper, a sub-optimal PTS method based on Differential Evolution optimization method (DE), reducing efficiently the computational complexity.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128988571","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":"An efficient design of fractional lead filter via fractional order system","authors":"T. Bensouici, A. Charef","doi":"10.1109/WOSSPA.2011.5931504","DOIUrl":"https://doi.org/10.1109/WOSSPA.2011.5931504","url":null,"abstract":"In this paper the design method of the digital fractional lead operator zα for 0 < α < 0.5, in a given frequency band of interest, using digital Infinite Impulse Response (IIR) filters is presented. In this technique, the coefficients of the closed form digital IIR filter derived for the approximation of the fractional lead operator, in a given frequency band, are based on the approximation of fractional order systems. First, analog rational function approximation, for a given frequency band, of the fractional power zero (FPZ) is given. Then the Tustin (bilinear) generating function is used to digitize the FPZ to obtain a closed form IIR digital filter which approximates the digital fractional lead operator zα for (0 < α < 0.5). Finally, an example has been presented to illustrate the effectiveness of the proposed design technique.","PeriodicalId":343415,"journal":{"name":"International Workshop on Systems, Signal Processing and their Applications, WOSSPA","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129482030","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}