It is a necessary step to estimate the spreading sequence of direct sequence spread spectrum （DSSS） signal for blind despreading and demodulation in non-cooperative communications. Two innovative and effective detec...It is a necessary step to estimate the spreading sequence of direct sequence spread spectrum （DSSS） signal for blind despreading and demodulation in non-cooperative communications. Two innovative and effective detection statistics are proposed to implement the synchronization and spreading sequence estimation procedure. The proposed algorithm also has a low computational complexity with only linear additions and modifications. Theoretical analysis and simulation results show that the algorithm performs quite well in low SNR environment, and is much better than all the existing typical algorithms with a comprehensive consideration both in performance and computational complexity.展开更多
In this paper, a low complexity direction of arrival(DOA) estimation method for massive uniform circular array(UCA) with single snapshot is proposed.Firstly, the coarse DOAs are estimated by finding the peaks from the...In this paper, a low complexity direction of arrival(DOA) estimation method for massive uniform circular array(UCA) with single snapshot is proposed.Firstly, the coarse DOAs are estimated by finding the peaks from the circular convolution between a fixed coefficient vector and the received data vector.Thereafter, in order to refine coarse DOA estimates, we reconstruct the direction matrix based on the coarse DOA estimations and take the first order Taylor expansion with DOA estimation offsets into account.Finally, the refined estimations are obtained by compensating the offsets, which are obtained via least squares(LS) without any complex searches.In addition, the refinement can be iteratively implemented to enhance the estimation results.Compared to the offset search method, the proposed method achieves a better estimation performance while requiring lower complexity.Numerical simulations are presented to demonstrate the effectiveness of the proposed method.展开更多
High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based...High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based multiple access scheme, grouped spread IDMA （GSIDMA）, is proposed. In a GSIDMA system, lower complexity and latency for mobile stations can be achieved by appropriately dividing active users into different groups. The system model of GSIDMA is constructed and followed by analysing on its system capacity, complexity and latency, and bit error rate （BER） performance. The extrinsic information transfer （EXIT） chart is used to analyze the convergence behavior of the iteration process. The grouping method and interleavers-reuse issue for GSIDMA are also discussed preliminarily. The analyses and simulation results indicate that the complexity and latency of the proposed scheme are much lower than those of IDMA, whereas its BER performance is close to the latter. The properties of low complexity and low latency make it more feasible for the practical implementation.展开更多
In view of the low performance of adaptive asymmetric joint diagonalization（AAJD）, especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation（AAJDd） al...In view of the low performance of adaptive asymmetric joint diagonalization（AAJD）, especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation（AAJDd） algorithm is proposed. The AAJDd algorithm improves performance by estimating the direction of departure（DOD） and direction of arrival（DOA） directly, avoiding the reuse of the previous moment information in the AAJD algorithm.On this basis, the idea of sequential estimation of the principal component is introduced to turn the matrix operation into a constant operation, reducing the amount of computation and speeding up the convergence. Meanwhile, the eigenvalue is obtained, which can be used to estimate the number of targets. Then, the estimation of signal parameters via rotational invariance technique（ESPRIT） algorithm is improved to realize the automatic matching and association of DOD and DOA. The simulation results show that the AAJDd algorithm has higher tracking performance than the AAJD algorithm, especially when the high maneuvering target is tracked. The efficiency of the proposed method is verified.展开更多
The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated...The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.展开更多
Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in t...Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.展开更多
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education (20060003032)
文摘It is a necessary step to estimate the spreading sequence of direct sequence spread spectrum （DSSS） signal for blind despreading and demodulation in non-cooperative communications. Two innovative and effective detection statistics are proposed to implement the synchronization and spreading sequence estimation procedure. The proposed algorithm also has a low computational complexity with only linear additions and modifications. Theoretical analysis and simulation results show that the algorithm performs quite well in low SNR environment, and is much better than all the existing typical algorithms with a comprehensive consideration both in performance and computational complexity.
基金supported by the National Natural Science Foundation of China (61971217, 61601167)Jiangsu Planned Project for Postdoctoral Research Funds (2020Z013)+2 种基金China Postdoctoral Science Foundation (2020M681585)the fund of State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System (CEMEE 2021Z0101B)the fund of State Key Laboratory of Marine Resource Utilization in South China Sea (Hainan University)(MRUKF2021033)。
文摘In this paper, a low complexity direction of arrival(DOA) estimation method for massive uniform circular array(UCA) with single snapshot is proposed.Firstly, the coarse DOAs are estimated by finding the peaks from the circular convolution between a fixed coefficient vector and the received data vector.Thereafter, in order to refine coarse DOA estimates, we reconstruct the direction matrix based on the coarse DOA estimations and take the first order Taylor expansion with DOA estimation offsets into account.Finally, the refined estimations are obtained by compensating the offsets, which are obtained via least squares(LS) without any complex searches.In addition, the refinement can be iteratively implemented to enhance the estimation results.Compared to the offset search method, the proposed method achieves a better estimation performance while requiring lower complexity.Numerical simulations are presented to demonstrate the effectiveness of the proposed method.
基金supported by the National Natural Science Foundation of China (61171180)the National Basic Resaearch Program (923 Program) (2007CB31(0606))the Natural Sientific Research Innovation Foundation in Harbin Institute of Technology (HIT. NSRIF20011117)
文摘High complexity and high latency are key problems for multiuser detection （MUD） to be applied to a mobile station in cellular networks. To tackle these problems, an interleave division multiple access （IDMA） based multiple access scheme, grouped spread IDMA （GSIDMA）, is proposed. In a GSIDMA system, lower complexity and latency for mobile stations can be achieved by appropriately dividing active users into different groups. The system model of GSIDMA is constructed and followed by analysing on its system capacity, complexity and latency, and bit error rate （BER） performance. The extrinsic information transfer （EXIT） chart is used to analyze the convergence behavior of the iteration process. The grouping method and interleavers-reuse issue for GSIDMA are also discussed preliminarily. The analyses and simulation results indicate that the complexity and latency of the proposed scheme are much lower than those of IDMA, whereas its BER performance is close to the latter. The properties of low complexity and low latency make it more feasible for the practical implementation.
基金supported by the National Natural Science Foundation of China(6167145361201379)Anhui Natural Science Foundation of China(1608085MF123)
文摘In view of the low performance of adaptive asymmetric joint diagonalization（AAJD）, especially its failure in tracking high maneuvering targets, an adaptive asymmetric joint diagonalization with deflation（AAJDd） algorithm is proposed. The AAJDd algorithm improves performance by estimating the direction of departure（DOD） and direction of arrival（DOA） directly, avoiding the reuse of the previous moment information in the AAJD algorithm.On this basis, the idea of sequential estimation of the principal component is introduced to turn the matrix operation into a constant operation, reducing the amount of computation and speeding up the convergence. Meanwhile, the eigenvalue is obtained, which can be used to estimate the number of targets. Then, the estimation of signal parameters via rotational invariance technique（ESPRIT） algorithm is improved to realize the automatic matching and association of DOD and DOA. The simulation results show that the AAJDd algorithm has higher tracking performance than the AAJD algorithm, especially when the high maneuvering target is tracked. The efficiency of the proposed method is verified.
文摘The presented iterative multiuser detection technique was based on joint deregularized and box-constrained solution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm.The deregularization maximized the energy of the solution,which was opposite to the Tikhonov regularization where the energy was minimized.However,combined with box-constraints,the deregularization forced the solution to be close to the binary set.It further exploited the box-constrained dichotomous coordinate descent algorithm and adapted it to the nonstationary iterative Tikhonov regularization to present an efficient detector.As a result,the worst-case and average complexity are reduced down as K2.8 and K2.5 floating point operation per second,respectively.The development improves the "efficient frontier" in multiuser detection,which is illustrated by simulation results.In addition,most operations in the detector are additions and bit-shifts.This makes the proposed technique attractive for fixed-point hardware implementation.
基金supported by the National Council for Technological and Scientific Development of Brazil (RN82/2008)
文摘Multiuser detection can be described as a quadratic optimization problem with binary constraint. Many techniques are available to find approximate solution to this problem. These tech- niques can be characterized in terms of complexity and detection performance. The ＂efficient frontier＂ of known techniques include the decision-feedback, branch-and-bound and probabilistic data association detectors. The presented iterative multiuser detection technique is based on joint deregularized and box-constrained so- lution to quadratic optimization with iterations similar to that used in the nonstationary Tikhonov iterated algorithm. The deregulari- zation maximizes the energy of the solution, this is opposite to the Tikhonov regularization where the energy is minimized. However, combined with box-constraints, the deregularization forces the solution to be close to the binary set. We further exploit the box- constrained dichotomous coordinate descent （DCD） algorithm and adapt it to the nonstationary iterative Tikhonov regularization to present an efficient detector. As a result, the worst-case and aver- age complexity are reduced down to K28 and K2~ floating point operation per second, respectively. The development improves the ＂efficient frontier＂ in multiuser detection, which is illustrated by simulation results. Finally, a field programmable gate array （FPGA） design of the detector is presented. The detection performance obtained from the fixed-point FPGA implementation shows a good match to the floating-point implementation.
