• 대한전자공학회논문지
• /
• 제27권5호
• /
• pp.656-665
• /
• 1990

In this paper, some new results on minimum-bandwidth system are presented. First, we state sufficient condition for the existance of a existance of a power spectral null at the zero frequency and Nyquist frequency. Second, eye boundary functions and eyewidth are obtained for minimum-bandwidth systems of arbitrary numbers of transmitted symbol levels. Third, for linear minimum-bandwidth systems usually known as PR systems, we derived formulars for evaluating DSVs and ASVs in terms of the coefficients of the system polynomials and using formulars, we obtain DSVs and ASVs of various PR systems. Last, the relations among DSV, ASV, power spectral nulls, system polynomial nulls, and the minimum-bandwidth property are summarized.

• 대한전자공학회논문지
• /
• 제27권9호
• /
• pp.1321-1326
• /
• 1990

In this paper, the eye-opening conditions are investigated for the minimum bandwidth digital transmission systems where the sinc functions is used as a basic pulse so that only the Nyquist bandwidth is required for the channel. In order for these systems to be tolerant to the timing jitter in the receiver, the eye pattern should be open horizontally. It is proved that an eye opening condition which has been understood only as a sufficiency becomes a necessity as well. As its result, having a spectral null at teh Nyquist frequency is shown to have the same meaning as eye opening.

• 전자공학회논문지
• /
• 제50권4호
• /
• pp.246-251
• /
• 2013

본 논문에서는 분산 모바일 멀티미디어 통신망에서 유한한 대역폭을 공정하고 효율적으로 사용하기 위해 파산이론을 적용한 파산 대역폭할당 기법을 제안하였다. 제안된 파산 대역폭할당 기법은 협력게임이론에서 파산이론을 활용하여 파산상황에서 각 서비스의 최소 대역폭보장을 통해 각 서비스의 최소 QoS를 제공한다. 성능평가 결과로 제안한 파산 대역폭 할당기법(BBA)은 CEA, CEL, Reverse Talmud에 비해 공정성지수(FI:Fairness Index)를 통해 공정성 있고, Erlang blocking formular를 통해 서비스 차단율에 대해서도 높은 성능을 보임을 나타냈다. 제안된 파산 대역폭할당 기법은 분산 모바일 멀티미디어 통신망에서, 다양한 상황에서 서비스별 우선순위를 통한 대역폭 할당기법이나 동적인 대역폭 할당기법에 최소 대역폭 할당기준으로도 적용할 수 있다.

• 대한전자공학회논문지TC
• /
• 제40권10호
• /
• pp.59-66
• /
• 2003

본 논문에서는 다수 트래픽 클래스들에게 최소 대역폭을 보장해 줄 수 있는 광버스트스위칭 (Optical Burst Switching, OBS) 기법을 제안한다. 현재까지 제안되었던 QoS (Quality of Service) 관련 OBS 기법들은 클래스간 차별화는 가능하였으나 여러 클래스들이 존재하는 경우 하위 우선순위의 트래픽 클래스는 상급 클래스와 충돌로 최소 대역폭을 보장해 주진 못 하였다. 본 논문에서는 클래스별로 데이터 채널의 일정 시간구간을 할당하여, 최소한 그 영역에서는 최상급 클래스보다도 높은 우선순위를 부여하여 최소 대역폭을 보장받도록 하였다. 이런 동작을 효율적으로 가능하게 하기 위해서 새로운 버스트 어셈블리 알고리즘과, 데이터 채널의 시간영역을 관리방법을 제안한다. 또한 제안된 기법의 단대단 지연시간과 성능을 시뮬레이션을 통해 검증하였다.

• 한국측량학회지
• /
• 제26권1호
• /
• pp.85-91
• /
• 2008

수평조정망과 같이 커다란 희소행렬(sparse matrix)을 계산할 때, 시간적 효율 및 공간적 효율을 높이기 위해서 재배열(reordering) 과정을 거치게 된다. 본 연구에서는 SMMS(Sparse Matrix Manip ulation System) 프로그램을 이용해서 희소행렬의 원소를 각각의 재배열 방법으로 재배열 한 후, 전체 계산에 걸리는 시간과 치환배열을 구해 해를 구하는 과정시 발생하는 Fill-in의 개수를 계산해서 각 방법의 효율성을 비교하였다. 그 결과, Minimum Bandwidth 기반의 GPS(Gibbs-Poole-Stockmeyer), RCM(Reverse Cuthill-Mckee) 방법보다 최소 차수(Minimum Degree) 기반의 MD(Minimum Degree), MMD(Mutiple Minimum Degree) 방법이 더 효율적인 모습을 보여주었다. 하지만, 행렬의 원소 분포에 따라서 최적의 성능을 보이는 재배열 방법은 달라질 수 있다는 것을 알 수 있었다. 이러한 연구 결과는 향후 전국 기준점의 좌표값 재조정 시, 또는 대규모 측지망 조정 등에서 구성 요소 계산에 필요한 시간, 저장 공간 등의 효율을 높일 수 있는 효과를 기대할 수 있을 것이라 사료된다.

