• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.868-873
• /
• 2008

In this paper, we analyze the burst error performance of LDPC codes on perpendicular magnetic recording(PMR) channel. When burst error is generated on PMR channel, we use channel state information(CSI) to set the LLR information of channel detector zero. We consider the rate 0.94 LDPC codes and use SOVA as channel detector with low complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2493-2495
• /
• 2001

Burst Error Channel의 에러 정정 기술로써 Reed-Solomon Product Code(RSPC)가 광범위하게 사용되고 있다. 그러나 Random Error Channel과는 달리 Burst Error Channel 상에서 RSPC의 에러 정정 평가 방법에는 많은 어려움이 있다. 우리는 이번 논문에서 Burst Error Channel 상에서 RSPC의 Error Correction Capability의 확률적인 계산 방법을 기술하려 한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.51-58
• /
• 2003

In this paper, we propose a group scheduling scheme to efficiently utilize network resources for core nodes in optical burst switching networks. This scheme schedules multiple bursts utilizing an interval graph to obtain the maximum stable set using the information such as arrival times and burst lengths from the collected header packets. Simultaneous scheduling of multiple bursts in a scheduling window results in lower burst loss probability and increased channel utilization than those proposed previously using one-to-one mapping. Simulation results for both cases of variable and fixed burst sizes show that the group scheduling scheme is better than the immediate scheduling, so called Latest Available Unused Channel with Void Filling, scheme in both performance metrics above mentioned.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.367-374
• /
• 2009

The errors take place in the communication channel but they are often burst-error types. From properties of the Fi-bonacci code, it is not difficult to detect the burst-errors accompanying with this code. Fibonacci codes for correcting the double-burst-error patterns are presented. Given the channel length with the double-burst-error type, Fibonacci code correcting these errors is constructed by a simple formula.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1359-1367
• /
• 2000

A new coherent detection scheme with data based channel estimation (DBCE) for CDMA/BP(staggered burst pilot in parallel) channel structure is proposed. Because the pilot burst initiates DBCE operation periodically it is shown to be remarkably stable to Gaussian noise and Doppler shift with proper parameter settings. In our own system parameter setting, there is a negligible loss(0.068 dB) in $E_{b}/N_{o}$ by the introduction of the burst pilot. When compared with an ideal coherent detection, the required $E_{b}/N_{o}$ on Doppler shift corresponding to the speed of 160Km/H is degraded less that 2.0 dB. the burst pilot can be implemented without complexity even though some extra correlators are needed for DBCE. This improvement is superior to the previously coherent CDMA detectors with external or internal pilot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2496-2498
• /
• 2001

광 디스크 channel상에서 RSPC의 error correction capability를 확률적인 계산 방법으로 계산하는 데는 많은 어려움이 있다. 그 이유는 바로 광 디스크 channel이 burst error channel이기 때문인데, 이 burst error를 어떻게 다루는 가에 따라 그 error correction capability는 사뭇 달라진다. 이 논문에서는 Sony의 dust error distribution[1] 아래에서 4-state Morkov Chain[2]로 modeling하고 그 결과를 가지고 burst error를 channel의 특성과 ECC format의 특성에 맞게 제어할 수 있는 확률적인 계산방법을 소개하고 그것을 simulation하고자 한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.59-66
• /
• 2003

We propose the novel optical burst switching scheme to guarantee a minimum bandwidth for multiple classes. To date, QoS studies on OBS network are capable of differentiating two classes, but have difficulties in providing a minimum bandwidth lot several classes because of lower classes' collision with the highest class bursts in the networks. To solve that problem, in our proposed scheme we assign time zones in a data channel for each class periodically, making one burst have top priority at least its zone. Also, the new burst assembling algorithm, as well as the way of managing data channel, is necessarily proposed to coordinate with the proposed OBS scheme. Through the evaluation, we show that the worst-case end-to-end delay is small enough and the received bandwidth of the lower classes is still assured regardless of the traffic load of the highest class.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.24-34
• /
• 2003

In this paper, we investigated the problems of the offset time based service differentiation scheme for optical burst switching (OBS) networks, and proposed the preemption-based service differentiation scheme which combines a preemption channel selection algorithm and channel partitioning algorithm. The proposed preemption channel selection algorithm minimizes the length of preempted bursts to improve the channel efficiency, while the proposed channel partitioning algorithm controls the degree of service differentiation between service classes. The simulation results showed that the proposed schemes could improve the end-to-end performance and effectively provide controllable service differentiation in the multiple hop network environments.