• 제목/요약/키워드: Multiple Streams

Search Result 206, Processing Time 0.026 seconds

The Derivation of the Frequency Formulae from the Basin Characteristics (유역특성으로부터 확률홍수량의 유도에 관한 연구)

  • 양동율;고재웅
    • Water for future
    • /
    • v.14 no.3
    • /
    • pp.37-46
    • /
    • 1981
  • The purpose of this paper is to provide a method of estimating the magnitude and frequency of floods on five major streams in Korea such as the Han, the naktong, the Geum, the Seomjin and the Yeongsan. Derivation of the flood frequency formulae is based on the multiple correlation method. For each gaging station in the region, flood frequency curves are drawn by GumbelChow and Weibull plot. where 24 gaging stations are selected for this study. After the station flood-frequency cruves have been prepared, discharges are read at selected recurrence intervals. Each set of discharges is then correlated with basin parameters, using regression equation. The basin parameters that are considered include drainage area, length of main stream, shape facotr, mean basin slope and main channel slope.

  • PDF

M/B-MC/CDMA performance analysis for high speed data transmission in IS-95 evolution (IS-95 진화방안에서 고속 데이터 전송을 위한 M/B-MC/CDMA 전송방식의 성능분석)

  • 임명섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10A
    • /
    • pp.1494-1500
    • /
    • 1999
  • In order to provide high speed multimedia data rate service, Multi-Code CDMA has been proposed which converts high speed serial data stream into N parallel low speed data streams with orthogonal PN codes for spreading. However this signal has multi level and causes interferences to be increased at the neighboring cell boundary in the reverse link. Therefore in order to solve the above mentioned problem, M/B-MC/CDMA, in which multi level signal is converted to binary level signal using M/B conversion, is proposed and the performance is compared with MC-CDMA.

  • PDF

A Stack Bit-by-Bit Algorithm for RFID Multi-Tag Identification (RFID 다중 태그 인식을 위한 스택 Bit-By-Bit 알고리즘)

  • Lee, Jae-Ku;Yoo, Dae-Suk;Choi, Seung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.847-857
    • /
    • 2007
  • For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. A Bit-by-Bit algorithm is defined by Auto ID Class 0. In this paper, we propose a SBBB(Stack Bit-by-Bit) algorithm. The SBBB algorithm save the collision position and makes a query using the saved data. SBBB improve the efficiency of collision resolution. We show the performance of the SBBB algorithm by simulation. The performance of the proposed algorithm is higher than that of BBB algorithm. Especially, the more each tag bit streams are the duplicate, the higher performance is.

Performance analysis of Downlink Multi-user MIMO based on TM9 in Rel.10 (Rel.10 의 TM9 기반 다운링크 Multi-user MIMO 성능분석)

  • Song, Hua Yue;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.1
    • /
    • pp.47-53
    • /
    • 2014
  • LTE-Advanced is the evolved version of LTE which is currently in progress at the 3GPP. At present, as the number of smart phone users is rapidly increasing, the demand for ever more capacity is driven largely by video usage and high quality data communication and so on, this let more researchers study about LTE-A all over the world. LTE-A aims to achieve improved service and communication quality over 3G system at the aspect of throughput, peak data rate, latency, and spectral efficiency. Among various features in LTE-A, the multi-user MIMO(MU-MIMO), in which the base station transmits several streams to multiple receivers, has expected to give better quality for system. In this paper, we investigate performances of various types of downlink receivers with fixed number of antennas. we first review the development process from LTE to LTE-A. Second we introduce TM9 which is adopted in Rel.10 for MU-MIMO system, including the MU-MIMO system model and the explanation on the algorithm used in system. We also have brief introduction about sub-blocking in turbo decoding, finally we compare the performance between the uncoded case and coded case which is using turbo encoding.

Multivariate Process Capability Index Using Inverted Normal Loss Function (역정규 손실함수를 이용한 다변량 공정능력지수)

  • Moon, Hye-Jin;Chung, Young-Bae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.174-183
    • /
    • 2018
  • In the industrial fields, the process capability index has been using to evaluate the variation of quality in the process. The traditional process capability indices such as $C_p$, $C_{pk}$, $C_{pm}$ and $C^+_{pm}$ have been applied in the industrial fields. These traditional process capability indices are mainly applied in the univariate analysis. However, the main streams in the recent industry are the multivariate manufacturing process and the multiple quality characteristics are corrected each other. Therefore, the multivariate statistical method should be used in the process capability analysis. The multivariate process indices need to be enhanced with more useful information and extensive application in the recent industrial fields. Hence, the purpose of the study is to develop a more effective multivariate process index ($MC_{pI}$) using the multivariate inverted normal loss function. The multivariate inverted normal loss function has the flexibility for the any type of the symmetrical and asymmetrical loss functions as well as the economic information. Especially, the proposed modeling method for the multivariate inverted normal loss function (MINLF) and the expected loss from MINLF in this paper can be applied to the any type of the symmetrical and asymmetrical loss functions. And this modeling method can be easily expanded from a bivariate case to a multivariate case.

Visual Cell OOK Modulation : A Case Study of MIMO CamCom (시각 셀 OOK 변조 : MIMO CamCom 연구 사례)

  • Le, Nam-Tuan;Jang, Yeong Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.9
    • /
    • pp.781-786
    • /
    • 2013
  • Multiplexing information over parallel data channels based on RF MIMO concept is possible to achieve considerable data rates over large transmission ranges with just a single transmitting element. Visual multiplexing MIMO techniques will send independent streams of bits using the multiple elements of the light transmitter array and recording over a group of camera pixels can further enhance the data rates. The proposed system is a combination of the reliance on computer vision algorithms for tracking and OOK cell frame modulation. LED array are controlled to transmit message in the form of digital information using ON-OFF signaling with ON-OFF pulses (ON = bit 1, OFF = bit 0). A camera captures image frames of the array which are then individually processed and sequentially decoded to retrieve data. To demodulated data transmission, a motion tracking algorithm is implemented in OpenCV (Open source Computer Vision library) to classify the transmission pattern. One of the most advantages of proposed architecture is Computer Vision (CV) based image analysis techniques which can be used to spatially separate signals and remove interferences from ambient light. It will be the future challenges and opportunities for mobile communication networking research.

