Pub Date : 2017-11-01DOI: 10.1109/ISPACS.2017.8266550
Hiroyuki Tsuchiya, Yuki Watanabe, Koken Chin, H. San, T. Matsuura, M. Hotta
This paper presents a 14-bit, 400ksps pipeline cyclic analog-to-digital converter (ADC) in 90nm CMOS technology. Each stage is a non-binary cyclic ADC based on ß-expansion and the proposed ADC is designed in 3-stage pipeline structure. 16-bit non-binary output code of 3-stage is selected as 4-4-8 bits according to the considerations of total power consumption and conversion speed of the ADC. We also proposed a radix-value estimation technique for multi-stage non-binary ADC to realize the high linearity of this pipeline cyclic ADC. The SPICE simulation results demonstrate the feasibility and validity of the proposed ADC architecture and radix-value estimation algorithm. Simulated ENOB=14.25-bit is achieved while Fs = 400kSPS. The power consumption of proposed ADC is 10.59mW while the supply voltage is 3.0V.
{"title":"The design of a 14-bit 400kSPS non-binary pipeline cyclic ADC","authors":"Hiroyuki Tsuchiya, Yuki Watanabe, Koken Chin, H. San, T. Matsuura, M. Hotta","doi":"10.1109/ISPACS.2017.8266550","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266550","url":null,"abstract":"This paper presents a 14-bit, 400ksps pipeline cyclic analog-to-digital converter (ADC) in 90nm CMOS technology. Each stage is a non-binary cyclic ADC based on ß-expansion and the proposed ADC is designed in 3-stage pipeline structure. 16-bit non-binary output code of 3-stage is selected as 4-4-8 bits according to the considerations of total power consumption and conversion speed of the ADC. We also proposed a radix-value estimation technique for multi-stage non-binary ADC to realize the high linearity of this pipeline cyclic ADC. The SPICE simulation results demonstrate the feasibility and validity of the proposed ADC architecture and radix-value estimation algorithm. Simulated ENOB=14.25-bit is achieved while Fs = 400kSPS. The power consumption of proposed ADC is 10.59mW while the supply voltage is 3.0V.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"131 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162572","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266512
Cheng-Kuang Wu, Wenqin Lin
A rational and efficient tool is needed for the scheduling of public transport bus services that will satisfy the needs of passengers for different service time requirements. An intelligent urban bus system should not only be able to reduce carbon emissions and traffic congestion, but also to improve transport services. A model is proposed which computes Shapley values for seventeen different time periods in one day for a bus route. A fair allocation of buses based on the Shapley value is made which entails the minimum amount of deployment cost. This study applies data for the rapid transit bus system in the city of Xiamen in China to verify the Shapley value model. The simulation results show that management can easily use this framework to quantitatively allocate buses along routes within the seventeen time periods in one day and that the proposed approach is more efficient than current bus scheduling methods.
{"title":"Using Shapley value for city bus route scheduling","authors":"Cheng-Kuang Wu, Wenqin Lin","doi":"10.1109/ISPACS.2017.8266512","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266512","url":null,"abstract":"A rational and efficient tool is needed for the scheduling of public transport bus services that will satisfy the needs of passengers for different service time requirements. An intelligent urban bus system should not only be able to reduce carbon emissions and traffic congestion, but also to improve transport services. A model is proposed which computes Shapley values for seventeen different time periods in one day for a bus route. A fair allocation of buses based on the Shapley value is made which entails the minimum amount of deployment cost. This study applies data for the rapid transit bus system in the city of Xiamen in China to verify the Shapley value model. The simulation results show that management can easily use this framework to quantitatively allocate buses along routes within the seventeen time periods in one day and that the proposed approach is more efficient than current bus scheduling methods.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134351123","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266553
Masafumi Fukuda, Tsukasa Ishii, N. Takai
Along with high performance of electronic appliances, prolongation of the design period is becoming a big issue. If this problem can be solved, time spent on design can be used for circuit performance improvement and development of new circuits. Therefore, efficient circuit design through the assist of computer is required to further improve productivity. Some automatic circuit design methods have been proposed. However, these methods are unsuitable for designing a lot of circuits because it consumes a lot of time to design the new circuit. In this paper, an automatic design method of OP-Amp sizing by inference of machine learning is proposed, and predicts the element value of the circuit. From the simulation results, we succeeded in predicting element values of a circuit that satisfies the desired characteristic about 90% accuracy and shortening the design time.
{"title":"OP-AMP sizing by inference of element values using machine learning","authors":"Masafumi Fukuda, Tsukasa Ishii, N. Takai","doi":"10.1109/ISPACS.2017.8266553","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266553","url":null,"abstract":"Along with high performance of electronic appliances, prolongation of the design period is becoming a big issue. If this problem can be solved, time spent on design can be used for circuit performance improvement and development of new circuits. Therefore, efficient circuit design through the assist of computer is required to further improve productivity. Some automatic circuit design methods have been proposed. However, these methods are unsuitable for designing a lot of circuits because it consumes a lot of time to design the new circuit. In this paper, an automatic design method of OP-Amp sizing by inference of machine learning is proposed, and predicts the element value of the circuit. From the simulation results, we succeeded in predicting element values of a circuit that satisfies the desired characteristic about 90% accuracy and shortening the design time.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133850291","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8265638
Kunming Luo, Fanman Meng, Q. Wu, W. Shi, Lili Guo
This paper proposes a CNN-based segmentation model to segment foreground from an image and a prior probability map. Our model is constructed based on the FCN model that we simply replace the original RGB-based three channel input layer by a four channel, i.e., RGB and prior probability map. We then train the model by constructing various image, prior probability maps and the groundtruths from the PASCAL VOC dataset, and finally obtain a CNN-based foreground segmentation model that is suitable for general images. Our proposed method is motivated by the observation that the classical graphcut algorithm using GMM for modeling the priors can not capture the semantic segmentation from the prior probability, and thus leads to low segmentation performance. Furthermore, the efficient FCN segmentation model is for specific objects rather than general objects. We therefore improve the graph-cut like foreground segmentation by extending FCN segmentation model. We verify the proposed model by various prior probability maps such as artifical maps, saliency maps, and discriminative maps. The ICoseg dataset that is different from the PASCAL Voc dataset is used for the verification. Experimental results demonstrates the fact that our method obviously outperforms the graphcut algorithms and FCN models.
{"title":"A CNN-based segmentation model for segmenting foreground by a probability map","authors":"Kunming Luo, Fanman Meng, Q. Wu, W. Shi, Lili Guo","doi":"10.1109/ISPACS.2017.8265638","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8265638","url":null,"abstract":"This paper proposes a CNN-based segmentation model to segment foreground from an image and a prior probability map. Our model is constructed based on the FCN model that we simply replace the original RGB-based three channel input layer by a four channel, i.e., RGB and prior probability map. We then train the model by constructing various image, prior probability maps and the groundtruths from the PASCAL VOC dataset, and finally obtain a CNN-based foreground segmentation model that is suitable for general images. Our proposed method is motivated by the observation that the classical graphcut algorithm using GMM for modeling the priors can not capture the semantic segmentation from the prior probability, and thus leads to low segmentation performance. Furthermore, the efficient FCN segmentation model is for specific objects rather than general objects. We therefore improve the graph-cut like foreground segmentation by extending FCN segmentation model. We verify the proposed model by various prior probability maps such as artifical maps, saliency maps, and discriminative maps. The ICoseg dataset that is different from the PASCAL Voc dataset is used for the verification. Experimental results demonstrates the fact that our method obviously outperforms the graphcut algorithms and FCN models.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114146805","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266516
Min Gao, Jiande Sun, En Yu, Xiao Dong, Jing Li
As the increasing quantities of personal data is collected by individuals, the number of lifelog video is increasing. People make microblogging in the form of the text, later, in form of the text with pictures or videos. In this paper, a cross-media lifelog video retrieval approach is proposed to automatically match the corresponding lifelog video clip from a long lifelog video according to diary description(Fig.2). This model consists of a video captioning model and a text retrieval model. We train an encoder-decoder architecture to effectively learn video captioning by MSVD and MSR-VTT datasets. We use the similarity judgment to achieve the retrieval of the text. The similarity is measured by measuring the cosine distance between the two vectors. We experiment on some participants' lifelog videos and diaries. This approach is evaluated by investigating participants' satisfaction with results of lifelog video selected, the results show most of the testers were satisfied with the results.
{"title":"When diary meets lifelog video","authors":"Min Gao, Jiande Sun, En Yu, Xiao Dong, Jing Li","doi":"10.1109/ISPACS.2017.8266516","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266516","url":null,"abstract":"As the increasing quantities of personal data is collected by individuals, the number of lifelog video is increasing. People make microblogging in the form of the text, later, in form of the text with pictures or videos. In this paper, a cross-media lifelog video retrieval approach is proposed to automatically match the corresponding lifelog video clip from a long lifelog video according to diary description(Fig.2). This model consists of a video captioning model and a text retrieval model. We train an encoder-decoder architecture to effectively learn video captioning by MSVD and MSR-VTT datasets. We use the similarity judgment to achieve the retrieval of the text. The similarity is measured by measuring the cosine distance between the two vectors. We experiment on some participants' lifelog videos and diaries. This approach is evaluated by investigating participants' satisfaction with results of lifelog video selected, the results show most of the testers were satisfied with the results.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"61-62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117263858","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266584
Rongzhen Chen, Jun-wei Xie, Cuihua Li
Shadows and chromatic aberration problems are existed in the mobile tongue images, which result in tongue images obtained from the mobile devices cannot be directly used for auxiliary diagnosis. To better acquire the color features of the tongue images, we analyze the HIT tongue database and our mobile tongue dataset. Comparing to the HIT tongue database, we found insufficient exposure might be the root cause of above problems in the mobile tongue dataset. Therefore, we propose a two-stage color correction algorithm to effectively solve two problems. To remove the shadows in the tongue images, Frankle-McCann retinex algorithm is implemented. Then, to restore the whole color distribution of the tongue images as real world, the gray world algorithm is utilized to fine-tune the color values of the tongue images. Qualitative and quantitative analysis show that the proposed algorithm can achieve good objective and real visual results.
{"title":"Research on color correction algorithm for mobile-end tongue images","authors":"Rongzhen Chen, Jun-wei Xie, Cuihua Li","doi":"10.1109/ISPACS.2017.8266584","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266584","url":null,"abstract":"Shadows and chromatic aberration problems are existed in the mobile tongue images, which result in tongue images obtained from the mobile devices cannot be directly used for auxiliary diagnosis. To better acquire the color features of the tongue images, we analyze the HIT tongue database and our mobile tongue dataset. Comparing to the HIT tongue database, we found insufficient exposure might be the root cause of above problems in the mobile tongue dataset. Therefore, we propose a two-stage color correction algorithm to effectively solve two problems. To remove the shadows in the tongue images, Frankle-McCann retinex algorithm is implemented. Then, to restore the whole color distribution of the tongue images as real world, the gray world algorithm is utilized to fine-tune the color values of the tongue images. Qualitative and quantitative analysis show that the proposed algorithm can achieve good objective and real visual results.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124233686","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266480
Jiang Yu, Wen Si, Fenyong Li
This paper presents a novel data hiding scheme combing reversible, encryption mechanism and auxiliary syndrome. An original plain image is segmented into two parts. Then, with the aid of histogram shifting, the auxiliary syndrome generated from the first part subimage is embedded into the second part of the original uncompressed image and the encoded image is encrypted using an encryption key. After image encoding and encryption, message is embedded into the first subimage of cipher image and every pixel can load a bit of secret message. At the receiver side, using the encryption key and extracted auxiliary syndrome, the embedded data can be successfully extracted and the original image can be perfectly recovered.
{"title":"Reversible data hiding in encrypted images with auxiliary syndrome","authors":"Jiang Yu, Wen Si, Fenyong Li","doi":"10.1109/ISPACS.2017.8266480","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266480","url":null,"abstract":"This paper presents a novel data hiding scheme combing reversible, encryption mechanism and auxiliary syndrome. An original plain image is segmented into two parts. Then, with the aid of histogram shifting, the auxiliary syndrome generated from the first part subimage is embedded into the second part of the original uncompressed image and the encoded image is encrypted using an encryption key. After image encoding and encryption, message is embedded into the first subimage of cipher image and every pixel can load a bit of secret message. At the receiver side, using the encryption key and extracted auxiliary syndrome, the embedded data can be successfully extracted and the original image can be perfectly recovered.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126193052","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266586
Manman Feng, Yao-hua Xu
The pilot contamination is caused by non-orthogonal pilot sequences reuse in uplink, which affects the performance of Massive MIMO systems seriously, so it is necessary to mitigate pilot contamination. In this paper, we propose a pilot contamination precoding scheme to mitigate multi-cell pilot contamination. In the uplink, we propose a cell-defined training scheme, where the same pilot sequence is used in the same cell, and different cells use orthogonal pilot sequences, which eliminates inter-cell interference and introduces intra-cell interference artificially. In the downlink, we adopt Truncated Polynomial Expansion (TPE) precoding to reduce intra-cell interference, since the truncated polynomial of TPE precoding can replace the matrix inversion of Regularized Zero-Forcing (RZF) precoding, which reduces the complexity of RZF precoding and approximates the performance of RZF precoding by suitable truncation orders. Simulation results show the effectiveness of the proposed scheme.
{"title":"Low-complexity linear precoding for pilot contamination mitigation in multi-cell massive MIMO systems","authors":"Manman Feng, Yao-hua Xu","doi":"10.1109/ISPACS.2017.8266586","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266586","url":null,"abstract":"The pilot contamination is caused by non-orthogonal pilot sequences reuse in uplink, which affects the performance of Massive MIMO systems seriously, so it is necessary to mitigate pilot contamination. In this paper, we propose a pilot contamination precoding scheme to mitigate multi-cell pilot contamination. In the uplink, we propose a cell-defined training scheme, where the same pilot sequence is used in the same cell, and different cells use orthogonal pilot sequences, which eliminates inter-cell interference and introduces intra-cell interference artificially. In the downlink, we adopt Truncated Polynomial Expansion (TPE) precoding to reduce intra-cell interference, since the truncated polynomial of TPE precoding can replace the matrix inversion of Regularized Zero-Forcing (RZF) precoding, which reduces the complexity of RZF precoding and approximates the performance of RZF precoding by suitable truncation orders. Simulation results show the effectiveness of the proposed scheme.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126442569","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266592
Qian Wu, Lin Lin, Zhan Luo, M. Ma, Fuqiang Liu, Hao Yan
Molecular communication (MC) enables conveying information by emitting and sensing molecules at a micro-to nano-scale. MC systems for fixed nanomachines have been extensively investigated. However, the scenarios for mobile MC are seldomly studied. In the paper, the mutual information and maximum achievable rate for the mobile MC is investigated. The movement of the receiver nanomachine is modeled as a 2-D random walk. The channel impulse response is changing due to the moving property of the nanomachine. The mutual information and maximum achievable rate are analytically derived for the mobile scenario. Numerical results evaluates the influence of different parameters such as original transmitter-receiver distance, signal-to-noise ratio, threshold, and priori probabilities of transmitted symbol to the mutual information and maximum achievable rate.
{"title":"Achievable rate for a mobile molecular communication system invited paper","authors":"Qian Wu, Lin Lin, Zhan Luo, M. Ma, Fuqiang Liu, Hao Yan","doi":"10.1109/ISPACS.2017.8266592","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266592","url":null,"abstract":"Molecular communication (MC) enables conveying information by emitting and sensing molecules at a micro-to nano-scale. MC systems for fixed nanomachines have been extensively investigated. However, the scenarios for mobile MC are seldomly studied. In the paper, the mutual information and maximum achievable rate for the mobile MC is investigated. The movement of the receiver nanomachine is modeled as a 2-D random walk. The channel impulse response is changing due to the moving property of the nanomachine. The mutual information and maximum achievable rate are analytically derived for the mobile scenario. Numerical results evaluates the influence of different parameters such as original transmitter-receiver distance, signal-to-noise ratio, threshold, and priori probabilities of transmitted symbol to the mutual information and maximum achievable rate.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128284508","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 : 2017-11-01DOI: 10.1109/ISPACS.2017.8266510
Tao Li, Xiaolei Fan, Qian Zhu, Zengping Chen
Nyquist Folding Receiver (NYFR) is a novel ultrawideband interception receiver architecture, which can sample a large range wideband signal by single Analog-to-Digital Converter (ADC). And the Synchronous Nyquist Folding Receiver (SNYFR) is an improved structure of NYFR. In this paper, a new SNYFR structure based on composite Sinusoidal Frequency Modulated (SFM) Local Oscillator (LO) is proposed. For Linear Frequency Modulated (LFM) signals intercepted by this SNYFR, a Nyquist Zone (NZ) estimation and parameter estimation algorithm based on instantaneous autocorrelation is deduced. The complexity of the algorithm is lower, which reduces the difficulty of resolving the LFM/SFM hybrid modulated signals after the ADC of SNYFR. Computer simulation shows that effective detection of multi-component LFM signals and accurate parameters estimation can be achieved by the proposed algorithm when the signal to noise ratio (SNR) is better than −8dB.
{"title":"Parameter estimation of LFM signals intercepted by a composite local oscillation SNYFR","authors":"Tao Li, Xiaolei Fan, Qian Zhu, Zengping Chen","doi":"10.1109/ISPACS.2017.8266510","DOIUrl":"https://doi.org/10.1109/ISPACS.2017.8266510","url":null,"abstract":"Nyquist Folding Receiver (NYFR) is a novel ultrawideband interception receiver architecture, which can sample a large range wideband signal by single Analog-to-Digital Converter (ADC). And the Synchronous Nyquist Folding Receiver (SNYFR) is an improved structure of NYFR. In this paper, a new SNYFR structure based on composite Sinusoidal Frequency Modulated (SFM) Local Oscillator (LO) is proposed. For Linear Frequency Modulated (LFM) signals intercepted by this SNYFR, a Nyquist Zone (NZ) estimation and parameter estimation algorithm based on instantaneous autocorrelation is deduced. The complexity of the algorithm is lower, which reduces the difficulty of resolving the LFM/SFM hybrid modulated signals after the ADC of SNYFR. Computer simulation shows that effective detection of multi-component LFM signals and accurate parameters estimation can be achieved by the proposed algorithm when the signal to noise ratio (SNR) is better than −8dB.","PeriodicalId":166414,"journal":{"name":"2017 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125086201","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
扫码关注我们
求助内容：
应助结果提醒方式：