Sequential detection CDMA multi‐user receiver

This paper proposes a sequential detection technique for a multi‐user receiver that is constructed over a CDMA system. In this system, the transmitter transmits a symbol made by spreading the spectrum with an enveloped sequence protected by guard sequences, and a receiver de‐modulates the core‐sequence part of the received symbol with either a de‐correlating detector or an MMSE detector. The advantage is that performance is improved without reducing the number of the active users. This sequential detection system estimates the best user signal from all of the soft outputs, which are obtained by solving a de‐correlating system of equations. Once detected, the best user component is removed from the received symbol. The resultant symbol composed of the remaining user signals is then sequentially detected by repeating the method stated above. A computer simulation of this system reveals a remarkable improvement in the bit‐error rate performance compared to conventional systems. Copyright © 2005 John Wiley & Sons, Ltd.     

A multi‐user CDMA receiver utilizing decorrelating detector with additional dummy pilot response

A pilot assisted CDMA system which uses extended spreading sequences with guard sequences under a quasi‐synchronous condition is capable of separating the interference components included in the input of a de‐correlating receiver by solving a system of linear equations. The performance of such a system, however, depends on the property of the de‐correlating matrix consisting of the received pilots, which correspond to the respective user spreading sequences and the multi‐path channel conditions. That is, the regularity of the matrix often tends to degrade, and the rank reduces occasionally primarily due to the multi‐paths, resulting in solutions that are vulnerable to AWGN. The present paper proposes an effective technique to solve this problem by introducing a virtual user into a group of real users that are to be served. The simulation results indicate a remarkable improvement in the bit‐error‐rate (BER) performance. In addition, based on the BER performance, the system has a RAKE‐like function that has power‐sum characteristics. Copyright © 2003 John Wiley & Sons, Ltd.     

Jointly multi‐user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multi‐user channel estimation (MuChE) and detection problems at its maximum‐likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi‐user detection (MuD) show that the proposed genetic algorithm multi‐user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi‐user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near‐optimum multi‐user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi‐user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE–GAMuD scheme can be regarded as a promising alternative for implementing third‐generation (3G) and fourth‐generation (4G) wireless systems in the near future. Copyright © 2010 John Wiley & Sons, Ltd.     

Combined code reuse scheme with two‐dimensional OVSF codes assignment algorithm for uplink multi‐user/multi‐rate block spread multi‐cellular CDMA

The two‐dimensional (2D) block spread code division multiple access (CDMA) can avoid the uplink multiple‐access interference with low‐complexity single‐user detection in a slow fading channel and, therefore, is very attractive. In the 2D spreading, orthogonal variable spreading factor (OVSF) is used for spreading; an important problem is how to efficiently assign the limited resource of OVSF codes to users with different data rates, while meeting the requirement of quality of service in a multi‐cell environment. In this paper, it is shown that the code reuse can improve the code reuse efficiency and the proposed code reuse scheme combined with code assignment algorithm can allow flexible multi‐rate uplink transmission. The computer simulation confirms that the proposed code assignment algorithm improves the code reuse efficiency while achieving lower blocking probability than traditional CDMA. Copyright © 2012 John Wiley & Sons, Ltd.     

Multi‐user detection for the ARGOS satellite system

In this paper, we evaluate several multiuser detection (MUD) architectures for the reception of asynchronous beacon signals in the ARGOS satellite system. The case of synchronous signals is studied first. Though impractical, this case provides useful guidance on the second part of the study, that is, the design of MUD receivers for asynchronous users. This paper focuses more particularly on successive interference cancellation (SIC) receivers because they have been shown to achieve a good performance complexity trade‐off. Several E_b ∕ N₀ degradation curves are obtained as a function of channel parameters. With these curves, a performance analysis is presented in order to determine in which conditions it is possible to successfully decode none, one, or more beacon signals. We show that SIC receivers can improve the percentage of served beacons from 50% to more than 67% for a population of 37,600 beacons. Copyright © 2014 John Wiley & Sons, Ltd.     

Multi‐interface cognitive radio for enhanced routing in multi‐hop cellular networks

