i-manager's Journal on Electronics Engineering (JELE)


Volume 4 Issue 1 September - November 2013

Article

Performance Comparison of Carbon Nanotube, Graphene Nano Ribon and Silicon Nanowire Transistors

S. B. Siddique* , T. M. Faruqi**, B.C. Sarkar***, Mahmudul Hasan****
*, **, *** Electronics and Electrical Engineering.
****Assistant Professor, Electronics and Communication Engineering, University of Information Technology and Sciences, Dhaka 1212, Bangladesh.
Siddique, S.B., Faruqi, T. M., Sarkar, B.C., and Hasan, M. (2013). Performance Comparison Of Carbon Nanotube, Graphene Nano Ribon And Silicon Nanowire Transistors. i-manager’s Journal on Electronics Engineering, 4(1), 1-10. https://doi.org/10.26634/jele.4.1.2508

Abstract

Graphene Nanoribbons(GNR) and Carbon Nanotubes(CNT) represent a novel class of low-dimensional materials. These Graphene based nanostructures are used in wide range of nanoscience and nanotechnology applications. In this article, the performance potential of ballistic Graphene and Silicon Nanowire(SiNW) field effect transistors are examined for future high-performance applications. A thorough investigation has been made to realize the performance of these three types of transistors in terms of drain current, transconductance, number of mobile charge, quantum capacitance, gate capacitance, gate delay and cut off frequency using ballistic top of the barrier model. On-current, transconductance and gate capacitance control the switching speed of a transistor. It is shown that, the on-current in carbon based channel is higher as well as ION/IOFF is higher than SiNW channel due to lower effective mass. Higher on-current indicates sharper slope in current curve which ensures higher transconductance. It is also shown that the density of states(DOS) of CNT and GNR transistors are lower than the SiNW transistor. Through extensive computer simulation it is shown that the Graphene transistors can be the candidates for future digital switches. It is also important that SiNW transistors in are potentially attractive, given the central role of silicon in the semiconductor industry and the existing set of known fabrication technologies.

Research Paper

Binary Morphology With Image Compression And Cryptography

Ponshankar B* , Swaranambigai R.**
* ME (Applied Electronics), Jay shriram group of institutions, Anna University, Coimbatore
** Assistant Professor (ECE), Jay shriram group of institutions, Anna University, Coimbatore
Ponshankar, B., and Swaranambigai, R. (2013). Binary Morphology with Image Compression and Cryptography. i-manager’s Journal on Electronics Engineering, 4(1), 11-17. https://doi.org/10.26634/jele.4.1.2509

Abstract

Binary Image processing is extremely useful in various areas, such as object recognition, tracking, motion detection, machine intelligence, image analysis, understanding video processing, computer vision, and identification and authentication systems. Binary image processing (BIP) has been commonly implemented using processors such as CPU or DSP. However, it is inefficient and difficult to use such processors for binary image processing. High-speed implementation of binary image processing operations can be efficiently realized by using chips specialized for binary image processing. Mathematical morphology(MM) is a nonlinear image processing framework used to manipulate or analyze the shape of functions or objects. Mathematical morphology(MM) is set theory-based methods of image analysis and plays an important role in many digital image processing algorithms and applications, e.g., noise filtering, object extraction, analysis or pattern recognition. The methods, originally developed for binary images, were soon extended and now apply to many different image representations. Real-time image processing systems have constraints on speed or hardware resources. In addition, in embedded or mobile applications, this system consumes low power and low memory. The cryptography involves efficient algorithms related to encryption and decryption.

Research Paper

Performance Analysis of Low-Density Parity-Check Codes for M-QAM Systems

Hirald Dwaraka Praveena* , 0**, N. Padmaja***
* Asst. Professor, Dept of ECE, Sree Vidyanikethan Engineering College, Tirupati.
** Professor, Dept of ECE, Sree Vidyanikethan Engineering College, Tirupati.
Praveena, K.D., Subhas, C., and Padmaja, N. (2013). Performance Analysis of Low-Density Parity-Check Codes for M-Qam Systems. i-manager’s Journal on Electronics Engineering, 4(1), 18-23. https://doi.org/10.26634/jele.4.1.2511

Abstract

Low-Density Parity-Check codes are state-of-art error detecting and correcting codes, include several standards of broadcast transmissions. Iterative message passing decoding algorithms for LDPC codes have excellent error correction capability. Low computational complexity combined with parallelism and good error correcting performance are the reasons of choosing LDPC codes. The reliability of received data depends on the channel and external noise that could interfere with the signal. Error correcting codes (ECCs) are used to detect and correct errors thereby increasing the system throughput, speed and reducing power consumption. Error detection and correction is achieved by adding redundant symbols to the original data. Modern telecommunication standards adopt higher order modulation schemes, such as M-QAM to achieve large spectral efficiency. In this paper it is shown that the LDPC codes are the best choice in complex environment compared to turbo codes.

Research Paper

A Survey Of New Reconfigurable Architectures For Implementing FIR Filters With Low Complexity

V. Sandhiya* , S. Karthick**, M. Valarmathy***
* Second year PG scholar, Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode-638401,Tamilnadu, INDIA.
** Assistant professor, Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode-638401,Tamilnadu, INDIA
*** Professor and Head, Department of Electronics and Communication Engineering, Bannari Amman Institute of Technology, Sathyamangalam, Erode-638401,Tamilnadu, INDIA
Sandhiya, V., Karthick, S., and Valarmathy, M. (2013). A Survey Of New Reconfigurable Architectures For Implementing FIR Filters With Low Complexity. i-manager’s Journal on Electronics Engineering, 4(1), 29-39. https://doi.org/10.26634/jele.4.1.2513

Abstract

Finite Impulse Response (FIR) filters are widely used in multistandard wireless communications. The two key requirements of FIR filters are reconfigurabilty and low complexity. The researches have been introduced many architectures for above key metrics. For reconfigurable FIR filter, two architectures was implemented, namely Constant Shift Method [CSM] and Programmable Shift Method [PSM]. The complexity of linear phase FIR filters is dominated by the number of adders (subtractors) in the coefficient multiplier. The Common Subexpression Elimination (CSE) algorithm was introduced for reducing the number of adders in the multipliers and also dynamically reconfigurable filters can be efficiently implemented based on Canonic Signed Digit (CSD) representation of coefficients. It is well known that the two classes of Common Subexpression Elimination techniques(vertical and horizontal) minimize the two main cost metrics namely logic operators and logic in realizing finite impulse response (FIR) filters. A new CSE algorithm using binary representation of coefficients was introduced for the implementation of higher order FIR filters with a fewer number of adders than CSD-based CSE methods. A new greedy CSE algorithm based on CSD representation of coefficients multipliers was introduced for implementing low complexity higher order filters. Design examples shows that the filter architectures offer power reduction and good area and speed improvement over the existing FIR implementation.

Research Paper

A 3 GHz 2V Analog PLL at 0.18um CMOS Technology

N. K. Kaphungkui* **

Abstract

This paper has been withdrawn due to dual submission and publication.