• Title/Summary/Keyword: Multiple Channels

Search Result 902, Processing Time 0.032 seconds

Independent Component Analysis Based MIMO Transceiver With Improved Performance In Time Varying Wireless Channels

  • Uddin, Zahoor;Ahmad, Ayaz;Iqbal, Muhammad;Shah, Nadir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2435-2453
    • /
    • 2015
  • Independent component analysis (ICA) is a signal processing technique used for un-mixing of the mixed recorded signals. In wireless communication, ICA is mainly used in multiple input multiple output (MIMO) systems. Most of the existing work regarding the ICA applications in MIMO systems assumed static or quasi static wireless channels. Performance of the ICA algorithms degrades in case of time varying wireless channels and is further degraded if the data block lengths are reduced to get the quasi stationarity. In this paper, we propose an ICA based MIMO transceiver that performs well in time varying wireless channels, even for smaller data blocks. Simulation is performed over quadrature amplitude modulated (QAM) signals. Results show that the proposed transceiver system outperforms the existing MIMO system utilizing the FastICA and the OBAICA algorithms in both the transceiver systems for time varying wireless channels. Performance improvement is observed for different data blocks lengths and signal to noise ratios (SNRs).

Implementation of IEEE 802.15.4 Channel Analyzer for Evaluating WiFi Interference (WiFi의 간섭을 평가하기 위한 IEEE 802.15.4 채널분석기의 구현)

  • Song, Myong-Lyol;Jin, Hyun-Joon
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.63 no.2
    • /
    • pp.81-88
    • /
    • 2014
  • In this paper, an implementation of concurrent backoff delay process on a single chip with IEEE 802.15.4 hardware and 8051 processor core that can be used for analyzing the interference on IEEE 802.15.4 channels due to WiFi traffics is studied. The backoff delay process of IEEE 802.15.4 CSMA-CA algorithm is explained. The characteristics of random number generator, timer, and CCA register included in the single chip are described with their control procedure in order to implement the process. A concurrent backoff delay process to evaluate multiple IEEE 802.15.4 channels is proposed, and a method to service the associated tasks at sequentially ordered backoff delay events occurring on the channels is explained. For the implementation of the concurrent backoff delay process on a single chip IEEE 802.15.4 hardware, the elements for the single channel backoff delay process and their control procedure are used to be extended to multiple channels with little modification. The medium access delay on each channel, which is available after execution of the concurrent backoff delay process, is displayed on the LCD of an IEEE 802.15.4 channel analyzer. The experimental results show that we can easily identify the interference on IEEE 802.15.4 channels caused by WiFi traffics in comparison with the way displaying measured channel powers.

Implementation and Test of RELAY Module for Multiple SNS Channels (다중 SNS 채널을 위한 RELAY 모듈의 구현 및 실험)

  • Ahn, Heui-Hak;Lee, Dae-Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.362-369
    • /
    • 2018
  • In this paper, we propose a procedure to multiple SNS channels automatic streaming through multiple output channels including the output channel of an external streaming server. The multiple SNS channels automatic streaming server includes an output management module for controlling the transmission of video contents to RELAY module that establish two or more output channels. In this paper, we experimented by separate with HD and FHD video using RELAY module in multiple SNS channel automatic streaming. In stream modules using RELAY module of HD video, when the publisher client and the player client and the RELAY module are 1 channel, the occupancy rate of CPU is 0.6% and the occupancy rate of heap memory is 0.3%(20 Mbyte). When the publisher client and the player client and the RELAY module are 183 channels, the occupancy rate of CPU is 99.9% and the occupancy rate of heap memory is 45.8%(3.7Gbyte). Therefore, the paper is not limited to the size of the streaming server by extending the output channel from which the video is transmitted to the output channel of the external streaming server. And a process of allocating an output channel of an external streaming server to an output channel through which an video is transmitted can be easily performed, so that an efficient output channel management can be performed even when a plurality of videos are transmitted.

Data Allocation for Multiple Broadcast Channels (다중 방송채널을 위한 데이타 할당)

  • Jung Sungwon;Nam Seunghoon;Jeong Horyun;Lee Wontaek
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.86-101
    • /
    • 2006
  • The bandwidth of channel and the power of the mobile devices are limited on a wireless environment. In this case, data broadcast has become an excellent technique for efficient data dissemination. A significant amount of researches have been done on generating an efficient broadcast program of a set of data items with different access frequencies over multiple wireless broadcast channels as well as single wireless broadcast channel. In this paper, an efficient data allocation method over multiple wireless broadcasting channels is explored. In the traditional approaches, a set of data items are partitioned into a number of channel based on their access probabilities. However, these approaches ignore a variation of access probabilities of data items allocated in each channel. In practice, it is difficult to have many broadcast channels and thus each channel need to broadcast many data items. Therefore, if a set of data items broadcast in each channel have different repetition frequencies based on their access frequencies, it will give much better performance than the traditional approaches. In this paper, we propose an adaptive data allocation technique based on data access probabilities over multiple broadcast channels. Our proposed technique allows the adaptation of repetition frequency of each data item within each channel by taking its access probabilities into at count.