Multi‐hop cellular network (MCN) is a wireless communication architecture that combines the benefits of conventional single‐hop cellular networks and multi‐hop ad hoc relaying networks. The route selection in MCN depends on the availability of intermediate nodes and their neighborhood connectivity. Cognitive radio (CR) is an emerging communication paradigm that exploits the available radio frequencies opportunistically for the effective utilization of the radio frequency spectrum. The incorporation of CR and mobile ad hoc network routing protocols in MCN could potentially improve the spectrum utilization and the routing performance of MCN. This paper firstly presents the proposed model for the multi‐interface CR mobile node with transceiver synchronization and then investigates its opportunistic spectrum utilization and routing performance in MCN. Copyright © 2015 John Wiley & Sons, Ltd.     

Performance analysis of an improved multi‐carrier CDMA system under frequency‐selective Rayleigh fading channels

In this article, an analytical method is proposed to study an improved orthogonal multi‐carrier DS/CDMA system, which uses QPSK for both spreading and carrier modulations without redundant sub‐carriers and time interleavers in each sub‐channel. The article concerns in particular such a system and its performance under frequency‐selective Rayleigh fading channels with various delay‐power profiles. The bit error probabilities under varying multipath‐diversity orders (using maximal ratio combing RAKE reception) and different numbers of resolvable multipaths are derived. It has been shown that the system, despite of its structural simplicity, performs well in mitigating frequency‐selective fading. The performance is also evaluated taking into account various other parameter sets, such as numbers of users and sub‐carriers, lengths of PN codes and the number of fingers in an RAKE receiver, etc. Copyright © 2003 John Wiley & Sons, Ltd.     

A study of multi‐hop cellular networks

The number of cellular communication subscribers continues to grow, attesting to the great success of this technology. However, cellular networks have inherent limitations on cell capacity and coverage and shortcomings such as the dead spot and the hot spot problems. Multi‐hop cellular networks (MCNs) help enhance the cell capacity and coverage, while, at the same time, alleviating the dead spot and hot spot problems, increasing the utilization of radio resource, and reducing the power consumption of mobile terminals. In the past decade, more than a dozen of MCN architectures were proposed. In this paper, we study various types of MCN proposals. We identify and discuss the design decision factors and use these factors to classify most existing MCN proposals. Future research directions, including studies of capacity and energy consumption, and approaches addressing design issues such as cell size, routing, channel assignment, load balancing for MCNs are discussed. Copyright © 2010 John Wiley & Sons, Ltd.     

Performance analysis of cellular CDMA high‐speed data services

This paper investigates the forward‐link peak and average data rates, throughput, and coverage of a cellular CDMA system for delivering high‐speed wireless data services. The analysis takes into account major aspects commonly found in the forward data channel and applies the generalized Shannon capacity formula for multi‐element antenna (MEA) systems. The study focuses on the physical layer and is flexible for various propagation environments, antenna configurations, multicode allocations, user distributions, and cell site configurations. Numerical results for various multicode allocations are presented for a system model with two‐tier interfering cells operating under a frequency selective slow fading channel with propagation environments specified in the Recommendation ITU‐R M.1225. Copyright © 2006 John Wiley & Sons, Ltd.     

Channel capacity per user in a power and rate adaptive hybrid DS/FFH‐CDMA cellular system over Rayleigh fading channels

The theoretically achievable average channel capacity (in the Shannon sense) per user of a hybrid cellular direct sequence/fast frequency hopping code‐division multiple‐access (DS/FFH‐CDMA) system, operating in a Rayleigh fading environment, was examined. The analysis covers the downlink transmission and leads to the derivation of a novel expression between the average channel capacity available to each system's user under simultaneous optimal power and rate adaptation and the system's parameters, providing an optimistic upper bound, useful for practical modulation and coding schemes. The final derived closed‐form expression can be useful for the design of the DS/FFH‐CDMA system because it provides a theoretical tool for the initial quantitative analysis. Finally, avoiding the application of complex theoretical algorithm or lengthy simulation, we theoretically derived numerical results to illustrate the presented analysis. Copyright © 2011 John Wiley & Sons, Ltd.     

初始判决指导下的DS/CDMA最大似然检测算法

