{"title":"Method for estimating the central frequency of phase-coded radar signals","authors":"A. Yildirim","doi":"10.1049/iet-spr.2016.0237","DOIUrl":"https://doi.org/10.1049/iet-spr.2016.0237","url":null,"abstract":"The authors analyse radar carrier frequency estimation errors in digital electronic support measures receivers. They assume that the received signal is phase-coded, real-valued and embedded in white Gaussian noise. The corresponding Cramer–Rao lower bound (CRLB) for the frequency estimation is derived and formulated. The performance degradation can be significant when just a single traditional fast Fourier transform (FFT) algorithm used to estimate the central frequency of a phase-coded signal, where the spectrum is wide and distributes across many frequency bins. In this study, they assume that the FFT magnitude response of the received signal can be approximated by a raised Gaussian-shaped function. The corresponding Gaussian function fitting (GFF) estimator is proposed as a peak frequency estimation technique. Typical FFT-based frequency estimation process is simulated and the performance of the GFF estimator is compared with that of the most commonly used peak estimators: namely, with the maximum point (MAX) and the spline interpolation (INT). GFF estimator performance is also compared with a K-means-based peak estimator. With extensive set of simulations for different code lengths, they demonstrate that the proposed technique significantly reduces carrier (central) frequency estimation errors while illustrating CRLB within the figure.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114649759","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}
{"title":"Robust adaptive beamforming against large DOA mismatch with linear phase and magnitude constraints for multiple-input-multiple-output radar","authors":"Hongbo Yu, Da-Zheng Feng, Xiaokun Yao","doi":"10.1049/iet-spr.2015.0521","DOIUrl":"https://doi.org/10.1049/iet-spr.2015.0521","url":null,"abstract":"In this study, a robust adaptive beamformer against large direction-of-arrival (DOA) mismatch for multiple-input–multiple-output radar is proposed with linear phase and magnitude constraints on main lobe. First, the full-dimensional weight vector (WV) is expressed as the Kronecker product of the transmit and receive array WVs based on the WV separable principle. For the transmit array WV, the authors find an interesting property that the Fourier spectrum of its conjugate inverse arrangement is equal to its array response function within a phase factor. This property also exists in the receive array WV. Using this property, the phase response of the transmit and receive array, respectively, is set to be linear based on designing a finite impulse response filter. Then, a bi-quadratic cost function with respect to the transmit and receive WVs is established by only constraining the real magnitude response and it is effectively solved by the bi-iterative algorithm. The proposed beamformer has lower computational complexity and faster sample convergence rate, compared with the traditional magnitude response constraints beamformers with full degrees of freedom. Moreover, it can provide good robustness against large DOA mismatch. Numerical experiments are provided to demonstrate the effectiveness of the proposal.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123013765","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}
{"title":"Image super-resolution reconstruction using the high-order derivative interpolation associated with fractional filter functions","authors":"Deyun Wei","doi":"10.1049/iet-spr.2015.0444","DOIUrl":"https://doi.org/10.1049/iet-spr.2015.0444","url":null,"abstract":"In this stydy, the authors present a single image super-resolution (SISR) reconstruction based on high-order derivative interpolation (HDI) in the fractional Fourier transform (FRFT) domain. First, the HDI formula is derived using a simple technique, which is based on the relationship between the fractional band-limited signal and the traditional band-limited signal. This interpolation formula contains the derivative information of the image and the FRFT domain filter functions (FDFF). Moreover, the advantages of the FDFF are also analysed. Second, the new SISR reconstruction is presented via the HDI. The main advantage is that the presented method involves the derivatives of an image in the resizing process. Moreover, the authors take advantage of the FDFF to resize the image. Furthermore, three evaluation criteria and some simulations are presented to validate the effectiveness of the proposed method. Last, the proposed method is applied to colour image processing. For a colour image case, the RGB colour space is chosen for super-resolution reconstruction. In addition to peak signal-to-noise ratio, the authors have also used the correlation to assess the quality of the reconstruction. Compared with many methods, extensive experimental results validate that the proposed method can obtain the better-edge characteristic, less blur and less aliasing.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117351274","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}
{"title":"Shape selection partitioning algorithm for Gaussian inverse Wishart probability hypothesis density filter for extended target tracking","authors":"Peng Li, H. Ge, Jinlong Yang, Huanqing Zhang","doi":"10.1049/iet-spr.2015.0503","DOIUrl":"https://doi.org/10.1049/iet-spr.2015.0503","url":null,"abstract":"The Gaussian inverse Wishart probability hypothesis density (GIW-PHD) filter is a promising approach for tracking an unknown number of extended targets. However, it does not achieve satisfactory performance if targets in different sizes are spatially close and manoeuvring because the partitioning methods are sensitive to manoeuvres. To solve this problem, the authors propose the shape selection partitioning (SSP) measurement partitioning algorithm. The proposed algorithm first calculates potential centres and shapes of targets. It then combines each centre with different shapes to divide measurements into subcells. Accordingly, some candidate partitions can be obtained. Finally, it selects the most likely candidate partition and outputs the corresponding subcells. Simulation results show that the application of SSP to the GIW-PHD filter can achieve better performance when targets are spatially close and manoeuvring, which leads to a lower optimal subpattern assignment distance and a higher accuracy of the sum of weights.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742681","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}
{"title":"Modified generalised likelihood ratio test for detecting a regular respiratory signal in through-wall life detection","authors":"Xin Li, Ye Li","doi":"10.1049/iet-spr.2016.0085","DOIUrl":"https://doi.org/10.1049/iet-spr.2016.0085","url":null,"abstract":"In disaster rescue, trapped survivors with regular respiration can be located, by detecting regular respiratory signals (RRSs) acquired with life-detection radar systems. RRSs are often weak in these scenarios, due to the attenuation of the electromagnetic waves that propagate through debris. Thus, detecting RRSs under low signal-to-noise ratio is a key challenge in this application. In this study, RRS detection in additive white Gaussian noise was investigated from a statistical signal processing viewpoint, and a modified generalised-likelihood ratio test (GLRT) was derived. With proper parameter settings, the modified GLRT (MG) could achieve a notable detection gain over the periodogram test and the harmogram test, two classical periodic signal detectors. Thus, the proposed MG could be used to improve the detection performance of the life-detection radar systems used in disaster rescue applications.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131423228","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}
Pengwu Wan, B. Hao, Zan Li, Licun Zhou, Mian Zhang
{"title":"Time differences of arrival estimation of mixed interference signals using blind source separation based on wireless sensor networks","authors":"Pengwu Wan, B. Hao, Zan Li, Licun Zhou, Mian Zhang","doi":"10.1049/iet-spr.2016.0002","DOIUrl":"https://doi.org/10.1049/iet-spr.2016.0002","url":null,"abstract":"The estimation of the time differences of arrival (TDOAs) is significant in passive source localisation systems. The TDOA estimation accuracy may directly affect the source location performance. For co-frequency interference environments, the authors address the problem of the passive blind estimation of time-delays for uncorrelated interference source signals based on wireless sensor networks. The received mixtures at the sensors are modelled as unknown linear combinations of the differently delayed versions of the communication signal and the interference signal. Blind source separation and secondary interference signal extracting are both introduced in the proposed method. The interference signals in the mixed receiving signals of all the sensors are extracted effectively and the effect of the mixed communication signals can be significantly reduced. Simulations show that the proposed method has a more accurate performance compared to other TDOA estimation methods, and is therefore valid and practical in the TDOA localisation systems.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125525403","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}
{"title":"Modified artificial bee colony optimisation based FIR filter design with experimental validation using field-programmable gate array","authors":"Atul Kumar Dwivedi, Subhojit Ghosh, N. Londhe","doi":"10.1049/iet-spr.2015.0214","DOIUrl":"https://doi.org/10.1049/iet-spr.2015.0214","url":null,"abstract":"Optimisation based design of finite impulse response (FIR) filters has been an active area of research for quite some time. The various algorithms proposed for FIR filter design aim at meeting a set of desired specifications in the frequency domain. Evolutionary algorithms have been found to be very effective for FIR filter design because of the non-linear, non-differentiable and non-convex nature of the associated optimisation problem. The present work proposes two modified versions of a recently developed evolutionary technique i.e. artificial bee colony (ABC) algorithm for design of FIR filters. The applicability of the proposed approach has been evaluated by comparing its response with conventional reported filter design techniques. The proposed variants of ABC are found to outperform other non-convex algorithms in achieving the desired specifications. In addition to the simulation results, the designed filters have been implemented in hardware using Xilinx-xc7vx330t-3ffg1157 (Virtex-7) field programmable gate array. The hardware implementation allows validation of the proposed techniques for practical filtering applications by considering real time operation parameters.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126982603","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}
{"title":"Weighted double-backtracking matching pursuit for block-sparse reconstruction","authors":"Liye Pei, H. Jiang, Ming Li","doi":"10.1049/iet-spr.2016.0036","DOIUrl":"https://doi.org/10.1049/iet-spr.2016.0036","url":null,"abstract":"This study presents a new method for the reconstruction of block-sparse signals with and without noisy perturbations, termed weighted double-backtracking matching pursuit (WDBMP). Unlike anterior block-sparse reconstruction algorithms, WDBMP requires no prior knowledge about block length and boundaries. It not only refines the current approximation based on energy, but also takes advantage of block structure to refine the chosen support set, and thus to improve the recovery performance. Moreover, the authors propose weighted proxy to select the candidates, which can increase the probability of selecting correct supports and improve the convergence speed. Experimental results show that the proposed algorithm owns better recovery quality and requires fewer iterations to converge compared with the existing block-sparse reconstruction algorithms without knowing the block-sparse boundaries.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116727974","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}
{"title":"Analytical method for optimum non-negative integer bit allocation","authors":"Mahdi Hatam, M. Masnadi-Shirazi","doi":"10.1049/iet-spr.2014.0336","DOIUrl":"https://doi.org/10.1049/iet-spr.2014.0336","url":null,"abstract":"The optimum bit allocation (OBA) problem was first investigated by Huang and Schultheiss in 1963. They solved the problem allowing the bits to be signed real numbers. Later, different algorithms were proposed for OBA problem when the bits were constrained to be integer and non-negative. In 2006, Farber and Zeger proposed new algorithms for solving optimum integer bit allocation (OIBA) and optimum non-negative integer bit allocation (ONIBA). None of the existing algorithms for OIBA and ONIBA problems end with an analytical solution. In this study, a new analytical solution is proposed for OIBA and ONIBA problems based on a novel analytical optimisation approach. At first, a closed form solution is derived for Lagrange unconstraint problem. Then, by removing the Lagrange multiplier, an analytical solution is obtained for OIBA and ONIBA problems. Using the selection and bisection algorithms, a low complexity algorithm is proposed for searching in a group of discrete functions which can reduce the computational complexity of the analytical solution. The complexity of computing the analytical solution is O(k) which is much lower than the complexity of existing ONIBA algorithms.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126704103","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}
{"title":"Reweighted regularised variable step size normalised least mean square-based iterative channel estimation for multicarrier-interleave division multiple access systems","authors":"O. Oyerinde","doi":"10.1049/iet-spr.2016.0008","DOIUrl":"https://doi.org/10.1049/iet-spr.2016.0008","url":null,"abstract":"This study focuses on channel estimation scheme in multicarrier-interleave division multiple access (MC-IDMA)-based wireless communications. Specifically, a new adaptive algorithm is derived and proposed for implementation of the channel estimation in the MC-IDMA system. The proposed algorithm is named reweighted regularised variable step size normalised least mean square (R-RVSSNLMS). The proposed algorithm-based channel estimator exploits inherent sparsity in the orthogonal frequency division multiplexing channels in order to enhance its performance. Computer simulation results that show the comparison of the performance of the R-RVSSNLMS-based channel estimator with that of the channel estimators based on some families of least mean square algorithms are documented in this study. The results show that the performance of the proposed R-RVSSNLMS-based channel estimator is better than that of the other conventional estimators presented in this study. However, the proposed channel estimator exhibits negligible high computational complexity in comparison with other channel estimators considered in this study for the MC-IDMA system.","PeriodicalId":272888,"journal":{"name":"IET Signal Process.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134258553","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}