• Journal of Satellite, Information and Communications
• /
• v.1 no.1
• /
• pp.40-47
• /
• 2006

The next-generation mobile communication system are required to provide high-data-rate and high quality transmission over hostile radio channels. Orthogonal Frequency Division Multiplexing(OFDM) technique regarded as a most promising solution in mobile environment. This paper considers the issue of efficient subcarrier allocation for OFDM system in multi-service application. Proposed algorithm can consider channel gain of each service and divide subchannel. Proposed method considers priority of service and divide more subchannels in high priority service. When proposed algorithm compares with existent algorithm, the convergence rate improves and the calculation amount is decreased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.517-522
• /
• 2004

In this paper, we have analyzed the performance enhancement of Orthogonal Frequency Division Multiplexing/Quadrature Phase Shift Keying Modulation-Digital Microwave Radio(OFDM/QPSK-DMR) system using Band Limited-Pulse Shaping Filter(BL-PSF) over microwave channel environments. For performance enhancement, the one-tap adaptive equalizer is adopted in the OFDM/QPSK-DMR system and than both BER and signature curve performance are compared with those of single carrier DMR system. Computer simulations confirm that the OFDM/QPSK-DMR system using 16 sub-carrier increase the fade margin about 2 dB over microwave channel environments and that of performance using one-tap adaptive equalizer is highly increased the fade margin as the number of sub-carriers is larger.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.530-533
• /
• 2006

Recently, a basic access method about IEEE 802.11 MAC layer protocol using IEEE 802.11 wireless LANs is the DCF thatis based on the CSMA/CA. But, cause of IEEE 802.11 MAC layer uses original backoff algorithm (exponential backoff method), when collision occurred, the size of contention windows increases the double size. Also, a time of packet transmission delay increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs a proposed enhanced backoff algorithm. It is considered the transmission time of transmission control protocol (TCP) packet on the orthogonal frequency division multiplexing (OFDM) in additive white gaussian noise (AWGN) and Rician fading channel. From the results, a proposed enhanced backoff algorithm produces a better performance improvement than an original backoff in wireless LAN environment. Also, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between packet size and the transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.322-340
• /
• 2012

Orthogonal Frequency Division Multiplexing (OFDM) is usually regarded as a spectral efficient multicarrier modulation technique, yet it suffers from a high peak-to-average power ratio (PAPR) problem. Among all the existing PAPR reduction techniques in OFDM systems, side information based PAPR reduction techniques such as partial transmit sequence (PTS) and selective mapping (SLM) schemes, have attracted the most attention. However, the transmission of side information results in somewhat spectral loss and this does not significantly improve the bit error rate (BER) performance. Parallel combinatory (PC) OFDM yields higher spectral efficiency (SE) and better BER performance on Gaussian channels,while is a little but not obvious PAPR improvement over the ordinary OFDM system. This investigation aimed to design a 'perfect' OFDM system. We introduce the side information to rotate the subcarrier phases of our novel PC-OFDM system structure, and call this new system the SIPC(Side information based Parallel Combinatory)-OFDM system. The proposed system achieves better PAPR and SE performance. In addition, considering the tradeoff of system parameters, the proposed system also has the properties of a higher BER.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2063-2081
• /
• 2018

A resource allocation algorithm is proposed in this paper to simultaneously minimize the total system power consumption and maximize the system throughput for the downlink of multi-user multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems. With the Lagrange dual decomposition method, we transform the original problem to its convex dual problem and prove that the duality gap between the two problems is zero, which means the optimal solution of the original problem can be obtained by solving its dual problem. Then, we use convex optimization method to solve the dual problem and utilize bisection method to obtain the optimal dual variable. The numerical results show that the proposed algorithm is superior to traditional single-objective optimization method in both the system throughput and the system energy consumption.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.515-517
• /
• 2003

In this paper we examine the effects of the required portions of guard timing spaces in a MAC frame of ETSI BRAN HIPERLAN/2 system such as inter-mobile guard timing space in UL(Up Link) duration, inter-RCH(Random CHannel) guard timing space, sector switch guard timing space. In particular, we calculate the number of OFDM(Orthogonal Frequency Division Multiplexing) symbols required for these guard timing spaces in a MAC frame. We them evaluate the throughput of HIPERLAN/2 system as we vary parameter such as the guard time values defined in [2], the number of DLCCs(Data Link Control Connections), and the number of RCHs. Finally we show by numerical results that the portions for the 새심 summation of required guard timing spaces in a MAC frame are not negligible, and that they should be properly considered when trying to evaluate the performance of MAC protocol of HIPERLAN/2 system and also when determining the number of RCHs as well as the number of DLCCs in UL PDU trains at an AP/CC(Access Point/Central Controller).

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.1 s.6
• /
• pp.57-62
• /
• 2005

In this paper, we propose a channel estimation method by impulse signal train in OFDM. In order to estimate the channel response, 4 impulse signals are generated and transmitted during one OFDM (Orthogonal Frequency Division Multiplexing) symbol. The intervals between the impulse signals are all equal in time domain. At the receiver, the impulse response signals are summed and averaged. And then, the averaged impulse response signal is zero padded and fast Fourier transformed to obtain the channel estimation. The BER performance of the proposed method is compared with those of conventional estimation method using the long training sequence in fast fading environments. The simulation results show that the proposed method improves by 3 dB in terms of Eb/No, compared with the conventional method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2400-2413
• /
• 2019

Doubly-selective (DS) fading channel is often occurred in many orthogonal frequency division multiplexing (OFDM) communication systems, such as high-speed rail communication systems and underwater acoustic (UWA) wireless networks. It is challenging to provide an accurate and fast estimation over the doubly-selective channel, due to the strong Doppler shift. This paper addresses the doubly selective channel estimation problem based on complex exponential basis expansion model (CE-BEM) in OFDM systems from the perspective of distributed compressive sensing (DCS). We propose a novel DCS-based improved sparsity adaptive matching pursuit (DCS-IMSAMP) algorithm. The advantage of the proposed algorithm is that it can exploit the joint channel sparsity information using dynamic threshold, variable step size and tailoring mechanism. Simulation results show that the proposed algorithm achieves 5dB performance gain with faster operation speed, in comparison with traditional DCS-based sparsity adaptive matching pursuit (DCS-SAMP) algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2908-2924
• /
• 2019

Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

• ETRI Journal
• /
• v.44 no.3
• /
• pp.400-412
• /
• 2022

In cognitive radio networks (CRNs), the computational complexity of resource allocation algorithms is a significant problem that must be addressed. However, the high computational complexity of the optimal solution for tackling resource allocation in CRNs makes it inappropriate for use in practical applications. Therefore, this study proposes a power-based pricing algorithm (PPA) primarily to reduce the computational complexity in downlink CRN scenarios while restricting the interference to primary users to permissible levels. A two-stage approach reduces the computational complexity of the proposed mathematical model. Stage 1 assigns subcarriers to the CRN's users, while the utility function in Stage 2 incorporates a pricing method to provide a power algorithm with enhanced reliability. The PPA's performance is simulated and tested for orthogonal frequency-division multiplexing-based CRNs. The results confirm that the proposed algorithm's performance is close to that of the optimal algorithm, albeit with lower computational complexity of O(M log(M)).