Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

85 results for “Computational Complexity”
Set a search alert
Research ArticleOpen accessIn the abstractPeak to Average Power Ratio Reduction of Orthogonal Frequency Division Multiplexing System with a Significant Low ComplexityMahamod Ismail, J. S. Mandeep, Montadar Abas Taher, M. T. IslamThe Orthogonal Frequency Division Multiplexing (OFDM) has been widely used in many applications in the last decade. It provides good benefits compared to the single carrier systems. However, it has a bad property represented by the high-output Peak to Average Power Ratio (PAPR) which is considered as its major problem. There are many techniques to reduce the PAPR values such … …American Journal of Applied Sciences, Vol. 9, Issue 12 · 20 Dec 2012 · 6,589 accessesView PDFCite
Research ArticleOpen accessIn the abstractPerformance Evaluation of Multicrypt Encryption MechanismRhymend Uthariaraj Vaidyanathan, Lydia Elizabeth Benjamin, John Prakash ArockiasamyMulticast communication allows a single message packet to be routed to multiple nodes simultaneously. Membership in a multicast group is dynamic, allowing nodes to enter and leave the multicast session. Besides the benefits, multicast communication presents the challenge of securing the communication. In order to preserve confidentiality the general encryption mechanism used for point to point communications are used. A … …American Journal of Applied Sciences, Vol. 9, Issue 11 · 4 Sep 2012 · 7,168 accessesView PDFCite
Research ArticleOpen accessIn the abstractDevelopment of a New Elliptic Curve Cryptosystem with Factoring ProblemE. S. Ismail, M. S. HijaziProblem statement: The security of elliptic curve cryptosystems are based on elliptic curve discrete logarithm problem (ECDLP). However, if an attacker finds a solution to ECDLP, the elliptic curve-based systems will no longer be secure. Approach: To improve this, we develop a new elliptic curve cryptosystem using one of the old/novel problem in computational number theory; factoring problem (FAC). Specifically, … …American Journal of Applied Sciences, Vol. 9, Issue 9 · 2 Aug 2012 · 6,788 accessesView PDFCite
Research ArticleOpen accessIn the abstractComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,868 accessesView PDFCite
Research ArticleOpen accessIn the abstractDesign and Analysis of Adders using Nanotechnology Based Quantum dot Cellular AutomataS. Karthigai Lakshmi, G. AthishaProblem statement: The area and complexity are the major issues in circuit design. Here, we propose different types of adder designs based on Quantum dot Cellular Automata (QCA) that reduces number of QCA cells and area compare to previous designs. The quantum dot cellular automata is a novel computing paradigm in nanotechnology that can implement digital circuits with faster speed, … …Journal of Computer Science, Vol. 7, Issue 7 · 30 Jun 2011 · 7,311 accessesView PDFCite
Research ArticleOpen accessIn the abstractHardware Implementation of a Genetic Algorithm Based Canonical Singed Digit Multiplierless Fast Fourier Transform Processor for Multiband Orthogonal Frequency Division Multiplexing Ultra Wideband ApplicationsMahmud Benhamid, Masuri B. OthmanProblem statement: Ultra Wide Band (UWB) technology has attracted many researchers' attention due to its advantages and its great potential for future applications. The physical layer standard of Multi-band Orthogonal Frequency Division Multiplexing (MB-OFDM) UWB system is defined by ECMA International. In this standard, the data sampling rate from the analog-to-digital converter to the physical layer is up to 528 … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 7,515 accessesView PDFCite
Research ArticleOpen accessIn the abstractEfficient Detection Algorithm for a Multiple-Input and Multiple-Output Multiuser Multi-Carrier Code Division Multiple Access in Time-Varying ChannelsFares Sayadi, Mahamod Ismail, Norbahiah Misran et al.Problem statement: Maximum Likelihood (ML) decoding has been applied for the uplink of a Multi-Carrier Code Division Multiple Access (MC-CDMA) system based on Orthogonal Frequency Division Multiplexing (OFDM). Multiple-Input Multiple-Output (MIMO) channel from k users, which moves at vehicular speed, to the Base-Station (BS) is time-varying. For time-varying channels, Sphere Decoding (SD) was introduced to perform ML decoding. Whereas, computational … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 7,576 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Low Complexity Lossless Coding Algorithm for Medical ImagesS. E. Ghrare, M.A. Mohd. Ali, K. Jumari, M. IsmailProblem statement: Nowadays a large number of various medical images are generated from hospitals and medical centers with sophisticated image acquisition devices, the movement toward digital images in radiology presents the problem of how to conveniently and economically store, retrieve and transmit the volume of digital images. Thus digital image data compression is necessary in order to solve this problem. … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,091 accessesView PDFCite
Research ArticleOpen accessIn the abstractImprovement of the Simplified Fast Transversal Filter Type Algorithm for Adaptive FilteringMadjid Arezki, Ahmed Benallal, Daoud BerkaniProblem statement: In this study, we proposed a new algorithm M-SMFTF for adaptive filtering with fast convergence and low complexity. Approach: It was the result of a simplified FTF type algorithm, where the adaptation gain was obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. Results: The computational complexity was reduced … …Journal of Computer Science, Vol. 5, Issue 5 · 31 May 2009 · 7,700 accessesView PDFCite
Research ArticleOpen accessIn the abstractGenetic Algorithm Based Probabilistic Motif Discovery in Unaligned Biological SequencesM. Hemalatha, K. VivekanandanFinding motif in biosequences is the most important primitive operation in computational biology. There are many computational requirements for a motif discovery algorithm such as computer memory space requirement and computational complexity. To overcome the complexity of motif discovery, we propose an alternative solution integrating genetic algorithm and Fuzzy Art machine learning approaches for eliminating multiple sequence alignment process. Problem … …Journal of Computer Science, Vol. 4, Issue 8 · 31 Aug 2008 · 6,729 accessesView PDFCite