• Title/Summary/Keyword: communication channels

Search Result 1,562, Processing Time 0.038 seconds

Characteristics Analysis of Powerline Channel for Powerline Communication (전력선 통신을 위한 채널 특성 분석)

  • Lee, J.H.;Seo, J.W.;Lee, J.J;Shin, M.C.;Sung, N.H.
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.558-560
    • /
    • 2000
  • The role of power line is not limited to providing electrical power. Power line fumed out to be an candidate to cope with the existing communication channels. It is need to be measured the properties of power line as communication channels, before successful communication system is possible. This paper presents the characteristics of power line noise and attenuation measurements in the frequency range of $0{\sim}10$ MHz, and then suggests applicable communication techniques in brief. Power line channel is configured in our laboratory and the length of it is 250 meters.

  • PDF

A Verified Formal Specification of A Secured Communication Method For Smart Card Applications

  • Kim, Donald D.
    • Journal of Appropriate Technology
    • /
    • v.7 no.2
    • /
    • pp.172-187
    • /
    • 2021
  • In remote villages without access to modern IT technology, simple devices such as smartcards can be used to carry out business transactions. These devices typically store multiple business applications from multiple vendors. Although devices must prevent malicious or accidental security breaches among the applications, a secure communication channel between two applications from different vendors is often required. In this paper, first, we propose a method of establishing secure communication channels between applications in embedded operating systems that run on multi-applet smart cards. Second, we enforce the high assurance using an intransitive noninterference security policy. Thirdly, we formalize the method through the Z language and create the formal specification of the proposed secure system. Finally, we verify its correctness using Rushby's unwinding theorem.

Channel Assignment Sequence Optimization Under Fixed Channel Assignment Scheme (채널 고정 할당 방식 이동통신 시스템에서 채널 할당 순서 최적화)

  • Han, Jung-Hee
    • Journal of Information Technology Services
    • /
    • v.9 no.2
    • /
    • pp.163-177
    • /
    • 2010
  • In this paper, we consider a channel ordering problem that seeks to maximize the service quality in mobile radio communication systems. If a base station receives a connection request from a mobile user, one of the empty channels belonging to the base station is assigned to the mobile user. In case multiple empty channels are available, we can choose one that incurs least interference with other channels assigned to adjacent base stations. However, note that a pair of channels that are not separated enough generates interference only if both channels are assigned to mobile users. That is, interference between channels may vary depending on the channel assignment sequence for each base station and on the distribution of mobile users. To find a channel assignment sequence that seems to generate minimum interference, we develop an optimization model considering various scenarios of mobile user distribution. Simulation results show that channel assignment sequence determined by the scenario based optimization model significantly reduces the interference provided that scenarios and interference cost are properly generated.

Characteristics and Comparison of Popular Channels on Internet Game Broadcasting: Focus on Twitch TV (인터넷 게임 방송에서 나타나는 인기 채널의 특징과 비교: Twitch TV를 중심으로)

  • Han, Sukhee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.4
    • /
    • pp.7-14
    • /
    • 2016
  • This study analyzes popular channels of America's Twitch TV that centers on video game among several Internet broadcasting services. Afreeca TV de facto monopolizes the Internet broadcasting industry in South Korea; however, Twitch TV is popular around the globe and tries to expand business in Korea. Specifically, this study collects data of popular domestic/international channels on every Friday 9:00 p.m. 20 times, and examines differences of between those channels: 1) the number of the audience(users) 2) the frequency of games 3) the genre of games 4) nationality of games. Internet broadcasting streaming service does not have a concept of ratings, but it could be categorized as popular based on users connecting the channels. Thus, this study studies characteristics of Twitch TV, and further discusses the future of the Internet broadcasting.

An Efficient Stochastic Channel Selection Algorithm for Cognitive Radio Networks (무선인지시스템을 위한 효율적인 채널 선택 알고리즘)

  • Pham, Thi Hong Chau;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.29-35
    • /
    • 2009
  • An efficient stochastic channel selection algorithm for cognitive radio networks is proposed and analyzed in this paper. With the new algorithm utilizing quality of channels, the stationary level of the channels in idle state and history performance, we can find the best channel for secondary users to transmit data. Moreover, this method not only restricts channel switching of secondary users but also adapts to random resource environment of cognitive radio network. The advantages of the proposed algorithm are demonstrated clearly through computer simulation.

  • PDF