本文首先给出了多径异步多用户ＤＳ／ＣＤＭＡ系统的一种数学模型，得出了恒参信道下最大似然检测（ＭＬＳＥ）算法的一种新的表示形式。然后作者具体分析了以ＲＡＫＥ接收机作为衰落信道的匹配滤波器时，最大似然检测器的算法设计问题。分析指出，在多径环境下ＭＬＳＥ算法的复杂度和计算量与多径时延的分布有关，如果用户时延扩散在一个信息码元之内，算法复杂度和恒参信道下相同，而其实现可以用状态数可变的Ｖｉｔｅｒｂｉ算法来实现。最后，本文用传统判决方法得出的初始判决信息缩减Ｖｉｔｅｒｂｉ算法的搜索空间，在保证一定性能的前提下，算法的计算复杂度大大降低。     

Modeling and performance analysis of multi‐service wireless CDMA cellular networks using smart antennas

In this paper, we present an analytical model to assess the blocking capacity of multi‐service code division multiple access (CDMA) systems. We include smart antenna systems in our model and show how the capacity of CDMA systems can be improved if smart antennas are employed at the base stations. Applying smart antennas can actually transform CDMA systems from being interference limited to being channel/code limited. To investigate this effect, we extend our model to include the limitation of channelization codes in CDMA‐based universal mobile telecommunication system (UMTS) systems. From the point of view of the call admission control (CAC) in a smart antenna CDMA system, we can either accept the capacity loss due to code limitation, or we can additionally apply space division multiple access (SDMA) techniques to re‐use channelization codes and thus re‐approach the capacity which is obtained if no code limitation is considered. Copyright © 2008 John Wiley & Sons, Ltd.     

Analysis of minimum transmit sum power and scheduling power gain for multi‐user MIMO‐OFDM networks with rate constraints

Minimum transmit sum power (MTSP) is of high theoretical and practical value in multi‐user rate‐constrained systems; it is, however, quite difficult to be numerically characterized in complex channels for the prohibitively high computational power required. In this paper, we present a computationally efficient method to approximate the MTSP in multi‐user multiple‐input multiple‐output orthogonal frequency division multiplexing (MU‐MIMO‐OFDM) wireless networks. Specifically, we propose both lower and upper bounds of the MTSP, which are asymptotically accurate in the limit of large K, the number of users. Then, we develop two iterative water‐filling algorithms to numerically solve the proposed bounds. These algorithms are with low complexity, that is, linear in K, and therefore enable the analysis of MTSP in complex channels even if K is large. Numerical results demonstrate the effectiveness of the bounds in approximating the MTSP and the high computational efficiency of the proposed iterative water‐filling algorithms. With the proposed bounds, we further numerically study scheduling power gain (SPG), which is defined as MTSP reduction achieved by scheduling resources over multiple channel blocks in time domain. We simulate the SPG in different wireless environments defined in Third Generation Partnership Project spatial channel extended model and find insignificant SPG in some cases, indicating that the benefit from scheduling over multiple channel blocks is limited and simply allocating resources within the present channel is sufficient. Our analysis on the MTSP and SPG provides guidelines on the design of resource schedulers in MU‐MIMO‐OFDM networks. Copyright © 2014 John Wiley & Sons, Ltd.     

多用户检测技术在OFDM-CDMA系统中的应用

OFDM-CDMA是继第三代移动通信之后移动通信技术中的新热点,这里分别对单用户检测器,解相关检测器,线性最小均方(MMSE)检测器和采用最陡下降常模算法(SDCMA)的盲多用户检测器在OFDM-CDMA系统中的误码率性能进行了比较和分析。     

Performance analysis of CDMA cellular networks with channel sub‐rating

This paper presents the analysis of CDMA cellular networks with channel sub‐rating. From users' point of view, our considered scheme gives higher priority to handoff calls over new calls by sub‐rating the existing connections when handoff calls find no idle channels upon their arrivals. Therefore, it is considered that the disadvantage of the soft handoff which needs more channels than the hard handoff is made up for. Handoff calls can also wait in a queue while they are in handoff areas if all channels are sub‐rated in the cell of interest. We mathematically model this scheme by applying queueing theory. Then, we analyse its performance to derive the blocking probabilities of the new and handoff calls, the probability that handoff calls leave the handoff area without getting new channels, the degradation ratio of the voice quality by sub‐rating, mean and coefficient of variation of the waiting time of handoff calls. In numerical results, the analytical results are compared with the simulation ones to validate our analytical approach. Moreover, we compare the sub‐rating scheme with full‐rating one with respect to some characteristic values to show the effect of sub‐rating. Copyright © 2005 John Wiley & Sons, Ltd.     

