• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1697-1700
• /
• 2002

In this paper, we propose a new frame structure and frame synchronization algorithm for OFDM burst mode transmission. On the contrary to conventional OFDM symbol based methods, the proposed preamble for symbol frame synchronization is designed independently in time domain in arbitrary length and is placed at the beginning of the frame. The proposed frame synchronization algorithm by using the preamble is working independent of frequency offset and robust to serious channel environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1624-1630
• /
• 1999

Code division multiple access (CDMA) is a promising air interface technique for cellular systems. When an MS (Mobile Station) moves to an adjacent cell, the handoff between the serving cell and the target cell is needed. Compared with the hard handoffs, the soft handoffs between two CDMA channels with the identical frequency assignments and frame offsets can provide a better quality of service by minimizing the undesirable ping pong phenomenon of back-and forth handoffs between two adjacent cells in conventional hard handoffs. For the soft handoff of a call to an adjacent cell to be successful, the adjacent cell should assign to the call the same frame offset as that being used in the original cell by the call. In this paper, considering the assignment states of the frame offsets of the adjacent cells, a frame offset assignment algorithm for the originated call is proposed. And analytic method for the handoff blocking probability due to the lack of the frame offset capacity is also presented to show the advantage of the proposed algorithm with respect to the soft handoff blocking probability.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2050-2059
• /
• 2000

In a video-on-Demand(VOD) service, a server has to return to he normal playback quickly at a certain new frame position after interactive operations such as jump or last playback. In this paper, we propose an efficient scheme to write a transmission schedule for a playback restart of a video stream at a new frame position after interactive operations. The proposed scheme is based on convergence characteristics, that is transmission schedules with different playback startup frame position in a video stream meet each other at some frame position. The scheme applies a bandwidth smoothing from a new frame position to a convergence position without considering all remaining frames of a video stream. And then the scheme transmits video dta according to the new schedule from the new frame position to the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position, and then transmits the remaining video data according to the reference schedule from the convergence position to the last frame position. In this paper, we showed that there existed the convergence position corresponding to nay frame position in a video stream through many experiments based on MPEG-1 bit trace data. With the convergence we reduced the computational overhead of a bandwidth smoothing, which was applied to find a new transmission schedule after interactive operations. Also, storage overhead is greatly reduced by storing pre-calculated schedule information up to the convergence position for each I frame position of a video stream with video data off-line. By saving information on a transmission schedule off-line along with the video data and searching the schedule corresponding to the specified restarting frame position, we expect the possibility of normal playback of a video stream with small tolerable playback startup delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1822-1828
• /
• 2006

A key-frame should be efficiently selected to distinguish bad information from the videos. A previous technique selecting a key-frame mostly consists of the transformation scene-centered. In the case of harmful videos containing the quaility of continuous changes, the technique makes the total rate be reduced by an unnecessary key-frame. This thesis suggests the technique selecting a key-frame, an entry of the distinguishing system by using the quality of changes between the frames. In the experiment of this technique, it was proved that over 90% of the bad information was distinguished by the selected key frame, and also time efficiency was proved by showing 68% of decrement compared to the numbers I-frame. Therefore, This technique makes the system efficient to distinguish bad information, and efficiently can contribute to the distribution of the healthy movie information.

• Journal of information and communication convergence engineering
• /
• v.3 no.1
• /
• pp.13-17
• /
• 2005

The link e daggregation between 10GbE switches requires an advanced framistribution method to be properly and efficiently applied. The fixed or dynamic frame distribution methods, formerly proposed, cannot fully utilize the aggregated links, where the receiving terminal only attaches to a pre-specified link among multiple physical links. A frame distribution method using padding is proposed for the link aggregation between 10GbE switches to solve this problem. We compared the performance of the proposed method with those of the static and dynamic frame distribution methods. As a result, the proposed method shows a better performance when the offered load is below 0.7 and the average length of the frames is longer than 954 bytes.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.807-823
• /
• 2018

