Workfunction engineering approach is utilized to design structure of variable vertical doped superjunction vertical single diffused MOS. To induce hole and electron plasma instead of n+ region, we have employed platinum and hafnium electrode respectively. Inclusion of these metals as contact, leads to the elimination of aluminum metal. Computational analysis reveal that proposed structure offer improvement in performance parameters such as specific ON-resistance and gate charge. Simulation results depict 6.82 % reduction in Ron. A and approximately 50 nC of gate charge reduction with negligible fall in breakdown voltage.
{"title":"Design and performance projection of workfunction engineered variable vertical doped superjunction vertical single diffused MOS","authors":"Payal Nautiyal, Onika Parmar, Alok Naugarhiya, Shrish Verma","doi":"10.1109/CONECCT.2018.8482361","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482361","url":null,"abstract":"Workfunction engineering approach is utilized to design structure of variable vertical doped superjunction vertical single diffused MOS. To induce hole and electron plasma instead of n+ region, we have employed platinum and hafnium electrode respectively. Inclusion of these metals as contact, leads to the elimination of aluminum metal. Computational analysis reveal that proposed structure offer improvement in performance parameters such as specific ON-resistance and gate charge. Simulation results depict 6.82 % reduction in Ron. A and approximately 50 nC of gate charge reduction with negligible fall in breakdown voltage.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125552645","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482364
M. S. Roy, Jyotsna L. Bapat
In a multi-device multi-resource IoT environment,many interrupts occur which can be serviced by different resources in the same environment. Broadcasting such interrupt service requests to all of the available resources may result in unnecessary clutter in the service handling queues. This will result in increased service handling delays for the IoT system and affect existing service handling of the resources. Thus, there is a need for monitoring spatio-temporal states of the available resources such that service request broadcast is avoided and focused requests are directed to only most suitable set of resources. We propose a novel service handling system that is power efficient and privacy aware. This system is expected to improve service handling and delegation by tracking various spatio-temporal attributes of the resources.
{"title":"Resource Engagement and Response Pattern Inference Model to Improve Service Handling Delegation System in IoT Environment","authors":"M. S. Roy, Jyotsna L. Bapat","doi":"10.1109/CONECCT.2018.8482364","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482364","url":null,"abstract":"In a multi-device multi-resource IoT environment,many interrupts occur which can be serviced by different resources in the same environment. Broadcasting such interrupt service requests to all of the available resources may result in unnecessary clutter in the service handling queues. This will result in increased service handling delays for the IoT system and affect existing service handling of the resources. Thus, there is a need for monitoring spatio-temporal states of the available resources such that service request broadcast is avoided and focused requests are directed to only most suitable set of resources. We propose a novel service handling system that is power efficient and privacy aware. This system is expected to improve service handling and delegation by tracking various spatio-temporal attributes of the resources.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"120 7-8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121012787","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482395
K. Mulani, Harish Kumar, M. Gaurav, S. Sumam David
Recently, reconstruction of the entire DNA sequence from optically labeled genomes has been explored. In this paper, we present details of a novel algorithm for this genome assembly. We elucidate the design methodology and results for a multi-core CPU (1.98x speedup) and FPGA (7.022x speedup) implementation to accelerate the computations.
{"title":"Hardware Acceleration of Optically Labeled Human Genome Sequencing using a Novel Algorithm","authors":"K. Mulani, Harish Kumar, M. Gaurav, S. Sumam David","doi":"10.1109/CONECCT.2018.8482395","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482395","url":null,"abstract":"Recently, reconstruction of the entire DNA sequence from optically labeled genomes has been explored. In this paper, we present details of a novel algorithm for this genome assembly. We elucidate the design methodology and results for a multi-core CPU (1.98x speedup) and FPGA (7.022x speedup) implementation to accelerate the computations.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127790056","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482373
Amit Gurung, and Rajarshi Ray
Visualization of the state-space computed by statespace exploration tools for continuous and hybrid systems, is necessary for a better comprehension of the system dynamics. Tools like SpaceEx and XSpeed compute the state-space as a collection of polytopes. The visualization of the statespace, therefore requires an efficient algorithm for (1) Planar projection of high-dimensional polytopes and (2) Enumerating the vertices of the projection for plotting. In this paper, we propose a novel algorithm to compute a planar projection of a H-represented polytope. The proposed algorithm computes the projected polytope in V-representation and therefore can be readily visualized with plotting utilities. It is based on the support function representation of a polytope and Hough transforms. We believe that this work gives a new perspective of looking at the computation of planar projections, using classical results on Hough transforms in the domain of Computer Graphics. The limitation of the algorithm is that it incurs an approximation error, although the error can be measured and bounded. We show empirically that the performance of our algorithm is significantly better in comparison to known efficient algorithms of projection and enumeration, and therefore is viable when a limited approximation error is permissible.
{"title":"Planar Projection of Polytopes using Hough Transforms","authors":"Amit Gurung, and Rajarshi Ray","doi":"10.1109/CONECCT.2018.8482373","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482373","url":null,"abstract":"Visualization of the state-space computed by statespace exploration tools for continuous and hybrid systems, is necessary for a better comprehension of the system dynamics. Tools like SpaceEx and XSpeed compute the state-space as a collection of polytopes. The visualization of the statespace, therefore requires an efficient algorithm for (1) Planar projection of high-dimensional polytopes and (2) Enumerating the vertices of the projection for plotting. In this paper, we propose a novel algorithm to compute a planar projection of a H-represented polytope. The proposed algorithm computes the projected polytope in V-representation and therefore can be readily visualized with plotting utilities. It is based on the support function representation of a polytope and Hough transforms. We believe that this work gives a new perspective of looking at the computation of planar projections, using classical results on Hough transforms in the domain of Computer Graphics. The limitation of the algorithm is that it incurs an approximation error, although the error can be measured and bounded. We show empirically that the performance of our algorithm is significantly better in comparison to known efficient algorithms of projection and enumeration, and therefore is viable when a limited approximation error is permissible.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461323","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482362
Sarthak Jain, S. Pal, B. Sainath
Energy is required for transmission of data over a wireless channel. This energy can be obtained using fixed batteries or via harvesting energy. In this paper, we optimize the energy distribution to minimize the overall distortion in a wireless network. The network model has energy harvesting nodes which transmit data in a time division multiple access (TDMA) scheme. First, we establish a relation between allocated energy and normalized minimum distortion by assuming a fixed battery system. We then use this relation to optimize the energy distribution to minimize overall distortion in an energy harvesting system. Following that, we incorporate path loss in our model and simulate the system to decide the optimum order of quadrature amplitude modulation (QAM), given a bit error rate threshold. This work not only models efficient usage of harvested energy but also ensures optimal utilization of the available bandwidth, while minimizing overall distortion.
{"title":"Optimizing the Order of Modulation for Minimized Distortion in Green Communication Networks","authors":"Sarthak Jain, S. Pal, B. Sainath","doi":"10.1109/CONECCT.2018.8482362","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482362","url":null,"abstract":"Energy is required for transmission of data over a wireless channel. This energy can be obtained using fixed batteries or via harvesting energy. In this paper, we optimize the energy distribution to minimize the overall distortion in a wireless network. The network model has energy harvesting nodes which transmit data in a time division multiple access (TDMA) scheme. First, we establish a relation between allocated energy and normalized minimum distortion by assuming a fixed battery system. We then use this relation to optimize the energy distribution to minimize overall distortion in an energy harvesting system. Following that, we incorporate path loss in our model and simulate the system to decide the optimum order of quadrature amplitude modulation (QAM), given a bit error rate threshold. This work not only models efficient usage of harvested energy but also ensures optimal utilization of the available bandwidth, while minimizing overall distortion.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130975860","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482387
Sridharan Natarajan, Debarata Das
Network overload due to rampant increase in multimedia data consumption in LTE is the major cause of concern for telecom operators. To overcome the above said issue, operators are employing content caching in the LTE core network nodes like GW or in the access network nodes like eNodeB or a separate caching servers in the access or core networks and implementing efficient content distribution methods such as evolved multimedia broadcast and multicast service (eMBMS). To efficiently use the above methods, operators need to identify the right content and right location among the network of cached servers for caching. In this paper, we propose a novel idea for choosing the right content to cache based on the popularity rank calculated using the MooD (MBMS operation on Demand) framework. Furthermore, we proposed two new distribution architecture for the cached content in the LTE network based on the current demand estimation for the content. Our results reveal that, there are significant savings achieved in terms of reduced processing cost in the LTE network nodes and less latency from the proposed method against the existing concepts of non-caching standard architecture. We achieved around 27% improvement in latency and bandwidth from the proposed methods when the request for the content follows Zipfian type of distribution.
由于LTE的多媒体数据使用量剧增而导致的网络过载，是电信运营商们担忧的主要问题。为了克服上述问题，运营商正在LTE核心网节点(如GW)或接入网节点(如eNodeB)或接入网或核心网中的单独缓存服务器中采用内容缓存，并实施高效的内容分发方法，如演进的多媒体广播和多播服务(eMBMS)。为了有效地使用上述方法，操作人员需要在缓存服务器网络中确定正确的内容和正确的位置以进行缓存。在本文中，我们提出了一种基于MooD (MBMS operation on Demand)框架计算的流行度排名来选择正确的内容进行缓存的新思路。在此基础上，基于当前LTE网络对缓存内容的需求估计，提出了两种新的LTE网络缓存内容分布架构。我们的研究结果表明，相对于现有的非缓存标准架构概念，所提出的方法在降低LTE网络节点的处理成本和减少延迟方面取得了显著的节省。当对内容的请求遵循Zipfian类型的分发时，我们在延迟和带宽方面实现了27%的改进。
{"title":"Demand Aware Edge Caching Architecture for evolved Multimedia Broadcast Multicast Service to Reduce Latency and bandwidth Savings","authors":"Sridharan Natarajan, Debarata Das","doi":"10.1109/CONECCT.2018.8482387","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482387","url":null,"abstract":"Network overload due to rampant increase in multimedia data consumption in LTE is the major cause of concern for telecom operators. To overcome the above said issue, operators are employing content caching in the LTE core network nodes like GW or in the access network nodes like eNodeB or a separate caching servers in the access or core networks and implementing efficient content distribution methods such as evolved multimedia broadcast and multicast service (eMBMS). To efficiently use the above methods, operators need to identify the right content and right location among the network of cached servers for caching. In this paper, we propose a novel idea for choosing the right content to cache based on the popularity rank calculated using the MooD (MBMS operation on Demand) framework. Furthermore, we proposed two new distribution architecture for the cached content in the LTE network based on the current demand estimation for the content. Our results reveal that, there are significant savings achieved in terms of reduced processing cost in the LTE network nodes and less latency from the proposed method against the existing concepts of non-caching standard architecture. We achieved around 27% improvement in latency and bandwidth from the proposed methods when the request for the content follows Zipfian type of distribution.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288282","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482386
Khyamling Parane, P. M, and Basavaraj Talawar
In this paper, we present fast and param- eterized FPGA based Network-on-Chip (NoC) simu- lation acceleration framework with automated HDL generation engine. The framework supports the NoC architecture design parameters such as topology, rout- ing algorithms, link width, buffer size, flow control and traffic patterns. The parameterized, high perfor- mance and lightweight nature of proposed NoC based framework makes the ideal choice for NoC research studies. The Mesh based topologies have been con- sidered for the experimentation purpose. A congestion aware adaptive routing has been proposed along with the conventional XY routing. Also, parameters such as buffer depth, traffic pattern and flit width have been varied to observe the effect on the NoC behavior. The adaptive routing algorithm for Mesh based topologies has negligible FPGA area overhead compared to the conventional XY routing. Employing the adaptive routing algorithm, the average packet latency is reduced by 55{% under transpose traffic pattern when compared to the XY routing algorithm. The speedup of 2548x has been observed compared to Booksim software simulator. The proposed framework is 2.54x and 25x times faster compared to CONNECT and DART FPGA based simulators respectively.
{"title":"FPGA based NoC Simulation Acceleration Framework Supporting Adaptive Routing","authors":"Khyamling Parane, P. M, and Basavaraj Talawar","doi":"10.1109/CONECCT.2018.8482386","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482386","url":null,"abstract":"In this paper, we present fast and param- eterized FPGA based Network-on-Chip (NoC) simu- lation acceleration framework with automated HDL generation engine. The framework supports the NoC architecture design parameters such as topology, rout- ing algorithms, link width, buffer size, flow control and traffic patterns. The parameterized, high perfor- mance and lightweight nature of proposed NoC based framework makes the ideal choice for NoC research studies. The Mesh based topologies have been con- sidered for the experimentation purpose. A congestion aware adaptive routing has been proposed along with the conventional XY routing. Also, parameters such as buffer depth, traffic pattern and flit width have been varied to observe the effect on the NoC behavior. The adaptive routing algorithm for Mesh based topologies has negligible FPGA area overhead compared to the conventional XY routing. Employing the adaptive routing algorithm, the average packet latency is reduced by 55{% under transpose traffic pattern when compared to the XY routing algorithm. The speedup of 2548x has been observed compared to Booksim software simulator. The proposed framework is 2.54x and 25x times faster compared to CONNECT and DART FPGA based simulators respectively.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131854643","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482377
Kavin Kumar Thangadorai, K. Murugesan, Vimal Bastin Edwin Joseph, D. Das
Mesh topology is becoming popular in Wireless Local Area Network (WLAN) with Wi-FiTM. IEEE 802.11s is a well-known standard of Wi-Fi mesh networking. As we know, Mesh Access Points (APs) will be connected to each other in a Mesh topology and one of the Mesh APs will act as a Root Aps which will be connected to the Internet. IEEE 802.11 legacy client devices such as Mobile Phone, TV, and Laptop will be connected to any one of these Mesh Aps. Since legacy client devices could transfer or receive sensitive user data, security becomes an important area to address in the Wi-Fi mesh network. As per 802.11s standard, each Mesh AP link will be secured by either applying Simultaneous Authentication of Equals (SAE) or 802. 1X based authentication and encryption scheme. On the other hand, legacy client devices have to undergo either 802.1X or Pre-Shared Key (PSK) based security scheme with the Mesh AP. On a further note, when a packet arrives to Mesh AP entry from the legacy client has to be re-encrypted (decrypted and encrypted) by Mesh APs in each mesh hop until it reaches the Root AP to provide a secure communication, which is a redundant. This will add overhead in each mesh hop such as increase in mesh APs processing time and energy consumption. Various studies and proposals are made to further improve the link level security, but not for avoiding this redundant re-encryption in each mesh hops. To the best of our knowledge this paper for the first time proposes a new concept to overcome redundant re-encryption in each mesh hop by sharing the legacy client devices Pairwise Transient Key (PTK) to all the mesh APs in a secured mesh control plane. Our analytical and simulation results with this proposed concept reveals that the total processing time is improved around 20% and significant reduction in energy consumption in comparison to the existing system.
{"title":"A Novel Process to Avoid Redundant Encryption and Decryption in Wi-Fi Mesh Network","authors":"Kavin Kumar Thangadorai, K. Murugesan, Vimal Bastin Edwin Joseph, D. Das","doi":"10.1109/CONECCT.2018.8482377","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482377","url":null,"abstract":"Mesh topology is becoming popular in Wireless Local Area Network (WLAN) with Wi-FiTM. IEEE 802.11s is a well-known standard of Wi-Fi mesh networking. As we know, Mesh Access Points (APs) will be connected to each other in a Mesh topology and one of the Mesh APs will act as a Root Aps which will be connected to the Internet. IEEE 802.11 legacy client devices such as Mobile Phone, TV, and Laptop will be connected to any one of these Mesh Aps. Since legacy client devices could transfer or receive sensitive user data, security becomes an important area to address in the Wi-Fi mesh network. As per 802.11s standard, each Mesh AP link will be secured by either applying Simultaneous Authentication of Equals (SAE) or 802. 1X based authentication and encryption scheme. On the other hand, legacy client devices have to undergo either 802.1X or Pre-Shared Key (PSK) based security scheme with the Mesh AP. On a further note, when a packet arrives to Mesh AP entry from the legacy client has to be re-encrypted (decrypted and encrypted) by Mesh APs in each mesh hop until it reaches the Root AP to provide a secure communication, which is a redundant. This will add overhead in each mesh hop such as increase in mesh APs processing time and energy consumption. Various studies and proposals are made to further improve the link level security, but not for avoiding this redundant re-encryption in each mesh hops. To the best of our knowledge this paper for the first time proposes a new concept to overcome redundant re-encryption in each mesh hop by sharing the legacy client devices Pairwise Transient Key (PTK) to all the mesh APs in a secured mesh control plane. Our analytical and simulation results with this proposed concept reveals that the total processing time is improved around 20% and significant reduction in energy consumption in comparison to the existing system.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115445637","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482388
Mutum Bidyarani Devi, R. Devanathan
With the launching of many earth’s observation satellites, the amount of data capturing the Earth’s surface has been increasing to a great extent. In this paper, we emphasize the need for analyzing the satellite image data particularly in the context of data fusion applied to data taken from sensors of different resolution. The problem lies in maintaining the spectral characteristics of the multispectral images when panchromatic image is used to estimate the high spatial multispectral image. We take a wholesome approach based on the reflectance data irrespective of the sensor physics. The approach aims to produce an enhanced spatial resolution multispectral image having the same resolution as that of the panchromatic data while still preserving the spectral characteristics of the multispectral image. Using a linear regression model between multispectral and panchromatic data, an optimal solution in terms of Lagrange multiplier is provided and validated to maximize the spectral consistency of the fused image. The chi-square test is used to check the “goodness of fitd” of the data. The experimental results are discussed and presented using IKONOS satellite data.
{"title":"Pansharpening Using Data Driven Model Based on Linear Regression","authors":"Mutum Bidyarani Devi, R. Devanathan","doi":"10.1109/CONECCT.2018.8482388","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482388","url":null,"abstract":"With the launching of many earth’s observation satellites, the amount of data capturing the Earth’s surface has been increasing to a great extent. In this paper, we emphasize the need for analyzing the satellite image data particularly in the context of data fusion applied to data taken from sensors of different resolution. The problem lies in maintaining the spectral characteristics of the multispectral images when panchromatic image is used to estimate the high spatial multispectral image. We take a wholesome approach based on the reflectance data irrespective of the sensor physics. The approach aims to produce an enhanced spatial resolution multispectral image having the same resolution as that of the panchromatic data while still preserving the spectral characteristics of the multispectral image. Using a linear regression model between multispectral and panchromatic data, an optimal solution in terms of Lagrange multiplier is provided and validated to maximize the spectral consistency of the fused image. The chi-square test is used to check the “goodness of fitd” of the data. The experimental results are discussed and presented using IKONOS satellite data.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115864792","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}
Pub Date : 2018-03-01DOI: 10.1109/CONECCT.2018.8482390
A. Sarje, M. Peckerar
The ubiquitous flicker or 1/f noise deteriorates low-frequency (LF) signals. For high reliability in CMOS devices, factors leading to degradation of SNR in LF domain need to be understood and minimized, especially for devices processing low-frequency signals. With transistors scaling down, power consumption decreasing and advancement in system integration, portable integrated CMOS sensors are being used in labs, hospitals, space applications etc. In such field applications, continuous radiation exposure degrades the sensors as well as deteriorates the signal to noise ratio. Also, in certain applications, continuous operation of sensors with high voltage stress on transistors causes hot electron injection (HEI) which also deteriorates the SNR by increasing the trap density in the gate oxide and making the sensor unreliable over time. To address the issue of SNR deterioration and to understand the reliability aspects of the sensors due to such operational stresses, we present a study of the impact of γ$textbf{radiation exposure and hot electron injection on flicker noise of CMOS transistors. While flicker noise has been characterized in other processes, we chose the commonly available, low cost 0.5 um CMOS process for our study.
无处不在的闪烁或1/f噪声使低频(LF)信号恶化。为了提高CMOS器件的可靠性，需要了解并最小化导致低频域信噪比下降的因素，特别是对于处理低频信号的器件。随着晶体管的缩小、功耗的降低和系统集成的进步，便携式集成CMOS传感器正在实验室、医院、空间应用等领域得到应用。在这样的现场应用中，持续的辐射暴露会降低传感器的性能，也会降低信噪比。此外，在某些应用中，在晶体管上具有高电压应力的传感器的连续操作会导致热电子注入(HEI)，这也会通过增加栅极氧化物中的陷阱密度而恶化信噪比，并使传感器随着时间的推移而不可靠。为了解决信噪比下降的问题，并了解由于这种工作应力导致传感器可靠性方面的问题，我们研究了γ辐射暴露和热电子注入对CMOS晶体管闪烁噪声的影响。虽然闪烁噪声在其他工艺中也有表征，但我们选择了常用的低成本0.5 um CMOS工艺进行研究。
{"title":"Effect of Radiation & HEI on Flicker noise in 0.5 μm CMOS transistor","authors":"A. Sarje, M. Peckerar","doi":"10.1109/CONECCT.2018.8482390","DOIUrl":"https://doi.org/10.1109/CONECCT.2018.8482390","url":null,"abstract":"The ubiquitous flicker or 1/f noise deteriorates low-frequency (LF) signals. For high reliability in CMOS devices, factors leading to degradation of SNR in LF domain need to be understood and minimized, especially for devices processing low-frequency signals. With transistors scaling down, power consumption decreasing and advancement in system integration, portable integrated CMOS sensors are being used in labs, hospitals, space applications etc. In such field applications, continuous radiation exposure degrades the sensors as well as deteriorates the signal to noise ratio. Also, in certain applications, continuous operation of sensors with high voltage stress on transistors causes hot electron injection (HEI) which also deteriorates the SNR by increasing the trap density in the gate oxide and making the sensor unreliable over time. To address the issue of SNR deterioration and to understand the reliability aspects of the sensors due to such operational stresses, we present a study of the impact of γ$textbf{radiation exposure and hot electron injection on flicker noise of CMOS transistors. While flicker noise has been characterized in other processes, we chose the commonly available, low cost 0.5 um CMOS process for our study.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"32 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125710261","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
扫码关注我们
求助内容：
应助结果提醒方式：