• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.385-398
• /
• 2009

This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1425-1440
• /
• 2017

In wireless communications, antenna selection (AS) is a widely used method for reducing comparable cost of multiple RF chains in MIMO systems. As is well known, most of literatures on combining AS with MIMO techniques concern linear modulations such as phase shift keying (PSK) and quadrature amplitude modulation (QAM). The combination of CPM and MIMO has been considered an optimal choice that can improve its capacity without loss of power and spectrum efficiency. The aim of this paper is to investigate joint transmit and receive antenna selection (JTRAS) in CPM MIMO systems. Specifically, modified incremental and decremental JTRAS algorithms are proposed to adapt to arbitrary number of selected transmit or receive antennas. The computational complexity of several JTRAS algorithms is analyzed from the perspective of channel capacity. As a comparison, the performances of bit error rate (BER) and spectral efficiency are evaluated via simulations. Moreover, computational complexity of the JTRAS algorithms is simulated in the end. It is inferred from discussions that both incremental JTRAS and decremental JTRAS perform close to optimal JTRAS in BER and spectral efficiency. In the sense of practical scenarios, adaptive JTRAS can be employed to well tradeoff performance and computational complexity.

• ETRI Journal
• /
• v.45 no.5
• /
• pp.874-886
• /
• 2023

A joint resource-optimization scheme is investigated for nonorthogonal multiple access (NOMA)-enhanced scalable video coding (SVC) multicast in unmanned aerial vehicle (UAV)-assisted radio-access networks (RANs). This scheme allows a ground base station and UAVs to simultaneously multicast successive video layers in SVC with successive interference cancellation in NOMA. A video quality-maximization problem is formulated as a mixed-integer nonlinear programming problem to determine the UAV deployment and association, RAN spectrum allocation for multicast groups, and UAV transmit power. The optimization problem is decoupled into the UAV deployment-association, spectrum-partition, and UAV transmit-power-control subproblems. A heuristic strategy is designed to determine the UAV deployment and association patterns. An upgraded knapsack algorithm is developed to solve spectrum partition, followed by fast UAV power fine-tuning to further boost the performance. The simulation results confirm that the proposed scheme improves the average peak signal-to-noise ratio, aggregate videoreception rate, and spectrum utilization over various baselines.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.3-9
• /
• 2014

We propose energy efficient transmit and receive strategies for nomadic M2M devices. Recently, communication applications consume more and more battery. Hence, the efficient battery management is becoming increasingly important. Turbo code as a channel coding is being widely used in many communication areas. Accordingly, the efficient energy management in using turbo code is an important issue. In this paper, we optimize joint transmit and receive energy for M2M devices pair. We first model the transmit energy and receive energy. Then, we develop the energy efficient transmit and receive strategies.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.65-72
• /
• 2021

We consider the joint optimization problem of transmit power level, MMSE receiver filter and access point(AP) selection for multi access points environment. In the previous work, transmit power and MMSE receiver filter were jointly optimized[1] and transmit power and best access point were optimized jointly[2]. For each case, the algorithm was proposed and its convergence which guarantees the minimum total transmit power was proved. In this paper, we further improve the algorithm by jointly optimizing three parameters. More specifically, 1) we propose the algorithm by considering transmit power, MMSE receiver filter and access point selection jointly. 2) we prove that the proposed algorithm guarantees convergence with minimum transmit power consumption. In the simulation results, it is shown that proposed algorithm outperforms two other algorithms, i.e., 1) algorithm with transmit power and MMSE receiver filter, and 2) algorithm with transmit power and best access point selection.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.2
• /
• pp.37-47
• /
• 1996

This paper presents an automatic tele-inspection scheme for the remotely manufacturing process. The remote-manufacturing process is continuously monitored and a crucial process is captured by CCD Camera. The captured image is compressed by neural network and JPEG, and it is sent directly to the assembly plant for incoming inspection. Massive image data require broadband channel to transmit them to remote distance, but sender is able to transmit them to receiver in use common channel by compressing massive image data in the high ratio. After the receiver reconstructs the compressed image to be transmitted, the reconstructed image is also directly used for automatic inspection of the process. The Experimental results show that the proposed inspection mechanism could be effectively implemented for real applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2047-2066
• /
• 2016

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

• Current Optics and Photonics
• /
• v.3 no.4
• /
• pp.320-328
• /
• 2019

A method for joint-transform correlator (JTC) multiple-image encryption based on a quick-response (QR) code key is proposed. The QR codes converted from different texts are used as key masks to encrypt and decrypt multiple images. Not only can Chinese text and English text be used as key text, but also symbols can be used. With this method, users have no need to transmit the whole key mask; they only need to transmit the text that is used to generate the key. The correlation coefficient is introduced to evaluate the decryption performance of our proposed cryptosystem, and we explore the sensitivity of the key mask and the capability for multiple-image encryption. Robustness analysis is also conducted in this paper. Computer simulations and experimental results verify the correctness of this method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.247-260
• /
• 2007

This paper solves the problem of finding a suitable sub-channel and power joint allocation method for multiple users in 802.16e OFDMA/TDD cellular systems. The joint allocation is thatfirstly the sub-channel is allocated to the users and then suitable power is allocated. We propose a FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm which is a dynamic channel allocation algorithm considering all users' channel state information conditionally to maximize fairness and throughput. The improved CHC algorithm, which is dynamic power allocation algorithm, is also proposed in this paper The Improved CHC algorithm collects the extra of the downlink transmit power and then re-allocates it to other users. Simulation results show that the proposed improved CHC algorithm additionally increases the fairness and sector throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2826-2834
• /
• 2013

In mobile ad hoc networks (MANET), power-saving technology of mobile nodes is divided into transmit power control (TPC), power-saving mode (PSM), and routing. TPC and PSM are operated in physical layer but the routing is managed in network layer, so the design of a joint algorithm is needed to provide better performance. Therefore, in this paper, we propose a joint power-saving and routing algorithm for maximizing the network lifetime while satisfying the end-to-end data rate in ad hoc networks. The proposed algorithm first applies the TPC or PSM to reduce the power consumption of mobile nodes and then performs the routing by considering the decided node lifetime in order to maximize the path lifetime. Simulation results show that the proposed algorithm maximize the lifetime while satisfying the required rate according to the number of mobile nodes and the level of interference.