Pub Date : 1900-01-01DOI: 10.1109/EDCAV.2015.7060554
Aheibam Dinamani Singh, Suparna Goswami
The outage and average symbol error rate of a single channel system are analyzed over two-wave diffused power (TWDP) fading channels. An expression of characteristic function and outage probability of signal-to-noise ratio (SNR) for TWDP fading channel have been derived. Probability distribution function based approach has been followed to derive expressions of average symbol error rate for different coherent and noncoherent M-ary modulation schemes. Effects of the types of modulation and the fading parameters K and A on the system performance have been studied. The results obtained are verified with the special case results available in literature and by Monte Carlo simulation.
{"title":"Performance of digital modulations over TWDP fading channel","authors":"Aheibam Dinamani Singh, Suparna Goswami","doi":"10.1109/EDCAV.2015.7060554","DOIUrl":"https://doi.org/10.1109/EDCAV.2015.7060554","url":null,"abstract":"The outage and average symbol error rate of a single channel system are analyzed over two-wave diffused power (TWDP) fading channels. An expression of characteristic function and outage probability of signal-to-noise ratio (SNR) for TWDP fading channel have been derived. Probability distribution function based approach has been followed to derive expressions of average symbol error rate for different coherent and noncoherent M-ary modulation schemes. Effects of the types of modulation and the fading parameters K and A on the system performance have been studied. The results obtained are verified with the special case results available in literature and by Monte Carlo simulation.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116125829","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 : 1900-01-01DOI: 10.1109/EDCAV.2015.7060551
Pyreddy Mary Arpita, K. Datta, R. Vemula, I. Sengupta
The paper presents an approach for optimizing a reversible netlist consisting of multiple-control Toffoli (MCT) gates with the objective of reducing quantum cost. The MCT gates are first decomposed into smaller gates with up to three control lines, and then a template matching method is applied on the netlist for optimization. The templates are constructed by considering all possible 3-gate sequences with up to four lines. This work constitutes an extension of a previous work by Dueck et al., where 2-gate sequences were considered in the templates. The input gate netlists are generated from the reversible benchmarks available in RevLib, followed by Barenco decomposition to produce Toffoli gates with at most three control connections. The proposed approach is applied on these netlists, and the final quantum cost calculated. Experimental results on standard benchmarks show that the method can lead to reductions in quantum cost.
{"title":"Optimization of reversible circuits using triple-gate templates at quantum gate level","authors":"Pyreddy Mary Arpita, K. Datta, R. Vemula, I. Sengupta","doi":"10.1109/EDCAV.2015.7060551","DOIUrl":"https://doi.org/10.1109/EDCAV.2015.7060551","url":null,"abstract":"The paper presents an approach for optimizing a reversible netlist consisting of multiple-control Toffoli (MCT) gates with the objective of reducing quantum cost. The MCT gates are first decomposed into smaller gates with up to three control lines, and then a template matching method is applied on the netlist for optimization. The templates are constructed by considering all possible 3-gate sequences with up to four lines. This work constitutes an extension of a previous work by Dueck et al., where 2-gate sequences were considered in the templates. The input gate netlists are generated from the reversible benchmarks available in RevLib, followed by Barenco decomposition to produce Toffoli gates with at most three control connections. The proposed approach is applied on these netlists, and the final quantum cost calculated. Experimental results on standard benchmarks show that the method can lead to reductions in quantum cost.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122997088","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 : 1900-01-01DOI: 10.1109/EDCAV.2015.7060548
Abhijeet Dutta, Rusni Kima Mangang
With the increase in signal's bandwidth, the conventional analog to digital converters (ADCs), operating on the basis of Shannon/Nyquist theorem, are forced to work at very high rates leading to low dynamic range and high power consumptions. This paper here tells about one Analog to Information converter developed based on compressive sensing techniques. The high sampling rates, which is the main drawback for ADCs, is being successfully reduced to 4 times lower than the conventional rates. The system is also accompanied with the advantage of low power dissipation.
{"title":"Analog to information converter based on random demodulation","authors":"Abhijeet Dutta, Rusni Kima Mangang","doi":"10.1109/EDCAV.2015.7060548","DOIUrl":"https://doi.org/10.1109/EDCAV.2015.7060548","url":null,"abstract":"With the increase in signal's bandwidth, the conventional analog to digital converters (ADCs), operating on the basis of Shannon/Nyquist theorem, are forced to work at very high rates leading to low dynamic range and high power consumptions. This paper here tells about one Analog to Information converter developed based on compressive sensing techniques. The high sampling rates, which is the main drawback for ADCs, is being successfully reduced to 4 times lower than the conventional rates. The system is also accompanied with the advantage of low power dissipation.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132708420","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 : 1900-01-01DOI: 10.1109/EDCAV.2015.7060553
K. V. Rangarao
In this paper we present a new technique for demodulating any Shift Keying(aSK) under sampled signal xk using an Orthogonal Decomposer. In this method we generate a phase matching signal xy. Present techniques for demodulation of any Shift Keying signal either require the knowledge of the carrier frequency or need to estimate them. The proposed method aims at detecting phase rate at the boundaries of phase change using xk, with no knowledge of carrier frequency. A sampled version of aSK signal is passed through an Orthogonal Decomposer that estimates and adjusts the phase of the incoming signal and generating a new signal xk phase shifted by π/2, The signal xk is again phase shifted by π/2 resulting xy. Phase transitions are detected using signal ek = xk - xk, for demodulating the aSK signal. This method is a novel way of demodulation focusing on the phase transitions. This will set a new trend in aSK demodulation and leading to a unified technique, spanning ASK, OOKS, BFSK and BPSK with no prior knowledge about the type of modulation.
{"title":"Unified demodulation of any shift keying by phase matching technique","authors":"K. V. Rangarao","doi":"10.1109/EDCAV.2015.7060553","DOIUrl":"https://doi.org/10.1109/EDCAV.2015.7060553","url":null,"abstract":"In this paper we present a new technique for demodulating any Shift Keying(aSK) under sampled signal xk using an Orthogonal Decomposer. In this method we generate a phase matching signal xy. Present techniques for demodulation of any Shift Keying signal either require the knowledge of the carrier frequency or need to estimate them. The proposed method aims at detecting phase rate at the boundaries of phase change using xk, with no knowledge of carrier frequency. A sampled version of aSK signal is passed through an Orthogonal Decomposer that estimates and adjusts the phase of the incoming signal and generating a new signal xk phase shifted by π/2, The signal xk is again phase shifted by π/2 resulting xy. Phase transitions are detected using signal ek = xk - xk, for demodulating the aSK signal. This method is a novel way of demodulation focusing on the phase transitions. This will set a new trend in aSK demodulation and leading to a unified technique, spanning ASK, OOKS, BFSK and BPSK with no prior knowledge about the type of modulation.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908296","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 : 1900-01-01DOI: 10.1109/EDCAV.2015.7060538
Kuntala Boruah, J. C. Dutta
This paper describes the development of molecular computing in an historical setting. Based on the idea that basic biochemical property of deoxyribonucleic acid (DNA) molecule can be employed to solve Nondeterministic Polynomial Time (NP) problem, several remarkable models and algorithms are proposed for solving complex combinatorial problems. The development is not limited to that; it extends up to the implementation of molecular Boolean Circuits for realization of biological computer. It is concluded that in the past 20 years the DNA research and development made progress on regular base, but the practical line is still lacking behind. The research work in this field is expected to be good in next few decades.
{"title":"Twenty years of DNA computing: From complex combinatorial problems to the Boolean circuits","authors":"Kuntala Boruah, J. C. Dutta","doi":"10.1109/EDCAV.2015.7060538","DOIUrl":"https://doi.org/10.1109/EDCAV.2015.7060538","url":null,"abstract":"This paper describes the development of molecular computing in an historical setting. Based on the idea that basic biochemical property of deoxyribonucleic acid (DNA) molecule can be employed to solve Nondeterministic Polynomial Time (NP) problem, several remarkable models and algorithms are proposed for solving complex combinatorial problems. The development is not limited to that; it extends up to the implementation of molecular Boolean Circuits for realization of biological computer. It is concluded that in the past 20 years the DNA research and development made progress on regular base, but the practical line is still lacking behind. The research work in this field is expected to be good in next few decades.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"392 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127591362","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
扫码关注我们
求助内容：
应助结果提醒方式：