• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.284-286
• /
• 2009

In this paper, we consider a cognitive radio system operating as secondary user. It uses an empty channel that is not currently used by primary users having the license to the channel. In the previous works, secondary user looks for an empty channel by choosing any channel in order or randomly and by sensing the channel to distinguish whether primary users are using. But if primary user is fixed type, we will find an empty channel faster than the mentioned channel selecting methods by using a method considering prior information about cases that primary user used the channel, since it is possible to analogize the channel access possibility of primary user according to regular time and position. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving throughput of secondary users. Firstly, we determine a weighting value of each channel based on the history of channel activities of primary users. This value is added to current channel state buffer and we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of the average channel searching time and the average number of transmissions of secondary user.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.579-582
• /
• 2001

The performance of a coherent rake receiver of DS-CDMA systems is significantly affected by the accuracy of channel estimation. The performance of the channel estimator can be improved by employing a channel estimation filter (CEF) whose impulse response is adjusted according to the channel condition. In this paper, we consider the design of an adaptive channel estimator for DS-CDMA systems with a pilot channel. The proposed channel estimator estimates the channel condition, which can be performed without haying exact a priori information on the operating condition. The estimated channel condition adjusts the impulse response of the CEF. Numerical results show that the use of the proposed channel estimator can provide BER performance quite robust to a wide range of channel condition.

• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.338-351
• /
• 2013

Multiple-input multiple-output (MIMO) communication may provide high spectral efficiency through the deployment of a very large number of antenna elements at the base stations. The gains from massive MIMO communication come from the use of multi-user MIMO on the uplink and downlink, but with a large excess of antennas at the base station compared to the number of served users. Initial work on massive MIMO did not fully address several practical issues associated with its deployment. This paper considers the impact of channel aging on the performance of massive MIMO systems. The effects of channel variation are characterized as a function of different system parameters assuming a simple model for the channel time variations at the transmitter. Channel prediction is proposed to overcome channel aging effects. The analytical results on aging show how capacity is lost due to time variation in the channel. Numerical results in a multicell network show that massive MIMO works even with some channel variation and that channel prediction could partially overcome channel aging effects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.855-868
• /
• 2012

In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3655-3673
• /
• 2014

Rendezvous is a process of two or more cognitive radio nodes gathering on the same channel at the same time for a negotiation to establish data communications. This paper discusses rendezvous issues in cognitive radio networks. It details why rendezvous is an issue in cognitive radio networks and how rendezvous works. It classifies channel access methods, and details sequence-based channel-hopping methods. It surveys existing works on blind rendezvous and compares the proposed algorithms in terms of the maximum time to rendezvous. This paper discusses the properties that an efficient channel-hopping rendezvous algorithm should have and illustrates common issues in the existing rendezvous methods. It also explains open research issues in the rendezvous area.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2012.02a
• /
• pp.344-345
• /
• 2012

The Gate-Induced-Drain-Leakage (GIDL) current with channel doping and width dependence are characterized. The GIDL currents are found to increase in MOSFETs with higher channel doping levels and the observed GIDL current is generated by the band-to-band-tunneling (BTBT) of electron through the reverse-biased channel-to-drain p-n junction. A BTBT model is used to fit the measured GIDL currents under different channel-doping levels. Good agreement is obtained between the modeled results and experimental data. The increase of the GIDL current at narrower widths in mainly caused by the stronger gate field at the edge of the shallow trench isolation (STI). As channel width decreases, a larger portion of the GIDL current is generated at the channel-isolation edge. Therefore, the stronger gate field at the channel-isolation edge causes the total unit-width GIDL current to increases for narrow-width devices.

• The Journal of Information Systems
• /
• v.28 no.3
• /
• pp.25-38
• /
• 2019

Purpose This study aims to empirically analyze which factors affect image and preference of YouTube beauty channels. Some practical and academic implications are presented through empirical research. Design/methodology/approach For this purpose, the six affecting factors were suggested on the basis of previous studies. We proposed image quality, user attitude, empirical value, economics, and awareness as independent variables and channel image and channel preference as dependent variables in order to investigate the causal relationships among the research variables. We surveyed 311 users who had experience in using YouTube Beauty channel and analyzed the data by using a statistical package. Findings This study showed that the channel image has a partial mediating effect between the affecting variables and the channel preference. The results provided some insights and information to increase the number of subscribers and site views. Several suggestions were carefully made.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.2
• /
• pp.17-22
• /
• 2012

This paper deals with a precoder design method when the system has imperfect channel information. When MIMO relay system knows the correlation coefficient between perfect channel and imperfect channel information and the variance of the difference between perfect channel and correlated imperfect channel, source and relay precoders are designed to maximize the upper bound of the channel capacity. Also, we investigate channel capacities of the system using proposed precoder and compare with the optimal value according to the correlation and the variance of error channel by simulations.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.165-173
• /
• 2002

In the static channel assignment scheme for cellular mobile computing environment, each cell has a fixed number of channels and supports a service for a user′s request entering to the cell. This scheme has an advantage of simplicity. However, this scheme has a disadvantage that can′t control far hot cell problem. Therefore, to solve this problem, the "channel borrowing" concept is needed. In this paper, we propose a load balancing(channel borrowing, channel reassignment) approach using genetic algorithm. The purposes of using genetic algorithm in this paper are ${\circled1}$ to find early a cell including an available channel and ${\circled2}$ to decrease a number of probings and ${\circled3}$ to migrate to the cell after searching an available channel near upon optimality. To represent effectiveness of the proposed algorithm, we simulated various experiments.