Data Alignment for Data Fusion in Wireless Multimedia Sensor Networks Based on M2M

  • Cruz, Jose Roberto Perez;Hernandez, Saul E. Pomares;Cote, Enrique Munoz De
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.229-240
    • /
    • 2012
  • Advances in MEMS and CMOS technologies have motivated the development of low cost/power sensors and wireless multimedia sensor networks (WMSN). The WMSNs were created to ubiquitously harvest multimedia content. Such networks have allowed researchers and engineers to glimpse at new Machine-to-Machine (M2M) Systems, such as remote monitoring of biosignals for telemedicine networks. These systems require the acquisition of a large number of data streams that are simultaneously generated by multiple distributed devices. This paradigm of data generation and transmission is known as event-streaming. In order to be useful to the application, the collected data requires a preprocessing called data fusion, which entails the temporal alignment task of multimedia data. A practical way to perform this task is in a centralized manner, assuming that the network nodes only function as collector entities. However, by following this scheme, a considerable amount of redundant information is transmitted to the central entity. To decrease such redundancy, data fusion must be performed in a collaborative way. In this paper, we propose a collaborative data alignment approach for event-streaming. Our approach identifies temporal relationships by translating temporal dependencies based on a timeline to causal dependencies of the media involved.

Secure and Efficient Storage of Video Data in a CCTV Environment

  • Kim, Won-Bin;Lee, Im-Yeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3238-3257
    • /
    • 2019
  • Closed-circuit television (CCTV) technology continuously captures and stores video streams. Users are typically required by policy to store all the captured video for a certain period. Accordingly, increasing the number of CCTV operation cycles and photographing positions expands the amount of data to be stored. However, expanding the available storage space for video data incurs increased costs. In recent years, this problem has been addressed with cloud storage solutions, which enable multiple users and devices to access and store data simultaneously. However, because of the large amount of data to be stored, a vast storage space is required. Consequently, cloud storage administrators need a way to store data more efficiently. To save storage space, deduplication technology has been proposed to prevent duplicate storage of the same data. However, because cloud storage is hosted on remote servers, data encryption technology must be applied to address data exposure issues. Although deduplication techniques for encrypted data have been studied, there have been various security vulnerabilities. We attempted to solve this problem by addressing various issues such as poison attacks, property forgery, and ownership management while removing the redundant data and handling the data more securely.

New Beamforming Schemes with Optimum Receive Combining for Multiuser MIMO Downlink Channels (다중사용자 다중입출력 하향링크 시스템을 위한 최적 수신 결합을 이용한 새로운 빔 형성 기법)

  • Lee, Sang-Rim;Park, Seok-Hwan;Moon, Sung-Hyun;Lee, In-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.8
    • /
    • pp.15-26
    • /
    • 2011
  • In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a block-diagonalization (BD) algorithm has been proposed for the multiuser MIMO downlink where both a base station and each user have multiple antennas. However, the BD algorithm is not efficient when the number of supported streams per user is smaller than that of receive antennas. Since the BD method utilizes the space based on the channel matrix without considering the receive combining, the degree of freedom for beamforming cannot be fully exploited at the transmitter. In this paper, we optimize the receive beamforming vector under a zero forcing (ZF) constraint, where all inter-user interference is driven to zero. We propose an efficient algorithm to find the optimum receive vector by an iterative procedure. The proposed algorithm requires two phase values feedforward information for the receive combining vector. Also, we present another algorithm which needs only one phase value by using a decomposition of the complex general unitary matrix. Simulation results show that the proposed beamforming scheme outperforms the conventional BD algorithm in terms of error probability and obtains the diversity enhancement by utilizing the degree of freedom at the base station.

Error Resilient Video Coding Techniques Using Multiple Description Scheme (다중 표현을 이용한 에러에 강인한 동영상 부호화 방법)

  • 김일구;조남익
    • Journal of Broadcast Engineering
    • /
    • v.9 no.1
    • /
    • pp.17-31
    • /
    • 2004
  • This paper proposes an algorithm for the robust transmission of video in error Prone environment using multiple description codingby optimal split of DCT coefficients and rate-distortionoptimization framework. In MDC, a source signal is split Into several coded streams, which is called descriptions, and each description is transmitted to the decoder through different channel. Between descriptions, structured correlations are introduced at the encoder, and the decoder exploits this correlation to reconstruct the original signal even if some descriptions are missing. It has been shown that the MDC is more resilient than the singe description coding(SDC) against severe packet loss ratecondition. But the excessive redundancy in MDC, i.e., the correlation between the descriptions, degrades the RD performance under low PLR condition. To overcome this Problem of MDC, we propose a hybrid MDC method that controls the SDC/MDC switching according to channel condition. For example, the SDC is used for coding efficiency at low PLR condition and the MDC is used for the error resilience at high PLR condition. To control the SDC/MDC switching in the optimal way, RD optimization framework are used. Lagrange optimization technique minimizes the RD-based cost function, D+M, where R is the actually coded bit rate and D is the estimated distortion. The recursive optimal pet-pixel estimatetechnique is adopted to estimate accurate the decoder distortion. Experimental results show that the proposed optimal split of DCT coefficients and SD/MD switching algorithm is more effective than the conventional MU algorithms in low PLR conditions as well as In high PLR condition.