Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850311
Y. Abdelmalek, T. Saadawi
In this paper, we propose Destination-Assisted Routing Enhancement (DARE) module as a generic add-on middleware to mobile ad-hoc networks (MANETs) routing protocols. The goal of DARE is to assist the routing protocol to establish a path between the source and destination quickly with high reachability probability by generating destination beacon packets, while considering the dynamic characteristic of MANET and the need for low routing control overhead. These beacon packets act like trail packets to aid in finding the destination. A simplified mathematical model as a proof of concept is presented. We prove that the probability of finding the path between the source and destination using DARE outperforms the same probability using the traditional routing technique. The simulation results show the potential of adding DARE middleware to DSR protocol; for an instance of on-demand ad-hoc routing protocols, to achieve higher network performance in terms of throughput, route discovery time, and connection setup probability. A route discovery time was reported to be 20% less than the original DSR in mobile ad-hoc nodes with minimum overhead.
{"title":"Destination-Assisted Routing Enhancement (DARE) protocol for ad-hoc mobile networks","authors":"Y. Abdelmalek, T. Saadawi","doi":"10.1109/SARNOF.2009.4850311","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850311","url":null,"abstract":"In this paper, we propose Destination-Assisted Routing Enhancement (DARE) module as a generic add-on middleware to mobile ad-hoc networks (MANETs) routing protocols. The goal of DARE is to assist the routing protocol to establish a path between the source and destination quickly with high reachability probability by generating destination beacon packets, while considering the dynamic characteristic of MANET and the need for low routing control overhead. These beacon packets act like trail packets to aid in finding the destination. A simplified mathematical model as a proof of concept is presented. We prove that the probability of finding the path between the source and destination using DARE outperforms the same probability using the traditional routing technique. The simulation results show the potential of adding DARE middleware to DSR protocol; for an instance of on-demand ad-hoc routing protocols, to achieve higher network performance in terms of throughput, route discovery time, and connection setup probability. A route discovery time was reported to be 20% less than the original DSR in mobile ad-hoc nodes with minimum overhead.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115527045","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850294
B. Mennenga, G. Fettweis
Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.
{"title":"Search sequence determination for tree search based detection algorithms","authors":"B. Mennenga, G. Fettweis","doi":"10.1109/SARNOF.2009.4850294","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850294","url":null,"abstract":"Tree search based detection algorithms provide a promising approach to solve the detection problems in MIMO systems. Depth-first, Breadth-first or Metric-first search strategies provide near max-log detection at reduced but still significant complexity. In this paper we show how the incurred complexity can be reduced substantially. In order to reduce the number of metric calculations to a minimum, we propose a novel relative determination of search sequences for QAM constellations, usable inexpensively independent of the underlying constellation size and search strategy and moreover also usable for soft-in soft-out detection. Based on its application to a sphere detector, we will demonstrate the impact on complexity and performance of the detection as well as on the detector structure. Building on the results, we propose refinements of the resulting detector providing a very good performance at minimized complexity, making the resulting detector particularly favorable for implementation.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580130","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850327
Ming-Wei Liu, J. Doherty
We propose an algorithm based on the knowledge of training sequences to obtain an asymptotically unbiased estimator of the Radio Frequency (RF) front-end nonlinearity to perform Specific Emitter Identification (SEI). In most SEI literature Inter Symbol Interference (ISI) is seldom considered; however, it is a major limiting factor in SEI systems and should be suppressed to achieve reliable identification. In this paper we develop a nonlinearity estimator that can overcome ISI and provide reliable estimation. The method is shown to achieve nonlinearity estimation and radio emitter identification over an empirical indoor channel model using an Orthogonal Frequency Division Multiplexing (OFDM) system.
{"title":"Nonlinearity estimation for Specific Emitter Identification in multipath environment","authors":"Ming-Wei Liu, J. Doherty","doi":"10.1109/SARNOF.2009.4850327","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850327","url":null,"abstract":"We propose an algorithm based on the knowledge of training sequences to obtain an asymptotically unbiased estimator of the Radio Frequency (RF) front-end nonlinearity to perform Specific Emitter Identification (SEI). In most SEI literature Inter Symbol Interference (ISI) is seldom considered; however, it is a major limiting factor in SEI systems and should be suppressed to achieve reliable identification. In this paper we develop a nonlinearity estimator that can overcome ISI and provide reliable estimation. The method is shown to achieve nonlinearity estimation and radio emitter identification over an empirical indoor channel model using an Orthogonal Frequency Division Multiplexing (OFDM) system.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752783","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850359
Mahmoud S. El-Saadany, A. Shalash, M. Abdallah
Orthogonal frequency division multiplexing (OFDM) is widely used in wireless communication systems, and it is a candidate for Cognitive Radios (CR). Shaping the spectrum of OFDM-based CR is needed to reduce the out-of-band radiations and reduce the interference delivered to the licensed user (LU). In this paper, shaping the spectrum using windowing and active cancellation carriers is discussed. It is shown that the use of windowing alone for large band is a better choice. The window choice in case of large number of subcarriers spanned by a LU is investigated and it is shown that the Hanning window outperforms the raised cosine window by 7dB. Computational complexity analysis is introduced and it shows a huge advantage by using windowing alone for large frequency bands and multiple bands vis-à-vis cancellation carriers. Simulations show that such technique offers no effect on the bit error rate performance.
{"title":"Revisiting active cancellation carriers for shaping the spectrum of OFDM-based Cognitive Radios","authors":"Mahmoud S. El-Saadany, A. Shalash, M. Abdallah","doi":"10.1109/SARNOF.2009.4850359","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850359","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is widely used in wireless communication systems, and it is a candidate for Cognitive Radios (CR). Shaping the spectrum of OFDM-based CR is needed to reduce the out-of-band radiations and reduce the interference delivered to the licensed user (LU). In this paper, shaping the spectrum using windowing and active cancellation carriers is discussed. It is shown that the use of windowing alone for large band is a better choice. The window choice in case of large number of subcarriers spanned by a LU is investigated and it is shown that the Hanning window outperforms the raised cosine window by 7dB. Computational complexity analysis is introduced and it shows a huge advantage by using windowing alone for large frequency bands and multiple bands vis-à-vis cancellation carriers. Simulations show that such technique offers no effect on the bit error rate performance.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123939351","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850371
Maria Fresia, Ozgun Y. Bursalioglu, G. Caire, H. Poor
In this paper, the multicasting of digitally encoded images on a heterogeneous network is considered. In order to obtain analytically tractable problems, the wavelet transform coefficients of a digital image are modeled as a set of parallel Gaussian sources. Also, a general network transport mechanism subject to packet losses is modeled as an erasure broadcast channel where users are affected by possibly very different erasure probabilities. In the proposed setting, the convex nature of the rate distortion function allows relevant optimization problems corresponding to various performance criteria to be solved. The solutions of these optimization problems serve as starting points for the design of source-channel codes based on embedded scalar quantization, on linear rateless encoders that map directly the (redundant) bits generated by the quantizer into channel symbols, and on progressive transmission of the encoded symbols organized into “layers”, such that users with higher capacity achieve better end-to-end distortion. At the decoders, iterative belief propagation decoding, multi-stage sequential decoding of the layers and soft-bit reconstruction are used. Numerical experiment sshow that 1) the proposed model is sufficiently accurate to provide system design guidelines for the case of real-life images, and 2) the proposed coding scheme achieves ratedistortion performance very close to the theoretical optimum.
{"title":"Multicasting of digital images over erasure broadcast channels using rateless codes","authors":"Maria Fresia, Ozgun Y. Bursalioglu, G. Caire, H. Poor","doi":"10.1109/SARNOF.2009.4850371","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850371","url":null,"abstract":"In this paper, the multicasting of digitally encoded images on a heterogeneous network is considered. In order to obtain analytically tractable problems, the wavelet transform coefficients of a digital image are modeled as a set of parallel Gaussian sources. Also, a general network transport mechanism subject to packet losses is modeled as an erasure broadcast channel where users are affected by possibly very different erasure probabilities. In the proposed setting, the convex nature of the rate distortion function allows relevant optimization problems corresponding to various performance criteria to be solved. The solutions of these optimization problems serve as starting points for the design of source-channel codes based on embedded scalar quantization, on linear rateless encoders that map directly the (redundant) bits generated by the quantizer into channel symbols, and on progressive transmission of the encoded symbols organized into “layers”, such that users with higher capacity achieve better end-to-end distortion. At the decoders, iterative belief propagation decoding, multi-stage sequential decoding of the layers and soft-bit reconstruction are used. Numerical experiment sshow that 1) the proposed model is sufficiently accurate to provide system design guidelines for the case of real-life images, and 2) the proposed coding scheme achieves ratedistortion performance very close to the theoretical optimum.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124647624","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850301
N. Vlajic, D. Stevanovic
The use of sink mobility in wireless sensor networks (WSN) is commonly recognized as one of the most effective means of load balancing, ultimately leading to fewer failed nodes and longer network lifetime.
{"title":"Sink mobility in wireless sensor networks: When theory meets reality","authors":"N. Vlajic, D. Stevanovic","doi":"10.1109/SARNOF.2009.4850301","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850301","url":null,"abstract":"The use of sink mobility in wireless sensor networks (WSN) is commonly recognized as one of the most effective means of load balancing, ultimately leading to fewer failed nodes and longer network lifetime.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083961","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850331
S. Hussain, Y. Louét
Software Radio (SWR) system being a combination of different standards, where each standard consisting of multi-carrier signals makes SWR signal extremely power fluctuating which results in high Peak to Average Power Ratio (PAPR). OFDM and SWR signals due to their multi-carrier nature inherit the same PAPR distribution characteristics and this fact makes it possible to employ already developed OFDM PAPR reduction techniques to SWR signals. Several techniques have been devised to reduce the PAPR of the OFDM signal. One of these PAPR reduction techniques is based on Peak Reducing Carriers (PRC) concept where a set of subcarriers is employed to reduce the temporal signal's peak. This paper employs PRC method for SWR signal PAPR reduction. A SWR base station would transmit a multiplex of standards signal where each standard having its own transmitting power requirements different from the other standards present in the SWR signal. An initial study is done for a bi-standard SWR system to see the variations in PAPR reduction gain with the variations in transmit power gap between the standards. Then PRC method is employed to reduce PAPR of a bi-standard SWR system containing standards with transmit power gap of 25 dB. PAPR is not only reduced by using in-band unused carriers of the standards as peak reducing carriers but also some inter-standard out-of-band (OOB) carriers are also used to reduce PAPR. The PAPR reduction performance by inband and OOB peak reducing carriers is compared. Also the effect of variation in mean power of OOB peak reducing carriers on PAPR reduction performance is discussed.
{"title":"PAPR reduction of Software Radio signals using PRC method","authors":"S. Hussain, Y. Louét","doi":"10.1109/SARNOF.2009.4850331","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850331","url":null,"abstract":"Software Radio (SWR) system being a combination of different standards, where each standard consisting of multi-carrier signals makes SWR signal extremely power fluctuating which results in high Peak to Average Power Ratio (PAPR). OFDM and SWR signals due to their multi-carrier nature inherit the same PAPR distribution characteristics and this fact makes it possible to employ already developed OFDM PAPR reduction techniques to SWR signals. Several techniques have been devised to reduce the PAPR of the OFDM signal. One of these PAPR reduction techniques is based on Peak Reducing Carriers (PRC) concept where a set of subcarriers is employed to reduce the temporal signal's peak. This paper employs PRC method for SWR signal PAPR reduction. A SWR base station would transmit a multiplex of standards signal where each standard having its own transmitting power requirements different from the other standards present in the SWR signal. An initial study is done for a bi-standard SWR system to see the variations in PAPR reduction gain with the variations in transmit power gap between the standards. Then PRC method is employed to reduce PAPR of a bi-standard SWR system containing standards with transmit power gap of 25 dB. PAPR is not only reduced by using in-band unused carriers of the standards as peak reducing carriers but also some inter-standard out-of-band (OOB) carriers are also used to reduce PAPR. The PAPR reduction performance by inband and OOB peak reducing carriers is compared. Also the effect of variation in mean power of OOB peak reducing carriers on PAPR reduction performance is discussed.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125653317","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850312
Shatnawi Heba, Gami Hiren, M. Qasaymeh, Tayem Nizar, M. E. Sawan, R. Pendse
Joint Time Delay and Frequency Estimation (JTDFE) problem of complex sinusoidal signals received at two separated sensors is an attractive problem that has been studied for many engineering applications. In this paper, the Rank-Revealing QR factorization is applied to the real data matrix obtained via the unitary transformation of the square Toeplitz complex data matrix. Then the MUSIC spectrum estimation function is used to estimate the frequencies. The time delay is estimated by applying RRQR to the complex data matrix. The unitary transformation from complex to real would reduce the processing time of frequency estimation by almost a factor of four, since the cost of complex manipulations is four times the real manipulations. Also RRQR is an important tool in numerical linear algebra because it provides accurate information about rank and numerical null space. The simulation results validate the performance of the proposed method.
{"title":"High resolution Joint Time Delay and Frequency Estimation","authors":"Shatnawi Heba, Gami Hiren, M. Qasaymeh, Tayem Nizar, M. E. Sawan, R. Pendse","doi":"10.1109/SARNOF.2009.4850312","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850312","url":null,"abstract":"Joint Time Delay and Frequency Estimation (JTDFE) problem of complex sinusoidal signals received at two separated sensors is an attractive problem that has been studied for many engineering applications. In this paper, the Rank-Revealing QR factorization is applied to the real data matrix obtained via the unitary transformation of the square Toeplitz complex data matrix. Then the MUSIC spectrum estimation function is used to estimate the frequencies. The time delay is estimated by applying RRQR to the complex data matrix. The unitary transformation from complex to real would reduce the processing time of frequency estimation by almost a factor of four, since the cost of complex manipulations is four times the real manipulations. Also RRQR is an important tool in numerical linear algebra because it provides accurate information about rank and numerical null space. The simulation results validate the performance of the proposed method.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122527825","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850361
Shweta Jain, A. Saleem, Hongbo Liu, Yanyong Zhang, D. Raychaudhuri
Cache-and-Forward (CNF) is a future Internet architecture designed for content delivery to mobile users over wireless networks with varying link quality and intermittent connectivity. The CNF protocol is based on strict hop-by-hop transport of media files with in-network storage at each router or wireless access point. The protocol also incorporates content caching capabilities for efficient delivery of popular media files. In this paper, we briefly describe the CNF architecture, present a survey of prior work, and describe new CNF link and routing protocols. Throughput results comparing CNF with TCP/IP are summarized for an example wide-area Internet scenario with wireless access networks. The design of a reliable CNF link layer protocol is discussed and performance results are given for multihop wireless scenarios. The paper concludes with an outline of dynamic CNF routing algorithms which consider both short-term and long-term path quality along with available in-network storage.
{"title":"Design of link and routing protocols for Cache-and-Forward networks","authors":"Shweta Jain, A. Saleem, Hongbo Liu, Yanyong Zhang, D. Raychaudhuri","doi":"10.1109/SARNOF.2009.4850361","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850361","url":null,"abstract":"Cache-and-Forward (CNF) is a future Internet architecture designed for content delivery to mobile users over wireless networks with varying link quality and intermittent connectivity. The CNF protocol is based on strict hop-by-hop transport of media files with in-network storage at each router or wireless access point. The protocol also incorporates content caching capabilities for efficient delivery of popular media files. In this paper, we briefly describe the CNF architecture, present a survey of prior work, and describe new CNF link and routing protocols. Throughput results comparing CNF with TCP/IP are summarized for an example wide-area Internet scenario with wireless access networks. The design of a reliable CNF link layer protocol is discussed and performance results are given for multihop wireless scenarios. The paper concludes with an outline of dynamic CNF routing algorithms which consider both short-term and long-term path quality along with available in-network storage.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743118","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 : 2009-03-30DOI: 10.1109/SARNOF.2009.4850285
Stanley S. K. Ho, C. Saavedra
A novel CMOS frequency doubler circuit is presented in this paper. A common source transistor pair biased at threshold is used to rectify the input signal in both the positive and negative cycles. The rectified signals are then subtracted to generate a double frequency signal. Measurement results show that there is more than 20 dB fundamental rejection with the input power level ranging from −20 dBm to −10.3 dBm. The 3rd and 4th harmonic rejections are above 20 dB with input power up to −10 dBm without any on-chip or off-chip filtering.
{"title":"Frequency doubler employing active fundamental cancellation in CMOS","authors":"Stanley S. K. Ho, C. Saavedra","doi":"10.1109/SARNOF.2009.4850285","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850285","url":null,"abstract":"A novel CMOS frequency doubler circuit is presented in this paper. A common source transistor pair biased at threshold is used to rectify the input signal in both the positive and negative cycles. The rectified signals are then subtracted to generate a double frequency signal. Measurement results show that there is more than 20 dB fundamental rejection with the input power level ranging from −20 dBm to −10.3 dBm. The 3rd and 4th harmonic rejections are above 20 dB with input power up to −10 dBm without any on-chip or off-chip filtering.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129177615","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
扫码关注我们
求助内容：
应助结果提醒方式：