The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive al...The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive allocation of the resources(subcarriers, bits and power) to different users subject to several restrictions to maximize the total system capacity. In this work, a proposed subcarrier allocation algorithm was presented to assign the subcarriers with highest channel gain to the users. After the subcarrier allocation, subcarrier gain-based power allocation(SGPA) was employed for power and bit loading. The simulation results show that the proposed subcarrier-power allocation scheme can achieve high total system capacity and good fairness in allocating the resources to the users with slightly high computational complexity compared to the existing subcarrier allocation algorithms.展开更多
Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple inpu...Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.展开更多
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.展开更多
To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for ...To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for multiuser MIMO-OFDM system in correlated channels. The algorithm allocates all the subcarriers to different users according to their spatial correlations. The users with high spatial correlation are allocated in the same group and the exclusive manner is applied. The shared manner with an improved null broadening method, which improves the performance of co-channel interference （CCI） suppression and decreases the number of transmit antennas required, is applied between the different group users. As the user＇s direction of departure （DOD） changes very slowly, a looking up table method is used to reduce the computational complexity. The simulation results show that despite the angle spread of DOD, when compared with the exclusive manner, the proposed algorithm improves the spectral efficiency, and when compared with the TDMA-ZF （zero forcing） shared manner, the proposed algorithm decreases the total transmit power by at least 1 dB.展开更多
To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF...To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF） is proposed. The algorithm allocates the subcarriers with a shared manner. A zero forcing processing with joint Rx-Tx is used to suppress the co-channel interference （CCI） and to construct uncorrelated channels for STBC. An adaptive power allocation for the STBC equivalent channels can increase signal to interference and noise ratio at the receiver. Simulation results show that under the condition of an imperfect CSI, the proposed algorithm improves the system performance and reduces the number of BS transmit antennas required.展开更多
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.展开更多
Due to a number of advantages, blind adaptive multiuser detector has become a research hotspot in recent years. But low convergence rate problem occurs to many blind adaptive algorithms. A new blind adaptive approach ...Due to a number of advantages, blind adaptive multiuser detector has become a research hotspot in recent years. But low convergence rate problem occurs to many blind adaptive algorithms. A new blind adaptive approach to multiuser detection is presented. The simulation results show that by reasonably choosing time varying step size, the proposed detector can not only improve the convergence rate, but also reduce the bit error rate (BER) of the system, and so it can effectively improve the system performance with less computational cost.展开更多
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the random...Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.展开更多
Multiple access interference (MAI) and near-far problem are two major obstacles in DS-CDMA systems. Combining wavelet neural networks and two matched filters, the novel multiuser detector, which is based on multiple v...Multiple access interference (MAI) and near-far problem are two major obstacles in DS-CDMA systems. Combining wavelet neural networks and two matched filters, the novel multiuser detector, which is based on multiple variable function estimation wavelet networks over single path asynchronous channel and space-time channel respectively is presented. Excellent localization characteristics of wavelet functions in both time and frequency domains allowed hierarchical multiple resolution learning of input-output data mapping. The ma thematic frame of the neural networks and error back ward propagation algorithm are introduced. The complexity of the multiuser detector only depends on that of wavelet networks. With numerical simulations and performance analysis, it indicates that the multiuser detector has excellent performance in eliminating MAI and near-far resistance.展开更多
The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-...The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-time multiuser receiver presented in this paper combines 2D-RAKE with parallel interference cancellation (PIC), and the improved parallel interference cancellation methods are given. A novel space-time multiuser detection scheme, 2DRAKE-GPPIC is proposed. This scheme employs smart antenna to suppress unexpected DOA (Direction Of Arrival) signal, uses RAKE receiver to combine different delays of expected signal, and utilizes grouped partial parallel interference cancellation (GPPIC) algorithm to suppress further the interference signal in the main lobe of array antennas. The simulation results reveal that the scheme of space-time multiuser detection presented in this paper has better performance for WCDMA system.展开更多
Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an ...Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an iterative multiuser receiver based on decorrelating decision-feedback detection is proposed, which is effective to implement multiuser detection, channel decoding and parameter estimation. The data decoding and the parameter estimation are reinforced each other. The bit error rate decreases along with the increase of the iteration, and the parameter estimation approaches the optimum at the same time.展开更多
A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it w...A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it was based on coordinate descent iterations where coordinates were the unknown symbol phases. The PDS algorithm, together with a descent local search （also implemented as a version of the PDS algorithm）, was used multiple times with different initializations in a proposed multiple phase detector; the solution with the minimum cost was then chosen as the final solution. The simulation results show that for highly loaded multiuser scenarios, the proposed technique has a detection performance that is close to the single-user bound. The results also show that the multiple phase detector allows detection in highly overloaded scenarios and it exhibits near-far resistance. In particular, the detector has a performance that is significantly better, and complexity that is significantly lower, than that of the detector based on semi-definite relaxation.展开更多
This paper presents a new transaction method in terms of which deals are concluded by competitive prices, and indicates its design on multiuser platform, especially the research of synchronization and vieing for power...This paper presents a new transaction method in terms of which deals are concluded by competitive prices, and indicates its design on multiuser platform, especially the research of synchronization and vieing for powers. The system was programmed with SCO FOXBASE 210, C language and Shell. The result of nearly two year′s use proved that the transaction method and its accomplishments are all practicable.展开更多
Many blind channel estimation methods have been proposed for direct sequence (DS) code-division multiple access (CDMA) systems, so we can certainly use them to estimate the finite impulse response (FIR) channel for th...Many blind channel estimation methods have been proposed for direct sequence (DS) code-division multiple access (CDMA) systems, so we can certainly use them to estimate the finite impulse response (FIR) channel for the multi-carrier (MC-) CDMA system. In this paper, the MC-CDMA system is interpreted as an equivalent time-domain DS-CD-MA system with specific spreading codes. Then, an equivalently time-domain blind channel estimator is derived for the uplink MC-CDMA, which is based on second-order statistics of the received data. By exploiting singular value decomposition (SVD) and the finite alphabet property of transmitted symbols, the time-domain channel impulse response (CIR) for the uplink MC-CDMA can be accurately identified. Computer simulations illustrate both the validity and the overall performance of the proposed estimator.展开更多
A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus alg...A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.展开更多
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.展开更多
Many properties of frequency-hopped spread-spectrum multiple access （FH/SSMA）, such as, robustness against frequency selective fading and jamming make it a preferred multiple access communication scheme. But cochann...Many properties of frequency-hopped spread-spectrum multiple access （FH/SSMA）, such as, robustness against frequency selective fading and jamming make it a preferred multiple access communication scheme. But cochannel interference （CCI） can seriously harm the system＇s performance. On the basis of the analysis of the CCI pattern of frequency hopped multiple access signal, a new multiuser detection algorithm for canceling the CCI in frequency hopped multiple access systems is proposed. In the proposed scheme, the CCI is canceled by first detecting the frequency hopping slot, and then classifying and regenerating the candidates of the interference pattern from the time-frequency matrix. Both the theoretical analysis and computer simulation results show that compared to the conventional detector and Mabuchi＇s detector, this new multiuser detector has lower complexity, better convergence stability, and is suitable for both additive white Gaussian noise （AWGN） channels and Rayleigh fading channels.展开更多
文摘The main objective of multiuser orthogonal frequency division multiple access(MU-OFDM) is to maximize the total system capacity in wireless communication systems. Thus, the problem in MU-OFDM system is the adaptive allocation of the resources(subcarriers, bits and power) to different users subject to several restrictions to maximize the total system capacity. In this work, a proposed subcarrier allocation algorithm was presented to assign the subcarriers with highest channel gain to the users. After the subcarrier allocation, subcarrier gain-based power allocation(SGPA) was employed for power and bit loading. The simulation results show that the proposed subcarrier-power allocation scheme can achieve high total system capacity and good fairness in allocating the resources to the users with slightly high computational complexity compared to the existing subcarrier allocation algorithms.
文摘Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.
文摘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.
基金the National Natural Science Foundation of China (60572039 60432040)
文摘To minimize the overall transmit power while maintaining a constant data rate and target BER, a downlink adaptive resource allocation algorithm with jointing the exclusive manner and the shared manner is proposed for multiuser MIMO-OFDM system in correlated channels. The algorithm allocates all the subcarriers to different users according to their spatial correlations. The users with high spatial correlation are allocated in the same group and the exclusive manner is applied. The shared manner with an improved null broadening method, which improves the performance of co-channel interference （CCI） suppression and decreases the number of transmit antennas required, is applied between the different group users. As the user＇s direction of departure （DOD） changes very slowly, a looking up table method is used to reduce the computational complexity. The simulation results show that despite the angle spread of DOD, when compared with the exclusive manner, the proposed algorithm improves the spectral efficiency, and when compared with the TDMA-ZF （zero forcing） shared manner, the proposed algorithm decreases the total transmit power by at least 1 dB.
基金supported partly by the Postdoctoral Science Foundation of Chinathe National Natural Science Foundation of China(60572039).
文摘To improve the performance of a multiuser MIMO-OFDM system with imperfect channel status information, a downlink adaptive resource allocation algorithm which combines space-time block coding and beam forming （STBC-BF） is proposed. The algorithm allocates the subcarriers with a shared manner. A zero forcing processing with joint Rx-Tx is used to suppress the co-channel interference （CCI） and to construct uncorrelated channels for STBC. An adaptive power allocation for the STBC equivalent channels can increase signal to interference and noise ratio at the receiver. Simulation results show that under the condition of an imperfect CSI, the proposed algorithm improves the system performance and reduces the number of BS transmit antennas required.
基金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.
文摘Due to a number of advantages, blind adaptive multiuser detector has become a research hotspot in recent years. But low convergence rate problem occurs to many blind adaptive algorithms. A new blind adaptive approach to multiuser detection is presented. The simulation results show that by reasonably choosing time varying step size, the proposed detector can not only improve the convergence rate, but also reduce the bit error rate (BER) of the system, and so it can effectively improve the system performance with less computational cost.
文摘Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefmite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.
基金This project was supported by the National Natural Science Foundation of China (60073053 60133010).
文摘Multiple access interference (MAI) and near-far problem are two major obstacles in DS-CDMA systems. Combining wavelet neural networks and two matched filters, the novel multiuser detector, which is based on multiple variable function estimation wavelet networks over single path asynchronous channel and space-time channel respectively is presented. Excellent localization characteristics of wavelet functions in both time and frequency domains allowed hierarchical multiple resolution learning of input-output data mapping. The ma thematic frame of the neural networks and error back ward propagation algorithm are introduced. The complexity of the multiuser detector only depends on that of wavelet networks. With numerical simulations and performance analysis, it indicates that the multiuser detector has excellent performance in eliminating MAI and near-far resistance.
文摘The structure and performance of space-time multiuser detection receiver at base stations of WCDMA system is analyzed, in which smart antenna is employed. WCDMA uplink signal model is established in this paper. Space-time multiuser receiver presented in this paper combines 2D-RAKE with parallel interference cancellation (PIC), and the improved parallel interference cancellation methods are given. A novel space-time multiuser detection scheme, 2DRAKE-GPPIC is proposed. This scheme employs smart antenna to suppress unexpected DOA (Direction Of Arrival) signal, uses RAKE receiver to combine different delays of expected signal, and utilizes grouped partial parallel interference cancellation (GPPIC) algorithm to suppress further the interference signal in the main lobe of array antennas. The simulation results reveal that the scheme of space-time multiuser detection presented in this paper has better performance for WCDMA system.
文摘Iterative multiuser receiver for joint multiuser detection and channel decoding improves the receiver' s performance by passing soft information between multiuser detection and channel decoding. In this paper, an iterative multiuser receiver based on decorrelating decision-feedback detection is proposed, which is effective to implement multiuser detection, channel decoding and parameter estimation. The data decoding and the parameter estimation are reinforced each other. The bit error rate decreases along with the increase of the iteration, and the parameter estimation approaches the optimum at the same time.
文摘A novel iterative technique, the phase descent search detection was proposed. This technique constrained the solution （PDS） algorithm, for M-ary phase shift keying （M-PSK） symbols to have a unit magnitude and it was based on coordinate descent iterations where coordinates were the unknown symbol phases. The PDS algorithm, together with a descent local search （also implemented as a version of the PDS algorithm）, was used multiple times with different initializations in a proposed multiple phase detector; the solution with the minimum cost was then chosen as the final solution. The simulation results show that for highly loaded multiuser scenarios, the proposed technique has a detection performance that is close to the single-user bound. The results also show that the multiple phase detector allows detection in highly overloaded scenarios and it exhibits near-far resistance. In particular, the detector has a performance that is significantly better, and complexity that is significantly lower, than that of the detector based on semi-definite relaxation.
文摘This paper presents a new transaction method in terms of which deals are concluded by competitive prices, and indicates its design on multiuser platform, especially the research of synchronization and vieing for powers. The system was programmed with SCO FOXBASE 210, C language and Shell. The result of nearly two year′s use proved that the transaction method and its accomplishments are all practicable.
基金This project was supported by the National Natural Science Foundation of China (No. 69872029) the Research Fund for Doctoral Program of Higher Education of China (No. 1999069808).
文摘Many blind channel estimation methods have been proposed for direct sequence (DS) code-division multiple access (CDMA) systems, so we can certainly use them to estimate the finite impulse response (FIR) channel for the multi-carrier (MC-) CDMA system. In this paper, the MC-CDMA system is interpreted as an equivalent time-domain DS-CD-MA system with specific spreading codes. Then, an equivalently time-domain blind channel estimator is derived for the uplink MC-CDMA, which is based on second-order statistics of the received data. By exploiting singular value decomposition (SVD) and the finite alphabet property of transmitted symbols, the time-domain channel impulse response (CIR) for the uplink MC-CDMA can be accurately identified. Computer simulations illustrate both the validity and the overall performance of the proposed estimator.
文摘A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.
基金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.
基金the National Natural Science Foundation of China (60372055)National Doctoral Foundation of China (20030698027).
文摘Many properties of frequency-hopped spread-spectrum multiple access （FH/SSMA）, such as, robustness against frequency selective fading and jamming make it a preferred multiple access communication scheme. But cochannel interference （CCI） can seriously harm the system＇s performance. On the basis of the analysis of the CCI pattern of frequency hopped multiple access signal, a new multiuser detection algorithm for canceling the CCI in frequency hopped multiple access systems is proposed. In the proposed scheme, the CCI is canceled by first detecting the frequency hopping slot, and then classifying and regenerating the candidates of the interference pattern from the time-frequency matrix. Both the theoretical analysis and computer simulation results show that compared to the conventional detector and Mabuchi＇s detector, this new multiuser detector has lower complexity, better convergence stability, and is suitable for both additive white Gaussian noise （AWGN） channels and Rayleigh fading channels.