Generalized Distributed Multiple Turbo Coded Cooperative Differential Spatial Modulation

  • Jiangli Zeng;Sanya Liu;Hui Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.999-1021
    • /
    • 2023
  • Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

Closed-form Capacity Analysis for MIMO Rayleigh Channels

  • Humayun Kabir, S. M.;Pham, Van-Su;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.49-52
    • /
    • 2008
  • In this letter, we derive a tight closed form formula for an ergodic rapacity of a multiple-input multiple-output (MIMO) for the application of wireless communications. The derived expression is a simple close-form formula to determine the ergodic capacity of MIMO systems. Assuming the channels are independent and identically distributed (i.i.d.) Rayleigh flat-fading between antenna pairs, the ergodic capacity can be expressed in a closed form as the finite sum of exponential integrals.

  • PDF

Regularized Channel Inversion for Multiple-Antenna Users in Multiuser MIMO Downlink (다중 안테나 다중 사용자 하향 링크 환경에서 Regularized Channel Inversion 기법)

  • Lee, Heun-Chul;Lee, Kwang-Won;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.260-268
    • /
    • 2010
  • Channel inversion is one of the simplest techniques for multiuser downlink systems with single-antenna users. In this paper, we extend the regularized channel inversion technique developed for the single-antenna user case to multiuser multiple-input multiple-output (MIMO) channels with multiple-antenna users. We first employ the multiuser preprocessing to project the multiuser signals near the null space of the unintended users based on the MMSE criterion, and then the single-user preprocessing is applied to the decomposed MIMO interference channels. In order to reduce the complexity, we focus on non-iterative solutions for the multiuser transmit beamforming and use a linear receiver based on an MMSE criterion. Simulation results show that the proposed scheme outperforms existing joint iterative algorithms in most multiuser configurations.

Low Complexity Multiuser Scheduling in Time-Varying MIMO Broadcast Channels

  • Lee, Seung-Hwan;Lee, Jun-Ho
    • Journal of electromagnetic engineering and science
    • /
    • v.11 no.2
    • /
    • pp.71-75
    • /
    • 2011
  • The sum-rate maximization rule can find an optimal user set that maximizes the sum capacity in multiple input multiple output (MIMO) broadcast channels (BCs), but the search space for finding the optimal user set becomes prohibitively large as the number of users increases. The proposed algorithm selects a user set of the largest effective channel norms based on statistical channel state information (CSI) for reducing the computational complexity, and uses Tomlinson-Harashima precoding (THP) for minimizing the interference between selected users in time-varying MIMO BCs.

Performance Evaluation of Zone-based Registration in COMA Mobile Communication System (CDMA 이동통신 시스템에서 영역기준 위치등록 방법의 성능분석)

  • Baek, Jang-Hyun;Lie, Chang-Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.689-703
    • /
    • 1996
  • In this paper, we evaluate the performance of zone-based registration. First, we propose a mobility function for single zone-based registration. And we establish the circumstances of multiple zone-based registration, which is based on the mobility function for single zone-based registration, and perform simulation programs for the circumstances. Using the simulation results, we obtain optimal N, the number of multiple zones which minimizes signalling traffic in radio channels. Results show that in most cases optimal N is 2. Multiple zone-based registration has less signalling traffic in radio channels than single zone-based registration and zone-based registration must be implemented as multiple zone-based registration.

  • PDF

An Index Allocation Method for the Broadcast Data in Mobile Environments with Multiple Wireless Channels (멀티무선채널을 갖는 모바일 환경에서 브로드캐스트 데이타를 위한 인덱스 할당 방법)

  • 이병규;정성원;이승중
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.37-52
    • /
    • 2004
  • Broadcast has been often used to disseminate the frequently requested data efficiently to a large volume of mobile units over a single or multiple channels. Since the mobile units have limited battery power, the minimization of the access time for the broadcast data is an important problem. There have been many research efforts that focus on the improvement if the broadcast techniques by providing indexes on the broadcast data. In this paper, we studied an efficient index allocation method for the broadcast data over multiple physical channels, which cannot be coalesced into a single high bandwidth channel. Previously proposed index allocation techniques either require the equal size of index and data or have a performance degradation problem when the number of given physical channels is not enough. These two problems will result in the increased average access time for the broadcast data. To cope with these problems, we propose an efficient tree- structured index allocation method for the broadcast data with different access frequencies over multiple physical channels. Our method minimizes the average access time for the broadcast data by broadcasting the hot data and their indexes more often than the less hot data and their indexes. We present an in-0e0th experimental and theoretical analysis of our method by comparing it with other similar techniques. Our performance analysis shows that it significantly decrease the average access time for the broadcast data over existing methods.