• Title/Summary/Keyword: Time-multiplexing scheme

Search Result 168, Processing Time 0.026 seconds

A Multi-Dimensional Radio Resource Scheduling Scheme for MIMO-OFDM Wireless Systems

  • Li, Lei;Niu, Zhisheng
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.401-409
    • /
    • 2006
  • Orthogonal frequency division multiplexing (OFDM) and multiple input multiple output (MIMO) technologies provide additional dimensions of freedom with spectral and spatial resources for radio resource management. Multi-dimensional radio resource management has recently been identified to exploit the full dimensions of freedom for more flexible and efficient utilization of scarce radio spectrum while provide diverse quality of service (QoS) guarantees. In this work, a multi-dimensional radio resource scheduling scheme is proposed to achieve above goals in hybrid orthogonal frequency division multiple access (OFDMA) and space division multiple access (SDMA) systems. Cochannel interference (CCI) introduced by frequency reuse under SDMA is eliminated by frequency division and time division between highly interfered users. This scheme maximizes system throughput subjected to the minimum data rate guarantee. for heterogeneous users and transmit power constraint. By numerical examples, system throughput and fairness superiority of the our scheduling scheme are verified.

Power Allocation and Capacity Analysis of OFDM-based Unlicensed User in TV White Space (TV 화이트 스페이스에서 OFDM 기반 비인가 사용자의 파워 할당 기법 및 용량 분석)

  • Lim, Sung-Mook;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.70-76
    • /
    • 2012
  • In this paper, we propose a power allocation scheme of the unlicensed user based on orthogonal frequency division multiplexing (OFDM) in the TV white space (TVWS). Power constraints in TVWS should be satisfied in the time domain. However, because OFDM has high PAPR (peak-to-average power ratio), it is difficult to satisfy power constraints of TVWS in the time domain. Furthermore, the conventional power allocation schemes cannot be generally applied to unlicensed user in TVWS. Therefore, we propose a power allocation scheme to satisfy power constraints of TVWS by reducing PAPR in the time domain. In addition, we analyze the capacity of the unlicensed user based on OFDM in a closed form. Based on the capacity analysis, as the number of subcarriers decreases, the capacity can be enhanced. In simulation results, we show that the capacity of the unlicensed user increases, as the number of subcarriers decreases and the mean of the channel between the transmitter and the receiver of the unlicensed user increases.

Adaptive Random Access Algorithm for HIPERLAN/2 (HIPERLAN/2를 위한 적응적 랜덤 액세스 알고리즘)

  • Song Young-keum;Lee Jong-kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.310-316
    • /
    • 2005
  • In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

Optimum Superimposed Training for Mobile OFDM Systems

  • Yang, Qinghai;Kwak, Kyung-Sup
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.42-46
    • /
    • 2009
  • Superimposed training (SIT) design for estimating of time-varying multipath channels is investigated for mobile orthogonal frequency division multiplexing (OFDM) systems. The design of optimum SIT consists of two parts: The optimal SIT sequence is derived by minimizing the channel estimates' mean square error (MSE); the optimal power allocation between training and information data is developed by maximizing the averaged signal to interference plus noise ratio (SINR) under the condition of equal powered paths. The theoretical analysis is verified by simulations. For the metric of the averaged SINR against signal to noise ratio (SNR), the theoretical result matches the simulation result perfectly. In contrast to an interpolated frequency-multiplexing training (FMT) scheme or an SIT scheme with random pilot sequence, the SIT scheme with proposed optimal sequence achieves higher SINR. The analytical solution of the optimal power allocation is demonstrated by the simulation as well.

Bandwidth enhancement scheme for VoIP application based on H.323 (H.323 기반 VoIP 어플리케이션에서의 대역폭 향상을 위한 방법)

  • 김기훈;박동선;이승상;박종빈
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.149-152
    • /
    • 2003
  • In this paper, we propose a scheme that applies to the VoIP application based on H.323 protocol to enhance the bandwidth efficiency. We multiplex the audio and video stream. In this scheme, audio frame is carried with video stream. And we applies not only multiplexing but also (in header compressing to the real audio/video stream to increase the bandwidth efficiency. With the multiplexing and RTP header compressing, we gain the bandwidth efficiency. In the finite network environment, We can assign bandwidth to other users who want to use other service. and other VoIP users. If we can apply the real time network situation to the our VoIP application, we can get more efficient performance.

  • PDF

QUEUEING ANALYSIS OF THE HOL PRIORITY LEAKY BUCKET SCHEME

  • Choi, Doo-Il
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.15-23
    • /
    • 2003
  • ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

  • PDF

Holographic recording system by combined use of rotational, angular, and spatial multiplexing method (회전, 각, 그리고 공간 다중화 방법을 결합사용한 홀로그램 기록 시스템)

  • 신동학;장주석
    • Korean Journal of Optics and Photonics
    • /
    • v.9 no.3
    • /
    • pp.199-204
    • /
    • 1998
  • To increase the storage density in hologram recording, a simple scheme to obtain rotational, angular and spatial multiplexing efficiently at the same time is proposed and experimented. Both rotational multiplexing and angular multiplexing are obtained by controlling the reference beam directly by use of a pair of wedge prisms, while spatial multiplexing is obtained by shifting the recording medium in the recording plane. It is possible to get both an acute-angle geometry, in which the angle between the signal and reference beams is less than 90$^{\circ}$, and a 90$^{\circ}$ geometry, in which the angle is approximately 90$^{\circ}$. In experiment, 180 holograms were multiplexed with an acute-angle geometry where a photopolymer was used for the recording medium, and 147 holograms with 90$^{\circ}$ geometry where a Fe-doped LiNbO$_3$ crystal was used. The proposed scheme makes it easy it easy to realize a practical holographic memory system by simplifying the control of three complex mechanical motions that are necessary for the three multiplexing techniques.

  • PDF

Time-Varying Multipath Channel Estimation with Superimposed Training in CP-OFDM Systems

  • Yang, Qinghai;Kwak, Kyung-Sup
    • ETRI Journal
    • /
    • v.28 no.6
    • /
    • pp.822-825
    • /
    • 2006
  • Based on superimposed training methods, a novel time-varying multipath channel estimation scheme is proposed for orthogonal frequency division multiplexing systems. We first develop a linear least square channel estimator, and meanwhile find the optimal superimposed sequences with respect to the channel estimates' mean square error. Next, a low-rank approximated channel estimator is obtained by using the singular value decomposition. As demonstrated in simulations, the proposed scheme achieves not only better performance but also higher bandwidth efficiency than the conventional pilot-aided approach.

  • PDF

Performance Analysis of Space-Time Coded Spatial Multiplexing Systems with Rate Allocation and Power Control (전송률 할당 및 전력 제어를 갖는 시공간 블록 부호화한 공간 다중화 시스템의 성능 분석)

  • Na, Seung-Gun;Hwang, Hyeon-Chyeol;Kim, Seok-Ho;Choi, Sun-Ho;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.568-577
    • /
    • 2005
  • In this paper, we propose the transmission scheme for the space-time block coded spatial multiplexing systems that have adaptive rate and power allocation per each transmit antenna through the use of feedback information related to channel state. Simulation results show that the adaptive power and rate transmission scheme gain more than 4.5 dB over conventional equal-power and rate transmission scheme.

A Study on Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM systems

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.117-121
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

  • PDF