Regularized Zero-Forcing Beam Design under Time-Varying Channels

  • Yu, Heejung;Kim, Taejoon
    • ETRI Journal
    • /
    • v.38 no.3
    • /
    • pp.435-443
    • /
    • 2016
  • In this paper, an efficient beam tracking algorithm for a regularized zero-forcing (RZF) approach in slowly fading multiple-input and single-output (MISO) broadcast channels is considered. By modifying an RZF equation, an RZF beam tracking algorithm is proposed using matrix perturbation theory. The proposed algorithm utilizes both beams from the previous time step and channel difference (between the previous and current time steps) to calculate the RZF beams. The tracking performance of the proposed algorithm is analyzed in terms of the mean square error (MSE) between a tracking approach and an exact recomputing approach, and in terms of the additional MSE caused by the beam tracking error at the receiver. Numerical results show that the proposed algorithm has almost the same performance as the exact recomputing approach in terms of the sum rate.

Soft-Decision for Differential Amplify-and-Forward over Time-Varying Relaying Channel

  • Gao, Fengyue;Kong, Lei;Dong, Feihong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1131-1143
    • /
    • 2016
  • Differential detection schemes do not require any channel estimation, which can be employed under user mobility with low computational complexity. In this work, a soft-input soft-output (SISO) differential detection algorithm is proposed for amplify-and-forward (AF) over time-varying relaying channels based cooperative communications system. Furthermore, maximum-likelihood (ML) detector for M-ary differential Phase-shift keying (DPSK) is derived to calculate a posteriori probabilities (APP) of information bits. In addition, when the SISO is exploited in conjunction with channel decoding, iterative detection and decoding approach by exchanging extrinsic information with outer code is obtained. Finally, simulation results show that the proposed non-coherent approach improves detection performance significantly. In particular, the system can obtain greater performance gain under fast-fading channels.

The imaging of 128 channels cardiac activation signal (128채널 심장전기도 신호의 영상화)

  • Han, Young-Oh
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.2
    • /
    • pp.133-137
    • /
    • 2010
  • In this study, The imaging of 128 channels cardiac activation signal is implemented. It is performed within one minutes and very useful in open-heart operation with analysis in a short time. Especially the keeping of data and the moving of system is facility because it was implemented with being based on PC. The cardiologist can call data and analysis them anytime after a surgery.

Compensation of the Distorted 640 Gbps WDM Signals using Optical Phase Conjugator

  • Lee, Seong-Real;Lee, Young-Gyo
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.273-280
    • /
    • 2007
  • The numerical methods for finding the optimal parameters in 640 Gbps (16 channels $\times$ 40 Gbps) WDM system with optical phase conjugator (OPC) are proposed, which effectively compensate the distorted overall WDM channels. The considered optimal parameters are the OPC position and the dispersion coefficient of fibers. The numerical approaches are accomplished through two different procedures. One of these procedures is that the optimal OPC position is previously searched and then the optimal dispersion coefficient is searched at the obtained optimal OPC position. The other is the reverse of the above procedure. From the numerical results, it is confirmed that two optimal parameters depend on each other, but less related with the searching procedure. The methods proposed in this research will be expected to alternate with the method of making a symmetrical distribution of power and local dispersion in real optical link which is a serious problem of applying the OPC into multi-channels WDM system.

Efficient Power Allocation Algorithm for Wireless Networks (무선망의 효율적 전력 할당 알고리즘)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.103-108
    • /
    • 2016
  • In communication systems the solution of the problem of maximizing the mutual information between the input and output of a channel composed of several subchannels under total power constraint has a waterfilling structure. OFDM and MIMO can be decomposed into parallel subchannels with CSI. Waterfilling solves the problem of optimal power allocation to these subchannels to achieve the rate approaching the channel capacity under total power constraint. In waterfilling, more power is alloted to good channels(high SNR) and less or no power to bad channels to increase the rate of good channels, resulting in channel capacity. Waterfilling finds the exact water level satisfying the power constraint employing an iterative algorithm to estimate and update the water level. In this process computation of partial sums of inverse of square of subchannel gain is repeatedly required. In this paper we reduced the computation time of waterfilling algorithm by replacing the partial sum computation with reference to an array which contains the precomputed partial sums in initialization phase.