Performance of optimum wavelet for DS‐CDMA chip waveform over multi‐path Rayleigh fading channels

In this paper, the probability of error (P_e) expression of asynchronous direct sequence‐code division multiple access (DS‐CDMA) signals using band‐limited chip waveforms is derived over multi‐path Rayleigh fading channels. In receiver, a matched filter‐based rake receiver in conjunction with maximum ratio combiner (MRC) is considered. Numerical values for the P_e are calculated for various chip waveforms including an optimum wavelet waveform. Analytical results are verified by conducting simulations. Results show that the optimum wavelet‐based scheme outperforms time‐limited raised cosine, half sine, rectangular and band‐limited square‐root raised cosine chip waveform‐based schemes in terms of the P_e and the capacity defined as the number of users per Hertz for a same P_e level. Copyright © 2006 John Wiley & Sons, Ltd.     

Towards understanding consumption in multi‐user solar energy systems: the cases of villages in Argentina and Cuba

Research on the electrification of remote villages by means of decentralized renewable energy systems increasingly requires consideration of the characteristics of the user communities. Particularly for communities with multi‐user systems (MUS), in order to achieve optimal design and sizing of the system and efficient energy distribution among users, it is important to consider the social characteristics of the community in addition to technical and economic aspects. The solar energy supply is always limited, and distribution of the energy among the users is mainly a matter of coordinating who can use how much at what time, which is influenced by various factors. What we need first of all is knowledge of the actual power needs of each household over a period of time. With the aim of determining typical patterns of energy consumption in households with similar characteristics, the present preliminary research study uncovers the factors that determine energy consumption in five solar power villages in Cuba and Argentina. Correlation and regression analysis of data from surveys and energy consumption measurements showed that type and number of electrical appliances are the most important, but not sufficient, factors for explaining differences in household energy consumption. Demographic factors, occupations, daily routine and other social factors also have an impact on the development of a household's energy consumption. Copyright © 2004 John Wiley & Sons, Ltd.     

Power allocation and call admission control in multi‐class traffic DS‐CDMA systems with imperfect power control

We deal with power allocation (PA) and call admission control (CAC) under imperfect power control (IPC) in the reverse link of direct sequence‐code division multiple access systems for supporting multi‐class traffic. First, we briefly review the optimum PA scheme under perfect power control (PPC) and the CAC scheme subject to an outage constraint on the total composite received power. Then, we analyze the outage degradation due to the power control error when the optimum reference power levels under PPC are used. In order to mitigate the outage degradation, we would modify the reference power levels by incorporating a call dropping strategy and an outage‐lowering strategy into the optimum PA scheme under PPC. Also, we derive a constraint inequality to determine the reverse link capacity under IPC. Finally, through numerical analyses, we compute the modified reference power levels under IPC and evaluate the reverse link capacity under IPC. Copyright © 2006 John Wiley & Sons, Ltd.     

Bandwidth‐satisfied routing in multi‐rate MANETs by cross‐layer approach

Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd.     

Performance analysis of an opportunistic multi‐user cognitive network with multiple primary users

Consider a multi‐user underlay cognitive network where multiple cognitive users concurrently share the spectrum with a primary network with multiple users. The channel between the secondary network is assumed to have independent but not identical Nakagami‐m fading. The interference channel between the secondary users (SUs) and the primary users is assumed to have Rayleigh fading. A power allocation based on the instantaneous channel state information is derived when a peak interference power constraint is imposed on the secondary network in addition to the limited peak transmit power of each SU. The uplink scenario is considered where a single SU is selected for transmission. This opportunistic selection depends on the transmission channel power gain and the interference channel power gain as well as the power allocation policy adopted at the users. Exact closed form expressions for the moment‐generating function, outage performance, symbol error rate performance, and the ergodic capacity are derived. Numerical results corroborate the derived analytical results. The performance is also studied in the asymptotic regimes, and the generalized diversity gain of this scheduling scheme is derived. It is shown that when the interference channel is deeply faded and the peak transmit power constraint is relaxed, the scheduling scheme achieves full diversity and that increasing the number of primary users does not impact the diversity order. Copyright © 2014 John Wiley & Sons, Ltd.