• Journal of Communications and Networks
• /
• 제12권6호
• /
• pp.568-576
• /
• 2010

The paper presents a control architecture aimed at implementing bandwidth optimization combined with call admission control (CAC) over a digital video broadcasting (DVB) return channel satellite terminal (RCST) under quality of service (QoS) constraints. The approach can be applied in all cases where traffic flows, coming from a terrestrial portion of the network, are merged together within a single DVB flow, which is then forwarded over the satellite channel. The paper introduces the architecture of data and control plane of the RCST at layer 2. The data plane is composed of a set of traffic buffers served with a given bandwidth. The control plane proposed in this paper includes a layer 2 resource manager (L2RM), which is structured into decision makers (DM), one for each traffic buffer of the data plane. Each DM contains a virtual queue, which exactly duplicates the corresponding traffic buffer and performs the actions to compute the minimum bandwidth need to assure the QoS constraints. After computing the minimum bandwidth through a given algorithm (in this view the paper reports some schemes taken in the literature which may be applied), each DM communicates this bandwidth value to the L2RM, which allocates bandwidth to traffic buffers at the data plane. Real bandwidth allocations are driven by the information provided by the DMs. Bandwidth control is linked to a CAC scheme, which uses current bandwidth allocations and peak bandwidth of the call entering the network to decide admission. The performance evaluation is dedicated to show the efficiency of the proposed combined bandwidth allocation and CAC.

• 정보처리학회논문지C
• /
• 제9C권5호
• /
• pp.679-686
• /
• 2002

비디오 서버에서 압축된 형태로 저장된 비디오 데이터를 화질의 저하 없이 클라이언트로 전송하기 위해서는 프레임당 대역폭을 일정하게 조절하는 방법이 필요하다. 이에 스무딩 기법은 프레임당 비트수가 다른 가변 비트율(VBR : Variable Bit Rate)을 가진 비디오 스트림을 일련의 고정된 전송률로 전송하는 방법이다. 본 논문에서는 비디오 서버에 저장된 비디오 스트림을 클라이언트측으로 전송할 경우 최소의 대역폭과 전송률 변화 횟수를 가지며 비디오 서버의 CPU 오버헤드를 최소화하는 스무딩 알고리즘을 제시한다. 제시된 알고리즘의 효용성을 증명하기 위해 기존의 다른 스무딩 알고리즘들과 다양한 환경에서 비친 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3583-3598
• /
• 2019

In order to improve the reliability and repair efficiency of distributed storage systems, minimum bandwidth regenerating (MBR) codes based on cyclic variable fractional repetition (VFR) codes are constructed in this thesis, which can repair failed nodes accurately. Specifically, in order to consider the imbalance of data accessed by the users, cyclic VFR codes are constructed according to that data with different heat degrees are copied in different repetition degrees. Moreover, we divide the storage nodes into groups, and construct MBR codes based on cyclic VFR codes to improve the file download speed. Performance analysis and simulation results show that, the repair locality of a single node failure is always 2 when MBR codes based on cyclic VFR codes are adopted in distributed storage systems, which is obviously superior to the traditional MBR codes. Compared with RS codes and simple regenerating codes, the proposed MBR codes based on cyclic VFR codes have lower repair locality, repair complexity and bandwidth overhead, as well as higher repair efficiency. Moreover, relative to FR codes, the MBR codes based on cyclic VFR codes can be applicable to more storage systems.

• Journal of Communications and Networks
• /
• 제12권2호
• /
• pp.103-113
• /
• 2010

In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

• 전자공학회논문지A
• /
• 제29A권8호
• /
• pp.10-17
• /
• 1992

A new line code design technique based on the BUDA(Binary Unit DSV and ASV) concept is introduced. The new line code called MB34 and designed by this new technique is of the minimum bandwidth, dc-free, and runlength limited. To confirm the performance of the new code, its power spectrum and eye pattern are obtained, wherein spectral nulls at dc(f=0) and Nyguist frequency (f=1/2Ts) are clearly identified. It is also discussed how the transmission errors can be detected by monitoring the DSV, the ASV, and the runlength.