• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2100-2112
• /
• 2011

An orthogonal code hopping multiplexing (OCHM) technique has been proposed for accommodating a large number of users with low channel activities than the number of orthogonal codewords through statistical multiplexing in downlink cellular systems. In this paper, a multiple input multiple output (MIMO) antenna based OCHM system is proposed to improve the performance. Each modulated symbol is repeated N times and the N repeated symbols are transmitted simultaneously using N transmit antennas. Through repetitions, the effect of perforations that the OCHM system experiences is decentralized among the repeated symbols and the full perforation probability is significantly reduced. Each receiver detect the transmitted signal using its pre-assigned code hopping pattern. Simulation results show that the proposed scheme saves the required energy for a given frame error rate (FER).

• Electronics and Telecommunications Trends
• /
• v.17 no.5 s.77
• /
• pp.37-46
• /
• 2002

이동통신에서는 무선자원의 효율적인 사용을 위하여 variable rate vocoder 및 VoX 기법을 이용한 음성 전송이 일반적 추세이며, 버스티 특성을 갖는 패킷 트래픽의 경우 statistical multiplexing을 이용하여 무선 채널의 사용을 극대화 시킨다. 트래픽 밀도를 나타내는 Erlang 용량은 일정속도의 회선교환 트래픽에 대하여 동시에 점유할 수 있는 dedicated circuit의 수에 기초하는 개념이므로 statistical multiplexing으로 처리되는 데이터 패킷의 트래픽 밀도는 queuing model에 근거한 데이터 스루풋이 현실적이다. 그러나 이동통신 시스템에서 트래픽 특성을 달리하는 circuit 및 패킷 타입의 혼합 서비스가 동시에 제공될 경우 네트워크 planning을 위한 구성 시스템의 용량산정을 위해 트래픽 밀도의 통합적인 표현을 요구한다. 따라서 Erlang 용량과 데이터 스루풋의 상호 변환을 통하여 네트워크 구성요소의 용량 산정에 적당한 용량표현을 선택할 수 있다. 본 고에서는 트래픽 처리기로서의 통신시스템을 기술하기 위하여 일반적인 텔레트래픽 시스템 모델과 파라미터를 정의한다. 또한 음성 및 비음성 서비스의 혼합 트래픽 환경에서 트래픽 밀도계산을 위한 Erlang 용량과 데이터 스루풋의 상호 변환 관계를 소개한다. 마지막으로 3G1x 무선접속환경에서 음성 및 HSPD 서비스가 공존할 경우 기지국 CE dimensioning에 필요한 혼합 트래픽 Erlang 용량 산출 방법을 기술한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.2
• /
• pp.102-114
• /
• 1987

In this paper, in order to develop the transmission system between the remote subscriber and the central office, the hardware and software implementation of a SMUX(Statistical Multiplexer)which can interleace eleven 16Kbps D-channels over a 64Kbps B-channel is obtained. As a result of this study, the high speed data transmission by the use of a dynamic buffer memory management algofithm for statistical multiplexing is realized. Especially a software architectur for interruption is proposed in order to improve performance of the transmission system more efficiently.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.195-198
• /
• 1998

In Korea Telecom, many synchronous optical transmission equipments and its operating terminal (PC) have been operated. However, many equipment operators have requested various supplementary functions such as self-monitoring and taking statistical information. This system has tried to solve the above problems, and therefore to establish centralized monitoring system on synchronous transmission equipments based on telephone office unit.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.215-218
• /
• 1996

