{"title":"Advanced Signal Processing Techniques for the Enhancement of Secure Wireless Communication Systems Utilizing Spread-Spectrum Signaling and Smart Antennas","authors":"S. El-Khamy","doi":"10.1109/ICCES.2006.320415","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320415","url":null,"abstract":"The use of advanced signal processing approaches for improving the performance of secure wireless communication systems utilizing Smart Antennas and Spread Spectrum (SS) signaling is overviewed in this paper,. Emphasis is placed on research results obtained by the author and his research group in the last decade. Using advanced signal processing is shown to highly improve the performance of Smart Antennas and SS techniques in interference limited and wideband multi-user wireless communication systems. The considered advanced signal processing techniques include Artificial Neural Networks (ANN), Wavelets, Higher Order Statistics (HOS) and the related constant Modulus Algorithms (CMA), Genetic Algorithms (GA) and Fractals. In the presentation, the following enhancements of Smart Antenna using modern signal processing techniques are briefly described: i. Using ANN to shape the Array factor, reduce the side-lobe level and affect steerable interference nulling. ii. The use of HOS for blind beamforming and detection of multi-Source multipath signals with general antenna array structures. iii. The use of CMA for mitigating multipath and fading effects. iv. The use of Wavelets in the design of blocking matrix for sidelobe cancellers and for broadband beamforming. v. Using GA for smart and wideband array design. vi. The design of Fractal Arrays for multiband operation On the other hand, the following enhancements of SS signaling using modern signal processing approaches will be highlighted in the presentation: i. The use of ANN for the design of Matched filters (NMF) for efficient code acquisition and in the design multi-user receivers for ii.","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123984813","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 New Public Key Signcrypted Challenge Response Identification (PKS-CR-ID) Protocol Using Smart Cards","authors":"H. Elkamchouchi, A. Emarah, E. Hagras","doi":"10.1109/ICCES.2006.320455","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320455","url":null,"abstract":"How to prove yourself? This is the problem. Secure civilian and military identification protocols are very important and useful cryptographic tool. In computer network security, the secure personal identification protocol is an interactive proof system; the prover and verifier exchange multiple messages in multi-passes typically dependent on random numbers which they keep secret. In military aircraft identification friend or foe (IFF) systems, the aircraft can identify itself to the ground station using two-pass challenge-response identification protocol in real time process to distinguish friendly from hostile aircraft. In this paper, a new public key signcrypted two-pass challenge response identification (PKS-CR-ID) protocol using smart card is proposed. The PKS-CR-ID scheme is based on the intractability of the discrete logarithm problem. Using the minimum security parameters recommended for use in current practice and comparing with the Schnorr and Okamoto identification schemes which are the most attractive practical identification schemes, the numerical results for the proposed scheme has a saving in communication overhead by about 56% over Schnorr and 65% over Okamoto identification schemes. The proposed scheme uses the advanced encryption standard algorithm which satisfies today's security, speed and memory requirements. PKS-CR-ID scheme has an efficient computation time due to the saving in communication overhead which satisfies the real time process and it is designed to resist the advanced identification attacks using random challenges and timestamps techniques","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124751843","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":"On the Effect of Tap Length on LMS Adaptive Echo Canceller Performance","authors":"N. Alwan","doi":"10.1109/ICCES.2006.320447","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320447","url":null,"abstract":"Simultaneous data transmission in both directions (full-duplex) over two-wired circuits can be achieved using two-wire to four-wire hybrid couplers. Transmission signal leakage through the near-end hybrid (near-end echo) and transmission signal reflection by the far-end hybrid (far-end echo) ending up in its own receiver due to imperfect hybrid isolation can greatly affect the correct detection of data from the other end. Adaptive echo cancellers are therefore used to nullify this effect using a finite impulse response (FIR) adaptive digital filter for which the number of coefficients must be quite large in order to cancel the far-end echo. In this paper, the data transmission system comprising the combined echo effect is simulated and an expression for the residual echo power is derived from which the relationship between adaptive echo canceller length and residual echo power can be deduced for a specified echo path. Apart from the uncancellable signal due to the far-end signal plus communication channel additive noise, the residual echo power is found to be made up of two components when the adaptive echo canceller length is smaller than that of the actual echo path. The first component represents another uncancellable signal resulting from the truncated terms in the echo path impulse response that are not modeled by the adaptive filter and therefore appear as additional error. The second component results from mismatch between the echo path impulse response and the adaptive canceller coefficients upon convergence due to using the least mean square (LMS) adaptation algorithm. This latter component is influenced by the LMS step size, the length of the adaptive filter and by both the afore-mentioned uncancellable signal powers. Simulation results were found to support the theoretical findings quite accurately. It is also found that, in general, when the tap length is reduced, the LMS step size can be more freely set for fast convergence with little perceptible increase in residual echo power","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131544055","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":"Extending the Application of Conditional Signal Adaptive Median Filter to Impulsive Noise","authors":"M. Hashem, A. Wahdan, A. Salem, T. Mostafa","doi":"10.1109/ICCES.2006.320474","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320474","url":null,"abstract":"In this paper, two major improvements are applied to the conditional signal adaptive median (CSAM) filter to accommodate for high density impulsive noise with significant dynamic range. Homogeneity level of a pixel gives a good estimate in separating noisy pixels from pixels belonging to an edge or a fine detail in an image, but the proper choice of a threshold of homogeneity is highly affected by the noise density and range. A more robust method is developed for choosing such a threshold than in the original CSAM filter which extends the application of the filter to impulsive noise not only salt and pepper noise. Results are also compared for both low and high density impulsive noise","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"6 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132324501","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":"Adaptive Surface Reconstruction from Non Uniform Point Sets","authors":"M. Abdel-Wahab, A. S. Hussein, M. Gaber","doi":"10.1109/ICCES.2006.320432","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320432","url":null,"abstract":"In this paper, a proposed algorithm for surface reconstruction from uniform or non-uniform point sets is introduced. The points are typically acquired with multiple range scans of any 3D object. The proposed algorithm follows the advancing front paradigm to build the reconstructed surface employing a variable radius moving ball that expands and shrinks continuously based on the sampling density. Starting with a user-specified initial radius, this initial ball may touch three points without containing any other point forming a seed triangle. For any edge, another point is found to form a ball with minimum radius generating another triangle. The process continues until generating all possible edges. The algorithm is theoretically proved under certain sampling criteria on the input data set. The proposed algorithm was applied on different datasets and compared favorably with the most eminent techniques. The key issues for comparisons were the reconstructed surface quality, the memory usage and the execution time. The present algorithm bested others in treating non uniform samples, samples with sharp edges and samples with small holes","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129661375","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":"Adaptive Control of Induction Motor Under Magnetic Saturation with Uncertain Rotor Resistance and Unknown Load Torque with Stator Currents and Fluxes Measurements","authors":"M. Ismail, H.A. Abdel Fattah, A. Bahgat","doi":"10.1109/ICCES.2006.320439","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320439","url":null,"abstract":"The problem of controlling the induction motor pi-model with magnetic saturation is considered. An adaptive controller is developed under the assumption of measurable stator fluxes but unknown rotor resistance, and load torque. All the unknown parameters are assumed slowly varying and are estimated online by the controller. Simulation results are provided for illustration","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070200","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":"Shading-Based Image Intrinsics: Derivation and Potential Applications","authors":"M. El-Melegy","doi":"10.1109/ICCES.2006.320457","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320457","url":null,"abstract":"Shape from shading (SFS) is a classic problem in computer vision, which aims to infer the shape of an object from its shading information in a single image. Since this problem is ill-posed, a number of assumptions have been used extensively in the computer vision community for the SFS problem, such as orthographic projection, Lambertian reflectance model, single light source, and constant surface albedo. In this paper, starting with this typical set of assumptions, we derive new image intrinsic values based on image shading information. We validated the obtained intrinsic values on hundreds of real and synthetic images. Furthermore, we study the effect of intensity and geometric non-linearities (e.g., gamma correction and lens distortion) on the derived image intrinsics. One important application of this study is the possibility of using the image intrinsics to undo some effects of these non-linearities or to correct input images in order to obtain better SFS results","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127204070","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 Dynamic Ranking Value Guided Scheduling Mechanism (RVGSM) for Mobile Grid","authors":"H. Ali, T. A. Farrag","doi":"10.1109/ICCES.2006.320476","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320476","url":null,"abstract":"Mobile computing is the new trend in the computing systems. The traditional computing systems don't consider the special criteria of the mobile resources (definitely connection stability). The originality of this paper is to investigate a dynamic scheduling mechanism which considers the mobile devices as resources. In the proposed mechanism assigning a given task to the available ranked resource is done dynamically by using two types of schedulers (dedicated and opportunistic). Improving the performance of these algorithms is achieved by using powerfully source evaluation algorithm, so the overall performance of the mobile computing environment will increase. In the proposed mechanism \"self ranking algorithm (SRA)\", which distributing some of the functions of the access point among the available attached mobile devices, is employed. The proposed mechanism is experimentally validated for the various distribution forms of the incoming jobs. Experimental results depict that, embedding of SRA within the proposed mechanism has a great impact in improving the system load balancing and increase the system throughput by reducing the required scheduling time","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116891223","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":"Software Quality in Ladder Programming","authors":"W. Gharieb","doi":"10.1109/ICCES.2006.320440","DOIUrl":"https://doi.org/10.1109/ICCES.2006.320440","url":null,"abstract":"This paper aims to measure the software quality for programmable logic controllers (PLCs) especially in ladder programming. The proposed quality metrics involve the criteria of simplicity, reconfigurability, reliability, and flexibility. A fuzzy inference algorithm is developed to select the best controller design among different ladder programs for the same application. A single tone membership function is used to represent the quality metric per each controller. The fitness of each controller is represented by the minimum value of all evaluated criteria. Thereafter, a min-max fuzzy inference is applied to take the decision (which controller is the best). The developed fuzzy assessment algorithm is applied to a conveyor belt module connected to a PLC to perform a repeated sequence. The decision making to select the best ladder program is obtained using the fuzzy assessment algorithm. The obtained results affirmed the potential of the proposed algorithm to assess the quality of the designed ladder programs","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121687192","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}