• Title/Summary/Keyword: Multiple Channels

Search Result 908, Processing Time 0.021 seconds

Estimation of Sparse Channels in Millimeter-Wave MU-MIMO Systems

  • Hu, Anzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2102-2123
    • /
    • 2016
  • This paper considers a channel estimation scheme for millimeter-wave multiuser multiple-input multiple-output systems. According to the proposed method, parts of the beams are selected and the channel parameters are estimated according to the sparsity of channels and the orthogonality of the beams. Since the beams for each channel become distinct and the signal power increases with the increased number of antennas, the proposed approach is able to achieve good estimation performance. As a result, the sum rate can be increased in comparison with traditional approaches, and channels can be estimated with fewer pilot symbols. Numerical results verify that the proposed approach outperforms traditional approaches in cases with large numbers of antennas.

Scramble and Descramble Scheme on Multiple Images (다수의 영상에 대한 스크램블 및 디스크램블 방법)

  • Kim Seung-Youl;You Young-Gap
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.6
    • /
    • pp.50-55
    • /
    • 2006
  • This paper presents a scheme which scrambles and descrambles images from multiple video channels. A combined image frame is formed by concatenating the incoming frames from channels in a two dimensional array. This algorithm employs an encryption scheme on row and column numbers of the combined image frame and thereby yields an encrypted combined image. The proposed algorithm is to encrypt multiple images at a time since it recomposes images from multiple video channels yielding one by composite image, and encrypts the composite image resulting In higher security.

  • PDF

A Data Allocation Method based on Broadcast Disks Using Indices over Multiple Broadcast Channels (다중방송 채널에서 인덱스를 이용한 브로드캐스트 디스크 기반의 데이타 할당 기법)

  • Lee, Won-Taek;Jung, Sung-Won
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.272-285
    • /
    • 2008
  • In this paper, we concentrate on data allocation methods for multiple broadcast channels. When the server broadcasts data, the important issue is to let mobile clients access requested data rapidly. Previous works first sorted data by their access probabilities and allocate the sorted data to the multiple channels by partitioning them into multiple channels. However, they do not reflect the difference of access probabilities among data allocated in the same channel. This paper proposes ZGMD allocation method. ZGMD allocates data item on multiple channels so that the difference of access probability in the same channel is maximized. ZGMD allocates sorted data to each channels and applies Broadcast Disk in each channel. ZGMD requires a proper indexing scheme for the performance improvement. This is because in ZGMD method each channel got allocated both hot and cold data. As a result, the sequential search heuristic does not allow the mobile client to access hot data items quickly. The proposed index scheme is based on using dedicated index channels in order to search the data channel where the requested data is. We show that our method achieve the near-optimal performance in terms of the average access time and significantly outperforms the existing methods.

Multi-Channel/Radio based CAC Mechanism for Wireless Ad-hoc Networks (무선 애드혹 통신망용 멀티 채널/라디오 기반 호접속 제어 메저니즘)

  • Ko, Sung-Won;Kang, Min-Su;Kim, Young-Han
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.5
    • /
    • pp.396-404
    • /
    • 2007
  • In this paper, an Ad-hoc Routing Protocol which works in wireless Ad-hoc communication networks with multiple radios and multiple channels, and controls call admission based on bandwidth measurement is proposed. Unlike the conventional Ad-hoc node with a single radio using a single channel, an Ad-hoc node of the protocol proposed, MCQosR(Multiple Channel Quality of Service Routing), has multiple radios and uses multiple channels, which makes full duplex transmission between wireless Ad-hoc nodes, and reduces the intra interference on a route. Also, a fixed channel only for reception at each node enables the measurement of the available bandwidth, which is used to control the call admission for QoS provision. The performance of MCQosR is verified by simulation.

Embedded Zerotree Wavelet Coding Based On Multiple Description (다중 기술에 근거한 엠베디드 제로트리 웨이블릿 부호화)

  • Eom, Il-Gyu
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.3
    • /
    • pp.42-48
    • /
    • 2002
  • Multiple description coding Is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction. This paper presents an efficient multiple description coder using a newly designed EZW coding method. We first propose EZW coder which has expanded threshold and two subordinate passes. And then we present multiple description coder which has two coding channels using the proposed EZW coders. To evaluate the performance of the proposed coder, we provide an image coding applications with two descriptions and compare multiple description image coding results reported to date. Simulation results show that the proposed method has a better performance than the polyphase transform method.