ATM망은 실제로 이용 가능한 대역폭 이상을 할당하는 통계적 다중화(statistical multiplexing) 기법을 사용하므로 망을 통한 트래픽 흐름을 적절히 관리하지 못하면 혼잡(congestion), 셀 손실, 망의 성능 저하 등을 야기하게 된다. 이러한 상황을 예방하고 셀의 도착 시간 버스트(burstiness)를 줄이며 셀 손실 특성을 개선하여 망의 성능을 증가시키기 위하여, 트래픽의 형태 제어 방법을 제안한다. 트래픽 형태 제어 파라미터 값의 역전파 신경망을 적용하여 예측되며, 이 예측된 값들에 의해 형태 제어 방법을 수행한다. 제안된 형태 제어 기법의 성능은 Poisson 트래픽 입력에 대한 컴퓨터 시뮬레이션에 의해 얻어지며, 멀티플렉서에서의 최대 버퍼 크기를 측정하여 성능을 평가하였다.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1909-1912
• /
• 2002

We propose in this paper a companding scheme or peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems. By exploiting statistical distribution of OFDM transmit signals, the proposed scheme effectively reduces the PAPR by compressing the peak signals, while maintaining the average power unchanged. Simulation results are provided to show good performance of the proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.369-374
• /
• 1999

The problem of bandwidth allocation and routing in VP based ATM networks was studied. A priori reservation of resources for VP's reduces the statistical multiplexing gain, resulting in increased Call Blocking Probability (CBP). The focus of this study is on how to reduce CBP by the efficient bandwidth allocation and routing algorithms. Equivalent capacity concept was used to calculate the required bandwidth by the call. and the effect of traffic dispersion was explored to achieve more statistical gain. A cost-effective traffic dispersion routing algorithm, CED, was designed. The algorithm finds the optimal number of dispersion paths for a call, where the gain balances the dispersion cost. Simulation study showed that CED could significantly reduce the CBP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1323-1333
• /
• 1997

In this paper, we propose an efficient architecture for a high-speed cell concentrator/distributor(HCCD) in an ATM(Asynchronous Transfer Mode) switch and by analyzeing the simulation results evaluate the performance of the proposed architecuture. The proposed HCCD distributes cells from a switch link to local processors, or concentrates cells from local processor s to a switch link. This design is to guarntee a high throughput for the IPC (inter-processor communication) link in a distributed ATM switching system. The HCCD is designed in a moudlar architecture to provide the extensibility and the flexibility. The main characteristics of the HCCD are 1) Adaption of a local CPU in HCCD for improving flexibility of the system, 2) A cell-baced statistical multiplexing function for efficient multiplexing, 3) A cell distribution function based on VPI(Virtual Path Identifier), 4) A bypassing capability for IPC between processor attached to the same HCCD, 5) A multicasting capability for point-to-multipoint communication, 6) A VPI table updating function for the efficient management of links, 7) A self-testing function for detecting system fault.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.3
• /
• pp.61-68
• /
• 1983

In this paper various aspects of statistical maltiplexing of data signs have been investigated. A queueing model with finite waiting room and batch poisson arrivals is studied assuming that data signals are transmitted at a constant rate. Using traffic intensity and average burst length as parameters, overflow probabilities and expected queueing delay due to buffering are obtained. Also, a real system model of a statistical multiplexer that can be directly used in micro-programmed hardware realization is proposed. To examine the performance of the system, computer simulation has been done at various conditions. The results obtained can be used in designing a buffer efficiently.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.29-40
• /
• 1997

Two asymptotic analyses of the queue length distribution at a statistical multiplexor supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rates as a multi-dimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, w state with a system of linear equations derived from the exact expressions of the dominant eigenvalue of the matrix governing the queue length distribution. Assuming that there are a large number of sources, we obtain asymptotic approximations to the dominant eigenvalue. Based on the analyses, we define a traffic descriptor to include the mean and the variance of the cell generation rate and a burstiness measure. A simple expression for the quality of service (QoS) in cell loss rate is derived in terms of the traffic descriptor parameters and the multiplexor parameters (output link capacity and buffer size). The result is then used to quantify the factors determining the required capacity of a call taking the statistical multiplexing gain into consideration. As an application of the analyses, we can use the required capacity calculation for simple yet effective connection admission control(CAC) algorithms.