共查询到19条相似文献,搜索用时 171 毫秒
1.
多载波码分多址(MC-CDMA)结合了多载波传输技术和直接序列扩频技术,在带宽和用户数方面具有一定的优势,多用户检测作为一种提高CDMA和MC-CDMA系统容量的技术引起了人们的广泛关注。本文研究了MC-CDMA系统中的去相关多用户检测器,并对有无多用户检测算法下的MC-CDMA系统性能差异进行了仿真分析比较。 相似文献
2.
3.
本文介绍了一种将正交频分复用(OFDM)技术和码分多址(CDMA)技术相结合的多载波CDMA (MC-CDMA)系统,分析了MC-CDMA系统的发射端和接收端的结构,建立了MC-CDMA系统的信号模型,详细分析了MC-CDMA中的多址干扰形式,以及针对MC-CDMA系统的多用户检测原理,提出了一种基于最小误码率准则的多用户检测算法。理想的基于最小误码率准则的多用户检测算法在实际中难于实现,本文采用估计概率密度函数的方法,推导出了一种自适应实现的最小误码率多用户检测算法。仿真结果表明,该算法能够有效抑制多址干扰,降低误码率,同时,该算法还具有比基于最小均方误差准则的多用户检测器更低的误码率的优点。 相似文献
4.
5.
基于子空间的同步MC-CDMA系统次最优多用户检测 总被引:1,自引:0,他引:1
本文对 MC-CDMA 系统的信号模型作了分析,同时分析了子空间技术在MC-CDMA 系统次最优多用户检测中的应用,着重分析了抗多址干扰的性能。并且进行了计算机仿真,仿真结果表明,基于子空间的MC-CDMA 系统次最优多用户检测具有很好的性能。 相似文献
6.
在MC-CDMA系统中检测技术是影响系统性能的关键技术之一。这里首先对最优多用户检测方法做出了简要的分析,然后引入蚁群算法多用户检测,使用最优多用户检测的判决准则作为蚁群算法中的目标函数,并对蚁群算法多用户检测和其他多用户检测性能做了仿真比较。结果表明蚁群算法多用户检测和其他次优多用户检测相比,具有较好的性能;和最优多用户检测相比具有很低的复杂度。在多用户检测的实际应用中表现出了很大的优势。 相似文献
7.
针对STBC-MIMO MC-CDMA多用户检测方法存在计算复杂度高、工程实现困难的问题,提出利用一种混合量子进化算法(HQEA)解决STBC-MIMO MC-CDMA多用户检测问题,该算法不仅具有较低的计算复杂度,而且解决了量子进化算法容易陷入局部最优解、参数个数较多和通过查表来更新量子门的问题。仿真表明,该算法在STBC-MIMO MC-CDMA系统多用户检测问题上,具有比其他智能算法更强的跳出局部最优和寻找全局最优的能力。 相似文献
8.
MC-CDMA系统是干扰受限系统,存在多址干扰。本文提出一种基于神经网络和粒子群算法的MC-CDMA多用户检测方法。在粒子位置更新中,随机选择部分粒子作为Hopfield神经网络的神经元组成的个体,进行神经网络的更新;其他粒子仍采用原粒子群算法的位置更新策略,从而能加快粒子群算法的收敛速度以及降低计算复杂度。仿真表明在算法参数相同时,该多用户检测方法在误码率、收敛速度、系统容量、抗远近能力等方面都优于基于粒子群算法的多用户检测和基于神经网络的多用户检测,更加逼近于最佳多用户检测的性能。 相似文献
9.
空时分组码MC-CDMA系统多用户检测 总被引:2,自引:2,他引:2
本文研究了在频率选择性瑞利衰落信道中工作于时分双工(TDD)模式的多载波码分多址(MC-CDMA)系统上行链路,在用户终端处使用两个发射天线,采用基于空时分组码的发射分集。考虑对应于子载波的衰落系数是信道冲激响应的离散傅里叶变换,给出了基于空时分组码的MC-CDMA系统上行链路信号模型。采用适用于同步CDMA系统的低代价Steiner估计器来进行基于空时分组码的MC-CDMA系统的信道估计,每个用户终端的两个发射天线各分配一个midamble。研究了基于空时分组码的MC-CDMA系统的解相关多用户检测、最小均方误差(MMSE)多用户检测,进行联合的多用户检测和空时码解码。仿真结果验证了上述模型及算法的有效性。 相似文献
10.
MC-CDMA系统PIC多用户检测策略 总被引:1,自引:0,他引:1
主要研究了MC-CDMA系统下行链路上各种均衡策略,采用并行干扰消除技术进行多用户检测。计算机性能模拟结果表明:基于MMSE的PIC两级检测是兼顾系统性能和运算复杂度的一种较好的多用户检测方案。 相似文献
11.
12.
Pangan Ting Chao-Kai Wen Jung-Chieh Chen Jiunn-Tsair Chen 《Selected Areas in Communications, IEEE Journal on》2006,24(6):1221-1235
In this paper, we analyze the bit-error-rate (BER) performance of the optimum multiuser detection (MUD) with channel mismatch in multicarrier code-division-multiple-access (MC-CDMA) systems. The BER performance of the optimum MUD without channel mismatch in MC-CDMA systems has been recently derived using the replica method. However, it is left unjustified, since the replica method is not a rigorous approach. In addition, it is NP-hard to implement an optimum MUD algorithm. To justify the BER performance and to make the optimum MUD feasible, based on Pearl's belief propagation (BP) scheme, we put together a low-complexity iterative MUD algorithm for MC-CDMA systems. Furthermore, channel mismatch is introduced into the BP-based MUD algorithm to make the scenario general. With channel mismatch, the analytical results of the BP-based MUD algorithm conform perfectly to, and the simulation results of the BP-based MUD algorithm conform very closely to the BER performance of the optimum MUD derived using the replica method, which is a nontrivial extension of the existing replica approach mentioned above. Without channel mismatch, the problem becomes a special case of our contribution. 相似文献
13.
14.
Junqiang Li Letaief K.B. Zhigang Cao 《Wireless Communications, IEEE Transactions on》2005,4(2):538-549
The system capacity and performance of multicarrier code-division multiple-access (MC-CDMA) communication systems can be significantly enhanced by jointly employing MAP-based multiuser detection (MUD) and channel decoding techniques. In this paper, a group-oriented soft iterative MUD based on the combination of smart antennas and iterative MAP-based MUD is presented. The proposed method is featured as a novel technique for further increasing the system capacity and performance. In this method, all the users are first grouped into several groups according to their impinging direction of arrivals (DOAs). All users with similar DOAs are classified into the same group and then low-complexity MAP-based iterative MUD is employed in each group. Because spatial filtering cannot suppress all the interference between the groups, interference cancellation among the groups is used prior to MUD within each group. It is shown that the proposed group-oriented soft iterative MUD algorithm can significantly reduce the computational complexity compared with the conventional optimal MAP-based MUD schemes. It is also demonstrated that the performance of the proposed algorithm can approach that of a single-user coded MC-CDMA system with an antenna array in additive white Gaussian noise and frequency selective fading channels. 相似文献
15.
该文将联姻策略应用在粒子群算法中,提出一种并行分阶段的基于粒子群优化算法的盲信号分离方法(PPSO-GRADS)。该算法具有收敛速度快,分离精度高的特点。通过仿真证明该算法比未使用联姻策略的粒子群算法有更好的性能,在收敛速度和分离效果上比传统的梯度算法,遗传算法都有较明显的改善。 相似文献
16.
Ali Reza Enayati Paeiz Azmi Yaghoob Taghinia Ahmad Salahi 《Telecommunication Systems》2012,50(2):71-88
Multiuser-detection (MUD), turbo coding and smart-antennas (SA) are powerful techniques for enhancing the performance and capacity of MC-CDMA systems. Among the MUD algorithms, the maximum-likelihood (ML) method has the best performance but its complexity increases exponentially with the number of users and constellation size. In this paper, we first propose a novel bandwidth-efficient-channel-coding-scheme (BECCS) for a super-orthogonal-code (SOC)-based serially concatenated turbo code (SCSOC) so that by using it, the coded system without extra bandwidth significantly improves the performance of an uncoded system over a fading channel. Second, in order to reduce the complexity of the ML-based turbo MUD technique, an ML algorithm based on the sensitive-bits-algorithm (SBA) and a less-complex-norm-approximation (LCNA) based Euclidean distance is proposed for a SCSOC-based BECCS assisted coded MC-CDMA system accompanied by SA techniques at the receiver. Our analytical and simulation results show that from a performance perspective, at BER=10?2, the proposed SCSOC-based BECCS assisted MC-CDMA system performs 4?dB better than SOC-based coded systems. The latter system has 5?dB gain in comparison with an uncoded one, all in the same bandwidth and over fading channels. 相似文献
17.
18.
FD-MC-CDMA: A Frequency-Based Multiple Access Architecture for High Performance Wireless Communication 总被引:1,自引:0,他引:1
《Vehicular Technology, IEEE Transactions on》2005,54(4):1392-1399
Multi-carrier code division multiple access (MC-CDMA) demonstrates good probability of error performances in frequency selective fading channels, a direct result of its ability to resolve the available frequency diversity. However, MC-CDMA performances may be limited by degradation due to large multiple-access interference (MAI). Frequency division multi-carrier code division multiple access (FD-MC-CDMA), a novel multiple access architecture proposed in this paper, exploits the available frequency diversity benefits while reducing MAI. Specifically, instead of transmitting all users' information bits over all carriers, FD-MC-CDMA employs a subset of carriers to support a subset of users (while maintaining the same overall system capacity and throughput as in MC-CDMA). By careful selection of each subset of carriers, the available frequency diversity benefits are fully exploited, while the MAI experienced by each user is reduced. Furthermore, since the number of carriers employed by each user is significantly reduced, the complexity of the truly optimal multiuser detection (MUD) receiver for FD-MC-CDMA is low. An optimal MUD based on the maximum likelihood (ML) criteria is employed to optimize the system performance of FD-MC-CDMA. The proposed FD-MC-CDMA (with MUD) provides significantly better bit error rate (BER) performances than traditional MC-CDMA systems with little increase in system complexity. 相似文献
19.
分集接收的空时分组码MC-CDMA系统中的GA-多用户检测 总被引:2,自引:1,他引:1
提出了一种频率选择性信道下使用多天线分集接收的空时分组码多载波码分多址(MC-CDMA)系统上行链路中基于遗传算法(GA)的多用户检测(MUD)。考虑了两种个体选择机制对空时分组码MC-CDMA系统的GA-MUD性能的影响。第一种个体选择机制根据不同接收天线分支代价函数的线性合并选择个体;第二种个体选择机制针对不同天线分支代价函数根据Pareto优化准则选择个体,独立利用了不同天线分支信号携带的有用信息。仿真结果表明,在相同计算复杂度下,基于Pareto优化准则的个体选择机制的误码率(BER)性能要远远优于基于代价函数线性合并的个体选择机制;在相同BER性能下,基于Pareto优化准则的个体选择机制的计算复杂度要低于基于代价函数线性合并的个体选择机制。在子载波数为16的半载系统中,当BER性能逼近单用户界时,基于Pareto优化准则个体选择机制的GA-MUD的复杂度仅相当于最优化搜索MUD复杂度的0.01。 相似文献