• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.4
• /
• pp.181-190
• /
• 2014

This paper reports a cognitive radio network architecture based on overloaded multicarrier direct sequence code division multiple access (O-MC-DS-CDMA). The O-MC-DSCDMA technique combines CDMA with a multicarrier modulation technique to overcome the channel fading effects. In this technique, secondary users are enabled to share the available bandwidth with the existing primary users. Two sets of orthogonal Gold codes are used to support the primary and secondary users simultaneously. The orthogonality between the spreading codes is lost due to the non-zero cross correlation between the codes and the timing synchronization error in the uplink transmission, which causes interference between primary and secondary users. This paper proposes two modified hybrid parallel/successive interference cancellation techniques for primary and secondary user base station receivers with multiple antennas to suppress the interference among users. Interference among the same group of users is cancelled by parallel interference cancellation and the interference among groups is cancelled using successive interference cancellation. The simulation results confirmed that the proposed modified interference cancellation techniques show better BER performance over conventional interference cancellation techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5203-5217
• /
• 2018

In order to increase the capacity and improve the spectrum efficiency of wireless communication systems, this paper proposes a rate-based two-sided many-to-one matching game algorithm for energy-harvesting small cells with non-orthogonal multiple access (NOMA) in heterogeneous cellular networks (HCN). First, we use a heuristic clustering based channel allocation algorithm to assign channels to small cells and manage the interference. Then, aiming at addressing the user access problem, this issue is modeled as a many-to-one matching game with the rate as its utility. Finally, considering externality in the matching game, we propose an algorithm that involves swap-matchings to find the optimal matching and to prove its stability. Simulation results show that this algorithm outperforms the comparing algorithm in efficiency and rate, in addition to improving the spectrum efficiency.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.118-127
• /
• 2007

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to-end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay-to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end-to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• Journal of Convergence for Information Technology
• /
• v.10 no.9
• /
• pp.22-27
• /
• 2020

In the fifth generation (5G) networks, the mobile services require much faster connections than in the fourth generation (4G) mobile networks. Recently, as one of the promising 5G technologies, non-orthogonal multiple access (NOMA) has been drawing attention. In NOMA, the users share the frequency and time, so that the more users can be served simultaneously. NOMA has several superiorites over orthogonal multiple access (OMA) of long term evolution (LTE), such as higher system capacity and low transmission latency. In this paper, we investigate impact of channel estimation errors on successive interference cancellation (SIC) performance of NOMA. First, the closed-form expression of the bit-error rate (BER) with channel estimation errors is derived, And then the BER with channel estimation errors is compared to that with the perfect channel estimation. In addition, the signal-to-noise (SNR) loss due to channel estimation errors is analyzed.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.202-215
• /
• 2023

This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.4
• /
• pp.611-616
• /
• 2021

This paper investigates the improved outage probability of correlated superposition coding(CSC)/non-successive interference cancellation(SIC) non-orthogonal multiple access(NOMA) scheme. For this, first, we calculate the outage probability of the conventional independent superposition coding(ISC)/SIC NOMA scheme. Then, simulations demonstrate that the outage probability of CSC/non-SIC NOMA improves greatly, with respect to that of conventional ISC/SIC NOMA. As a result, CSC/non-SIC NOMA schemes could be a promising technique in 5G networks, especially with such improved outage probability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.59-69
• /
• 2018

In this paper, we present a robust beamforming design to tackle the weighted sum-rate maximization (WSRM) problem in a multicell multiple-input multiple-output (MIMO) - non-orthogonal multipleaccess (NOMA) downlink system for 5G wireless communications. This work consider the imperfectchannel state information (CSI) at the base station (BS) by adding uncertainties to channel estimation matrices as the worst-case model i.e., singular value uncertainty model (SVUM). With this observation, the WSRM problem is formulated subject to the transmit power constraints at the BS. The objective problem is known as on-deterministic polynomial (NP) problem which is difficult to solve. We propose an robust beam forming design which establishes on majorization minimization (MM) technique to find the optimal transmit beam forming matrix, as well as efficiently solve the objective problem. In addition, we also propose a joint user clustering and power allocation (JUCPA) algorithm in which the best user pair is selected as a cluster to attain a higher sum-rate. Extensive numerical results are provided to show that the proposed robust beamforming design together with the proposed JUCPA algorithm significantly increases the performance in term of sum-rate as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1029-1036
• /
• 2021

Recently it has been proposed that lossless 2-user non-orthogonal multiple access (NOMA) can be implemented without successive interference cancellation (SIC) via correlated superposition coding (CSC). However only the 2-user case was considered. Thus this paper proposes a lossless 3-user non-SIC NOMA scheme. This can be achieved via the 3-user CSC scheme. Simulations show that the lossless 3-user non-SIC NOMA scheme can be implemented over power allocation ranges of user-fairness.