Time Division Transmission of Visible Light Channels Using Power Line Frequency (전력선 주파수를 이용한 가시광 채널의 시분할 전송)

  • Lee, Seong-Ho
    • Journal of Sensor Science and Technology
    • /
    • v.23 no.5
    • /
    • pp.349-355
    • /
    • 2014
  • In this paper, we developed a new method to transmit multiple visible light channels in time division mode using the AC power line frequency in order to prevent the crosstalk between adjacent optical signals. Synchronizing pulses are generated from the 220 V power line, and one pulse period is subdivided into several time slots for visible light channels. Each channel transmits data in a predefined time slot without interfering adjacent channels. In experiments, synchronizing pulses with a repetition rate of 240 Hz were generated from the 60 Hz power line, and three VLC channels with a bit rate of 9.6 kbps transmitted data independently using the time slots between synchronizing pulses. This configuration is very useful in constructing time division VLC networks for multiple sensors.

An Energy Efficient Multichannel MAC Protocol for QoS Provisioning in MANETs

  • Kamruzzaman, S.M.;Hamid, Md. Abdul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.684-702
    • /
    • 2011
  • This paper proposes a TDMA-based multichannel medium access control (MAC) protocol for QoS provisioning in mobile ad hoc networks (MANETs) that enables nodes to transmit their packets in distributed channels. The IEEE 802.11 standard supports multichannel operation at the physical (PHY) layer but its MAC protocol is designed only for a single channel. The single channel MAC protocol does not work well in multichannel environment because of the multichannel hidden terminal problem. Our proposed protocol enables nodes to utilize multiple channels by switching channels dynamically, thus increasing network throughput. Although each node of this protocol is equipped with only a single transceiver but it solves the multichannel hidden terminal problem using temporal synchronization. The proposed energy efficient multichannel MAC (EM-MAC) protocol takes the advantage of both multiple channels and TDMA, and achieves aggressive power savings by allowing nodes that are not involved in communications to go into power saving "sleep mode". We consider the problem of providing QoS guarantee to nodes as well as to maintain the most efficient use of scarce bandwidth resources. Our scheme improves network throughput and lifetime significantly, especially when the network is highly congested. The simulation results show that our proposed scheme successfully exploits multiple channels and significantly improves network performance by providing QoS guarantee in MANETs.

Secure Broadcasting Using Multiple Antennas

  • Ekrem, Ersen;Ulukus, Sennur
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.411-432
    • /
    • 2010
  • We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memoryless channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.

Heuristic Algorithms for Constructing Interference-Free and Delay-Constrained Multicast Trees for Wireless Mesh Networks

  • Yang, Wen-Lin;Kao, Chi-Chou;Tung, Cheng-Huang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.269-286
    • /
    • 2011
  • In this paper, we study a problem that is concerning how to construct a delay-constrained multicast tree on a wireless mesh network (WMN) such that the number of serviced clients is maximized. In order to support high-quality and concurrent interference-free transmission streams, multiple radios are implemented in each mesh node in the WMNs. Instead of only orthogonal channels used for the multicast in the previous works, both orthogonal and partially overlapping channels are considered in this study. As a result, the number of links successfully allocated channels can be expected to be much larger than that of the approaches in which only orthogonal channels are considered. The number of serviced subscribers is then increased dramatically. Hence, the goal of this study is to find interference-free and delay-constrained multicast trees that can lead to the maximal number of serviced subscribers. This problem is referred as the MRDCM problem. Two heuristics, load-based greedy algorithm and load-based MCM algorithm, are developed for constructing multicast trees. Furthermore, two load-based channel assignment procedures are provided to allocate interference-free channels to the multicast trees. A set of experiments is designed to do performance, delay and efficiency comparisons for the multicast trees generated by all the approximation algorithms proposed in this study.

Beamforming for Downlink Multiuser MIMO Time-Varying Channels Based on Generalized Eigenvector Perturbation

  • Yu, Heejung;Lee, Sok-Kyu
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.869-878
    • /
    • 2012
  • A beam design method based on signal-to-leakage-plus-noise ratio (SLNR) has been recently proposed as an effective scheme for multiuser multiple-input multiple-output downlink channels. It is shown that its solution, which maximizes the SLNR at a transmitter, can be simply obtained by the generalized eigenvectors corresponding to the dominant generalized eigenvalues of a pair of covariance matrices of a desired signal and interference leakage plus noise. Under time-varying channels, however, generalized eigendecomposition is required at each time step to design the optimal beam, and its level of complexity is too high to implement in practical systems. To overcome this problem, a predictive beam design method updating the beams according to channel variation is proposed. To this end, the perturbed generalized eigenvectors, which can be obtained by a perturbation theory without any iteration, are used. The performance of the method in terms of SLNR is analyzed and verified using numerical results.