Speaker verification system performance depends on the utterance of each speaker. To verify the speaker, important information has to be captured from the utterance. Nowadays under the constraints of limited data, speaker verification has become a challenging task. The testing and training data are in terms of few seconds in limited data. The feature vectors extracted from single frame size and rate (SFSR) analysis is not sufficient for training and testing speakers in speaker verification. This leads to poor speaker modeling during training and may not provide good decision during testing. The problem is to be resolved by increasing feature vectors of training and testing data to the same duration. For that we are using multiple frame size (MFS), multiple frame rate (MFR), and multiple frame size and rate (MFSR) analysis techniques for speaker verification under limited data condition. These analysis techniques relatively extract more feature vector during training and testing and develop improved modeling and testing for limited data. To demonstrate this we have used mel-frequency cepstral coefficients (MFCC) and linear prediction cepstral coefficients (LPCC) as feature. Gaussian mixture model (GMM) and GMM-universal background model (GMM-UBM) are used for modeling the speaker. The database used is NIST-2003. The experimental results indicate that, improved performance of MFS, MFR, and MFSR analysis radically better compared with SFSR analysis. The experimental results show that LPCC based MFSR analysis perform better compared to other analysis techniques and feature extraction techniques.

• Journal of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.291-304
• /
• 2005

We introduce a concept of Cauchy complete Csaszar frames and construct Cauchy completions of Csaszar frames using strict extensions of frames and show that the Cauchy completion gives rise to a coreflection in the categories CsFrm and UCsFrm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6B
• /
• pp.403-410
• /
• 2008

In this paper, we investigate the performance of MMR system in Non-transparent mode. The IEEE 802.16j MMR system has two node of operation, Single-frame (in band) and Multi-frame (out band) mode. In the analysis, we assume that channel interference between MR-BS and RS, or between RSs anywhere in the given area is ignored. The performance is presented in terms of the delay and the frame efficiency by varying number of RS and BS coverage to RS coverage ratio and the maximum coverage area of a BS by varying traffic density. Analytical results show that the Single-frame is more efficient than Multi-frame in frame efficiency and coverage extension.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.442-444
• /
• 2001

최근 통신환경의 급속한 발전과 함께 점점 복잡 다양해지는 사회적 요구에 의해 유선망을 무선환경으로 옮겨 가기 위한 많은 연구들이 진행되고 있다. 본 논문에서는 Frame Relay 망과 WATM 백본 망라의 연동 환경을 제안하였고, 이 망에서 Frame Relay 망의 이동으로 인하여 발생하는 망의 이동성 지원 방안과 QoS를 보장하는 단말들의 멀티 핸드오버를 효율적으로 지원하기 위한 G-CAC알고리즘을 제안한다. 본 논문에서 제안한 G-CAC알고리즘은 망 단위의 이동환경에서 Frame Relay의 트래픽 특성, DE/CLP 맵핑 , 트래픽 파라미터 변환 방식을 이용하여 핸드오버 블락킹 율과 손실 율을 감소시킨다. 또한 여러 Frame Relay 망과 통신하고 있는 백본의 WATM에서는 다른 Frame Relay망들의 할당된 자원 중에 CLP비트가 세트된 셀들을 드롭하여 그 자원을 새로운 핸드오버를 요청하는 Frame Relay망에 접합된 WATM에 제공하는 QoS를 고려한 핸드오버 CAC(connection admission control)알고리즘을 제안한다.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.69-75
• /
• 2000

A new frame synchronization confirmation technique using a pilot pattern of both uplink and downlink channels is proposed for W-CDMA (Wideband Code Division Multiple Access) system. It is shown that by using this technique, we can cancel the side lobe for autocorrelation functions of the frame synchronization words of pilot pattern have the maximum to-of-phase autocorrelation value "4" with two peak values equal in magnitude and opposite in polarity at zero and middle shifts. Due to this side lobe cancellation effect, therefore, the autocorrelation function of the frame synchronization words becomes ideal for the frame synchronization confirmation since double maximum correlation values equal in magnitude and opposite polarity at zero ad middle shifts can be achieved. This property can be used to double check frame synchronization timing and thus. improve the frame synchronization confirmation performance.