In VLSI Technology, Integration Density of memory requirements have reached in tera byte. The basic element to design any type of memory array is memory cell. To design a memory array, selective read and write memory cells are most important. The most promising application of single electronic devices is the Single Electron Memory cell. Here, we propose to design a memory cell using single electron transistor. The working depends upon the coulomb blockade phenomenon, in which electrons are tunneled one by one through the channel. Basic single electron cell are utilized throughout the work as electron trap. The hybrid electron trap memory is directly utilized to design a random access memory array. Information storage is due to the presence or absence of single electron at island. The paper gives a new dimension to make a different memory cell by using a hybrid multi island junction. The operation of proposed circuits are verified in Monte Carlo Simulator Tool SIMON2 (Simulation of nanoelectronics device) which is a simulator for single electron tunnel circuits and devices. The stability diagram is verified by the functioning of the circuits.
{"title":"Simulation and Analysis of Hybrid Ultra Dense Memory Cell by Using Single Electron Transistor","authors":"J. R. Chaudhari, D. Gautam","doi":"10.1109/ICESC.2014.62","DOIUrl":"https://doi.org/10.1109/ICESC.2014.62","url":null,"abstract":"In VLSI Technology, Integration Density of memory requirements have reached in tera byte. The basic element to design any type of memory array is memory cell. To design a memory array, selective read and write memory cells are most important. The most promising application of single electronic devices is the Single Electron Memory cell. Here, we propose to design a memory cell using single electron transistor. The working depends upon the coulomb blockade phenomenon, in which electrons are tunneled one by one through the channel. Basic single electron cell are utilized throughout the work as electron trap. The hybrid electron trap memory is directly utilized to design a random access memory array. Information storage is due to the presence or absence of single electron at island. The paper gives a new dimension to make a different memory cell by using a hybrid multi island junction. The operation of proposed circuits are verified in Monte Carlo Simulator Tool SIMON2 (Simulation of nanoelectronics device) which is a simulator for single electron tunnel circuits and devices. The stability diagram is verified by the functioning of the circuits.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125866727","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}
A. Patharkar, V. Khetade, S. Limaye, Ashish S. Bhopale, Akshay S. Patharkar
The many applications consist of multiple clock domains. There is data transfer between these clock domain systems. Due to different frequencies between sender and receiver there is data loss. Synchronizer is used for data synchronization. Synchronizer is having non-zero probability of failure in Globally Asynchronous Locally synchronous System on Chip. Synchronizer plays very crucial role in determining the reliability of system. The synchronizer is having parameters. These parameters associated with synchronizer are clock, data rate and timing window (setup and hold time). But in practice the synchronizer suffers from metastability as data changes in timing window due to which synchronizer failure occurs. As the metastability occurs we cannot predict the correct level of output. Metastability states are common in digital circuits, and synchronizers are must to protect their fatal effects. Originally, they were required when reading an asynchronous input. Now, with multiple clock domains on the same chip, synchronizers are required when on-chip data crosses the clock domain boundaries. The proposed architecture is modeled with verilog and simulated with Xilinx ISE design suit 13.1 and Quartus II 10.1. Analog behavior is studied by using Tanner 13.1. The probability of failure is analyzed and simulated. It has been found that it is affected by clock rate.
许多应用程序由多个时钟域组成。这些时钟域系统之间有数据传输。由于发送方和接收方之间的频率不同，存在数据丢失。同步器用于数据同步。在全局异步、局部同步的片上系统中，同步器具有非零失效概率。同步器对系统的可靠性起着至关重要的作用。同步器有参数。与同步器相关的参数有时钟、数据速率和定时窗口(设置和保持时间)。但在实际应用中，同步器存在亚稳态，即数据在定时窗口内发生变化，同步器失效。当亚稳态发生时，我们无法预测正确的输出水平。亚稳态在数字电路中很常见，必须采用同步器来保护其致命影响。最初，它们在读取异步输入时是必需的。现在，在同一芯片上有多个时钟域，当片上数据跨越时钟域边界时需要同步器。提出的架构用verilog建模，并用Xilinx ISE design suit 13.1和Quartus II 10.1进行仿真。使用Tanner 13.1研究模拟行为。对失效概率进行了分析和仿真。已经发现它受时钟速率的影响。
{"title":"Analysis of Synchronizer, Data Loss and Occurrence of Metastability","authors":"A. Patharkar, V. Khetade, S. Limaye, Ashish S. Bhopale, Akshay S. Patharkar","doi":"10.1109/ICESC.2014.77","DOIUrl":"https://doi.org/10.1109/ICESC.2014.77","url":null,"abstract":"The many applications consist of multiple clock domains. There is data transfer between these clock domain systems. Due to different frequencies between sender and receiver there is data loss. Synchronizer is used for data synchronization. Synchronizer is having non-zero probability of failure in Globally Asynchronous Locally synchronous System on Chip. Synchronizer plays very crucial role in determining the reliability of system. The synchronizer is having parameters. These parameters associated with synchronizer are clock, data rate and timing window (setup and hold time). But in practice the synchronizer suffers from metastability as data changes in timing window due to which synchronizer failure occurs. As the metastability occurs we cannot predict the correct level of output. Metastability states are common in digital circuits, and synchronizers are must to protect their fatal effects. Originally, they were required when reading an asynchronous input. Now, with multiple clock domains on the same chip, synchronizers are required when on-chip data crosses the clock domain boundaries. The proposed architecture is modeled with verilog and simulated with Xilinx ISE design suit 13.1 and Quartus II 10.1. Analog behavior is studied by using Tanner 13.1. The probability of failure is analyzed and simulated. It has been found that it is affected by clock rate.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127143588","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}
Dictionary based syntactic pattern recognition of strings attempts to extract a set of strings X+ from the dictionary H, by processing its noisy version string Y, without sequentially comparing Y with each element of X, the strings of H. H is the dictionary that contains a finite set of strings. The best estimate X+ from all X* in H, is defined as the set of string from X* that has least Levenshtein edit distance with the searched string Y. Existing techniques are there to search approximately from a dictionary. All strings compared with the searched string stored in dictionary the least distance string are the X+. Few techniques also there who use trie as data structure to store the words set of dictionary and uses some heuristic to prune some search space while finding the X+. Efficiency in search and retrieval depends upon the success in pruning out words from the computation while searching for an approximate match. In this paper, we store all the words of dictionary in a trie data structure. We propose heuristics that apply to every node of the trie. These heuristics help to prune the search current path at a node. Our method of pruning path while searching can save space in computation as compare to other method with correct approximation. We have tested our approach with different data sets with different noisy word and our method gave the correct X+, the approximate words set as result. The proposed approaches are compared with the existing approach. The first approach is giving 19.03% and second approach showing 29.35% eficiency compared to existing approach.
{"title":"An Improved Approach of Dictionary Based Syntactic PR Using Trie","authors":"Samita Pradhan, A. Negi","doi":"10.1109/ICESC.2014.76","DOIUrl":"https://doi.org/10.1109/ICESC.2014.76","url":null,"abstract":"Dictionary based syntactic pattern recognition of strings attempts to extract a set of strings X+ from the dictionary H, by processing its noisy version string Y, without sequentially comparing Y with each element of X, the strings of H. H is the dictionary that contains a finite set of strings. The best estimate X+ from all X* in H, is defined as the set of string from X* that has least Levenshtein edit distance with the searched string Y. Existing techniques are there to search approximately from a dictionary. All strings compared with the searched string stored in dictionary the least distance string are the X+. Few techniques also there who use trie as data structure to store the words set of dictionary and uses some heuristic to prune some search space while finding the X+. Efficiency in search and retrieval depends upon the success in pruning out words from the computation while searching for an approximate match. In this paper, we store all the words of dictionary in a trie data structure. We propose heuristics that apply to every node of the trie. These heuristics help to prune the search current path at a node. Our method of pruning path while searching can save space in computation as compare to other method with correct approximation. We have tested our approach with different data sets with different noisy word and our method gave the correct X+, the approximate words set as result. The proposed approaches are compared with the existing approach. The first approach is giving 19.03% and second approach showing 29.35% eficiency compared to existing approach.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122332170","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}
Nowadays there has been great increase in use of digital images as a part of information exchange and storage in various fields like medical, science, entertainment, education and research. Because of the huge collection of digital images in different areas there is a need for efficient and accurate classification and retrieval system for image. This paper presents an improved method for image texture classification and retrieval using gray level co-occurrence matrix (GLCM) and Self-organizing maps (SOM). The gray level cooccurrence matrix represents how often different combinations of pixel values or gray levels co-occur in an image. The texture information is extracted from image using gray level co-occurrence matrix and processed. This information is then given to the self organizing map for the classification. The proposed approach is tested on the KTH-TIPS database and the experimental results shows that the proposed method is more accurate, useful and effective in image retrieval.
{"title":"Classification of Texture Using Gray Level Co-occurrence Matrix and Self-Organizing Map","authors":"Vishal S. Thakare, N. Patil","doi":"10.1109/ICESC.2014.66","DOIUrl":"https://doi.org/10.1109/ICESC.2014.66","url":null,"abstract":"Nowadays there has been great increase in use of digital images as a part of information exchange and storage in various fields like medical, science, entertainment, education and research. Because of the huge collection of digital images in different areas there is a need for efficient and accurate classification and retrieval system for image. This paper presents an improved method for image texture classification and retrieval using gray level co-occurrence matrix (GLCM) and Self-organizing maps (SOM). The gray level cooccurrence matrix represents how often different combinations of pixel values or gray levels co-occur in an image. The texture information is extracted from image using gray level co-occurrence matrix and processed. This information is then given to the self organizing map for the classification. The proposed approach is tested on the KTH-TIPS database and the experimental results shows that the proposed method is more accurate, useful and effective in image retrieval.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127280302","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}
For wireless communication systems, the antenna is one of the most critical components for transmission as well as reception point of view. Good design of the antenna can relax system requirements and improve overall system performance. In addition to receiving or transmitting energy, an antenna in an advanced wireless system is usually required to optimize or accentuate the radiation energy in some directions and suppress it in others. Thus the antenna must also serve as a directional device in addition to a probing device. Many applications require radiation characteristics that may not be achievable by a single element. It may, however, be possible that an aggregate of radiating elements in an electrical and geometrical arrangement (an array) will result in the desired radiation characteristics [1]. The arrangement of the array may be such that the radiation from the elements adds up to give a radiation maximum in a particular direction or directions, minimum in others, or otherwise as desired. In this paper we concentrated on the electrical and geometrical properties of array elements that give a radiation maximum in a particular direction and minimum in others. We investigate the binomial and chebyshev distribution for linear and rectangular dielectric resonator antenna array.
{"title":"Investigation of Binomial and Chebyshev Distribution on Dielectric Resonator Antenna Array","authors":"N. Mishra, Soma Das","doi":"10.1109/ICESC.2014.74","DOIUrl":"https://doi.org/10.1109/ICESC.2014.74","url":null,"abstract":"For wireless communication systems, the antenna is one of the most critical components for transmission as well as reception point of view. Good design of the antenna can relax system requirements and improve overall system performance. In addition to receiving or transmitting energy, an antenna in an advanced wireless system is usually required to optimize or accentuate the radiation energy in some directions and suppress it in others. Thus the antenna must also serve as a directional device in addition to a probing device. Many applications require radiation characteristics that may not be achievable by a single element. It may, however, be possible that an aggregate of radiating elements in an electrical and geometrical arrangement (an array) will result in the desired radiation characteristics [1]. The arrangement of the array may be such that the radiation from the elements adds up to give a radiation maximum in a particular direction or directions, minimum in others, or otherwise as desired. In this paper we concentrated on the electrical and geometrical properties of array elements that give a radiation maximum in a particular direction and minimum in others. We investigate the binomial and chebyshev distribution for linear and rectangular dielectric resonator antenna array.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127433230","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}
Micro cantilever have got potential applications in every field of science ranging from physical and chemical sensing to biological disease diagnosis. The sensing action essentially is the deflection of the cantilever beam. The deflection depends upon the physical parameters of the cantilever such as width, length and thickness and it also strongly depends upon the material used. Device design and computational analysis for micro cantilever are addressed in detail in this paper. During the analysis and design it is important to consider readout method to be used for the detection. Measurement of nanometer range displacement in micro cantilever devices is challenging task. We have introduced new readout method and analysis is done for this method. The readout method will influence the design parameters for optimum readings. Three case studies have been considered for the analysis are temperature sensor, accelerometer and biosensor based on this readout method. Finally the micro cantilevers were fabricated and tested to verify the functionality of the proposed device.
{"title":"Design and Development of Microcantilever Based Detector","authors":"J. Kalambe, R. Patrikar","doi":"10.1109/ICESC.2014.64","DOIUrl":"https://doi.org/10.1109/ICESC.2014.64","url":null,"abstract":"Micro cantilever have got potential applications in every field of science ranging from physical and chemical sensing to biological disease diagnosis. The sensing action essentially is the deflection of the cantilever beam. The deflection depends upon the physical parameters of the cantilever such as width, length and thickness and it also strongly depends upon the material used. Device design and computational analysis for micro cantilever are addressed in detail in this paper. During the analysis and design it is important to consider readout method to be used for the detection. Measurement of nanometer range displacement in micro cantilever devices is challenging task. We have introduced new readout method and analysis is done for this method. The readout method will influence the design parameters for optimum readings. Three case studies have been considered for the analysis are temperature sensor, accelerometer and biosensor based on this readout method. Finally the micro cantilevers were fabricated and tested to verify the functionality of the proposed device.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645245","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}
Thinning is one of the most important preprocessing steps in the character recognition. But this process has certain limitations like low speed and deformation. To eliminate this problem, skeletonization is used, where the character to be recognized is skeletonized. This paper describes how characters are recognized by skeletonization algorithm which is trained by neural network. Here for better understanding and experimentation, we are considering categories of decorative characters. Here, we are using an algorithm based on neural network, which determines the representative points and connections making up the skeleton by combining AVGSOM non-supervised learning. The proposed method has been applied in images with different characters and their rotations along with scaling. The results obtained are compared to existing stored database, showing quite encouraging results with more than 90% recognition efficiency. Finally, some conclusions, together with some future scopes are presented.
{"title":"Dynamic and Competitive Skeletonization for Recognition of Decorative Characters","authors":"P. Pandit, S. Akojwar, S. Chavan","doi":"10.1109/ICESC.2014.75","DOIUrl":"https://doi.org/10.1109/ICESC.2014.75","url":null,"abstract":"Thinning is one of the most important preprocessing steps in the character recognition. But this process has certain limitations like low speed and deformation. To eliminate this problem, skeletonization is used, where the character to be recognized is skeletonized. This paper describes how characters are recognized by skeletonization algorithm which is trained by neural network. Here for better understanding and experimentation, we are considering categories of decorative characters. Here, we are using an algorithm based on neural network, which determines the representative points and connections making up the skeleton by combining AVGSOM non-supervised learning. The proposed method has been applied in images with different characters and their rotations along with scaling. The results obtained are compared to existing stored database, showing quite encouraging results with more than 90% recognition efficiency. Finally, some conclusions, together with some future scopes are presented.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133530660","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}
Most practical methods of the speech recognition (SR) are dependent on the feature extraction schemes used in the implementation. The performances of these SR systems are highly affected by the presence of noise. By passing speech signal through cochlear filter bank (CFB) prior to the feature extraction reduces the impact of the noise on the system. In this paper, noise robust approach of feature extraction, cochlear filter bank with zero crossing as a feature is discussed. The comparative analysis of CFB with Mel frequency Cepstral Coefficients (MFCC) approach of feature extraction in terms of recognition accuracy (RA) is discussed. It may be implied that former approach gave a good fit to the experimentation in presence of noise.
{"title":"Noise Robust Novel Approach to Speech Recognition","authors":"Swapnil D. Daphal, S. Jagtap","doi":"10.1109/ICESC.2014.55","DOIUrl":"https://doi.org/10.1109/ICESC.2014.55","url":null,"abstract":"Most practical methods of the speech recognition (SR) are dependent on the feature extraction schemes used in the implementation. The performances of these SR systems are highly affected by the presence of noise. By passing speech signal through cochlear filter bank (CFB) prior to the feature extraction reduces the impact of the noise on the system. In this paper, noise robust approach of feature extraction, cochlear filter bank with zero crossing as a feature is discussed. The comparative analysis of CFB with Mel frequency Cepstral Coefficients (MFCC) approach of feature extraction in terms of recognition accuracy (RA) is discussed. It may be implied that former approach gave a good fit to the experimentation in presence of noise.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131403754","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}
In the current scenario, wireless sensor network (WSN) is used in substantial number of applications. Mobile WSN (MWSN) is preferred over static WSN in many applications especially in mobile object tracking and trapping system. Coverage is strongly related to object trapping as it is easier to trap an object in fully covered area compare to partially covered area. MWSN becomes default selection when it comes to trap a mobile object in a partially covered area because mobility of sensor nodes can be utilized to enhance the coverage of the network and thus able to detect and trap target. One of the fundamental problems of MWSN is how to coordinate these mobile sensors in such a way that they can move together in order to achieve their common goal. In this paper, we present a game theory inspired mobile object trapping system (GT-MOTS) where mobile nodes form a coalition such that they trap a mobile object by exchanging some key information between themselves. Through this information exchange movement of one sensor influence the movements of its neighbours. The objective of the proposed scheme is to minimize the trapping time by reducing travel distance of each sensor node. The concept of cooperative game theory is used for coalition and concept of pursuer evasion game is used for mobile target trapping. The effectiveness of the proposed approach is evaluated and compared with random way-point mobility model (RWP) and three other variants of RWP using NS-3 simulation.
{"title":"Game Theory Inspired Mobile Object Trapping System in Mobile Wireless Sensor Network","authors":"Tathagata Das, Sarbani Roy","doi":"10.1109/ICESC.2014.47","DOIUrl":"https://doi.org/10.1109/ICESC.2014.47","url":null,"abstract":"In the current scenario, wireless sensor network (WSN) is used in substantial number of applications. Mobile WSN (MWSN) is preferred over static WSN in many applications especially in mobile object tracking and trapping system. Coverage is strongly related to object trapping as it is easier to trap an object in fully covered area compare to partially covered area. MWSN becomes default selection when it comes to trap a mobile object in a partially covered area because mobility of sensor nodes can be utilized to enhance the coverage of the network and thus able to detect and trap target. One of the fundamental problems of MWSN is how to coordinate these mobile sensors in such a way that they can move together in order to achieve their common goal. In this paper, we present a game theory inspired mobile object trapping system (GT-MOTS) where mobile nodes form a coalition such that they trap a mobile object by exchanging some key information between themselves. Through this information exchange movement of one sensor influence the movements of its neighbours. The objective of the proposed scheme is to minimize the trapping time by reducing travel distance of each sensor node. The concept of cooperative game theory is used for coalition and concept of pursuer evasion game is used for mobile target trapping. The effectiveness of the proposed approach is evaluated and compared with random way-point mobility model (RWP) and three other variants of RWP using NS-3 simulation.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569249","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}
The paper discusses the literature survey of RTOS (Real Time Operating Systems) and its contributions to the embedded world. RTOS is defined as a system in which the correctness of the system does not depend only on the logical results of computation but also on the time at which the results are produced. It has to perform critical tasks on priority basis keeping the context switching time minimum. It is often associated with few misconceptions & we have tried to throw some light on it. Since last 20 years, RTOS is undergoing continuous evolution and has resulted into development of many commercial RTOS products. We have selected few commercial RTOS of different categories of real-time applications and have discussed its real-time features. A comparison of the commercial RTOSs' is presented. We conclude by discussing the results of the survey and comparing the RTOS based on performance parameters.
{"title":"The Survey of Real Time Operating System: RTOS","authors":"Prasanna Hambarde, Rachit Varma, Shivani Jha","doi":"10.1109/ICESC.2014.15","DOIUrl":"https://doi.org/10.1109/ICESC.2014.15","url":null,"abstract":"The paper discusses the literature survey of RTOS (Real Time Operating Systems) and its contributions to the embedded world. RTOS is defined as a system in which the correctness of the system does not depend only on the logical results of computation but also on the time at which the results are produced. It has to perform critical tasks on priority basis keeping the context switching time minimum. It is often associated with few misconceptions & we have tried to throw some light on it. Since last 20 years, RTOS is undergoing continuous evolution and has resulted into development of many commercial RTOS products. We have selected few commercial RTOS of different categories of real-time applications and have discussed its real-time features. A comparison of the commercial RTOSs' is presented. We conclude by discussing the results of the survey and comparing the RTOS based on performance parameters.","PeriodicalId":335267,"journal":{"name":"2014 International Conference on Electronic Systems, Signal Processing and Computing Technologies","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124246067","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：