• Title/Summary/Keyword: High order scheme

Search Result 1,111, Processing Time 0.033 seconds

An Effective Solution to Overcome the Restriction of SACK Blocks' Number in TCP SACK (오프셋을 활용한 효율적인 TCP SACK 메커니즘)

  • Lin, Cui;Hong, Choong-Seon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.7 s.103
    • /
    • pp.1039-1046
    • /
    • 2005
  • TCP SACK is the unique mechanism to reflect the situation of sink's sequence space, some TCP variants and proposals can perform in conjunction with SACK mechanism for achieving optimal performance. By definition of RFC 2018, however, each contiguous block of data queued at the data receiver is defined in the SACK option by two 32-bit unsigned integers in network byte order. Since TCP Options field has a 40-byte maximum length, when error bursts now, we note that the available option space may not be sufficient to report all blocks present in the receiver's queue and lead to unnecessarily force the TCP sender to retransmit Packets that have actually been received by TCP sink. For overcoming this restriction, in this thesis, a new solution named 'one-byte offset based SACK mechanism' is designed to further improve the performance or TCP SACK and prevent those unwanted retransmissions. The results or both theory analysis and simulation also show that his proposed scheme operates simply and more effectively than the other existing schemes by means of the least bytes and most robust mechanism to the high packet error rates often seen in networks environment.

Dynamic Allocation of Channel Times based on Link Quality of HR-WPAN (HR-WPAN에서 링크 상태에 따른 동적 채널 타임 할당 기법)

  • Kang, Jae-Eun;Byun, Sung-Won;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.264-273
    • /
    • 2009
  • For IEEE 802.15.3 HR-WPAN, we propose the DABL algorithm that PNC can allocate the channel times to the DEV in super frame in order that system frame throughput is increased and the delay is decreased. In detail, the DABL algorithm allows to dynamically allocate channel time as well as to adaptively apply the modulation and coding scheme based on the link quality of the DEV. In addition, due to the facts that QoS is quite different depending on service types, we provide the DABL algorithm taking into account RT(Real Time) traffic and Non-RT traffic respectively. Finally, we show simulation results of the DABL algorithm compared to the conventional algorithm that the PNC equally allocates channel times to the DEV regardless of the link quality of the DEV.

A Design of Ultra-sonic Range Meter Front-end IC (초음파 거리 측정회로용 프론트-엔드 IC의 설계)

  • Lee, Jun-Sung
    • 전자공학회논문지 IE
    • /
    • v.47 no.4
    • /
    • pp.1-9
    • /
    • 2010
  • This paper describes a ultrasonic signal processing front-end IC for distance range meter and body detector. The burst shaped ultrasonic signal is generated by a self oscillator and its frequency range is about 40[kHz]-300[kHz]. The generated ultrasonic signal transmit through piezo resonator. The another piezo device transduce from received ultrasonic signal to electrical signals. This front-end IC contained low noise amplifier, band pass filter, busrt detector and time pulse generator and so on. This IC has two type of new idea for improve function and performance, which are self frequency control (SFC) and Variable Gain Control amplifier (VGC) scheme. The dimensions and number of external parts are minimized in order to get a smaller hardware size. This device has been fabricated in a O.6[um] double poly, double metal 40[V] High Voltage CMOS process.

Searching a Navigation Path to Avoid Danger Area for Safe Driving (안전운전을 위해 위험지역을 회피하는 내비게이션 경로탐색)

  • Lee, Yong-Hu;Kim, Sang-Woon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.171-179
    • /
    • 2013
  • The primary function of navigation system is to provide route search and road guidance for safe driving for drivers. However, the existing route search system provides a simple service that looks up the shortest route using a safe driving DB without considering different road characteristics for the safety of the drivers. In order to maintain the safe driving, rather than searching the shortest path, a navigation system, in which the danger areas and/or the dangerous time zones have been considered, is required. Therefore, in this paper we propose a strategy of searching a navigation path to avoid danger areas for safe driving by using the A* algorithm. In the strategy, when evaluating the path-specific fitness of the navigation nodes, different heuristic weights were assigned to different types of risk areas. In particular, we considered three kinds of danger areas, such as accident-prone sections where accidents occur frequently, school zones, and intersection regions, as well as the time slots when the probability of danger is high. From computer simulation, the results demonstrate that the proposed scheme can provide the way to avoid danger areas on the route searching and confirm the possibility of providing the actual service.

The Layered Receiver Employing Whitening Process for Multiple Space-Time Codes (다중 시공간 부호를 위한 백색화 과정을 이용한 계층화 수신기)

  • Yim Eun Jeong;Kim Dong Ku
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.3 s.333
    • /
    • pp.15-18
    • /
    • 2005
  • Multiple space-time codes (M-STTC) is composed of several space-time codes. That provides high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, the layered receiver structures employing whitening process for M-STTC is proposed. The proposed receiver is composed of the decoding order decision block and the layered detection block. The whitening process in the latter is utilized to maximize the receive diversity gain in the layered detection. The layered receiver employing whitening process has more diversity gain and advantage of the required number of receive antenna over the layered detection with MMSE nulling. The proposed scheme achieves a 5dB gain compared to the coded layered space-time processing at the FER of $10^{-2}$.

Performance of OFDM MMoF System considering Nonlinearity of OSSB Modulation (OSSB 변조의 비선형성을 고려한 OFDM MMoF 시스템의 성능)

  • Kim Chang-Joong;Lee Ho-Kyoung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.27-31
    • /
    • 2006
  • Millimeter over Fiber (MMoF) technique modulates millimeter wave signal optically to transmit it through an optical fiber for long distances with small loss. MMoF system usually uses optical single sideband (OSSB) modulation scheme to reduce fiber chromatic dispersion and obtain high bandwidth efficiency. The optical link of MMoF system using OSSB is treated as a nonlinear amplifier, and the AM/AM characteristic function of the amplifier is a Bessel function of the first kind of order 1. In this paper, we investigate the performance of OFDM MMoF system considering nonlinearity of OSSB modulation. We estimate a power of the nonlinear distortion noise to analyze the theoretical bit error rate(BER), and perform a simulation to verify the theoretical BER.

A Two-Step Vertex Selection Method for Minimizing Polygonal Approximation Error (다각형 근사 오차를 최소화하기 위한 2단계 정점 선택 기법)

  • 윤병주;이훈철;고윤호;이시웅;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.114-123
    • /
    • 2003
  • The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

Design of Parallel Algorithms for Conventional Matched-Field Processing over Array of DSP Processors (다중 DSP 프로세서 기반의 병렬 수중정합장처리 알고리즘 설계)

  • Kim, Keon-Wook
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.101-108
    • /
    • 2007
  • Parallel processing algorithms, coupled with advanced networking and distributed computing architectures, improve the overall computational performance, dependability, and versatility of a digital signal processing system In this paper, novel parallel algorithms are introduced and investigated for advanced sonar algorithm, conventional matched-field processing (CMFP). Based on a specific domain, each parallel algorithm decomposes the sequential workload in order to obtain scalable parallel speedup. Depending on the processing requirement of the algorithm, the computational performance of the parallel algorithm reveals different characteristics. The high-complexity algorithm, CMFP shows scalable parallel performance on the array of DSP processors. The impact on parallel performance due to workload balancing, communication scheme, algorithm complexity, processor speed, network performance, and testbed configuration is explored.

Clustering Algorithm for Extending Lifetime of Wireless Sensor Networks (무선 센서 네트워크의 수명연장을 위한 클러스터링 알고리즘)

  • Kim, Sun-Chol;Choi, Seung-Kwon;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.77-85
    • /
    • 2015
  • Recently, wireless sensor network(WSN) have been used in various fields to implement ubiquitous computing environment. WSN uses small, low cost and low power sensors in order to collect information from the sensor field. This paper proposes a clustering algorithm for energy efficiency of sensor nodes. The proposed algorithm is based on conventional LEACH, the representative clustering protocol for WSN and it prolongs network and nodes life time using sleep technique and changable transmission mode. The nodes of the proposed algorithm first calculate their clustering participation value based on the distance to the neighbor nodes. The nodes located in high density area will have clustering participation value and it can turn to sleep mode. Besides, proposed algorithm can change transmission method from conventional single-hop transmission to multi-hop transmission according to the energy level of cluster head. Simulation results show that the proposed clustering algorithm outperforms conventional LEACH, especially non-uniformly deployed network.

Imaging of Ground Penetrating Radar Data Using 3-D Kirchhoff Migration (3차원 Kirchhoff 구조보정을 이용한 지표레이다자료의 영상화)

  • Cho, Dong-Ki;Suh, Jung-Hee;Choi, Yoon-Kyoung
    • Geophysics and Geophysical Exploration
    • /
    • v.5 no.3
    • /
    • pp.185-192
    • /
    • 2002
  • We made a study of 3-D migration which could precisely image data of GPR (Ground Penetrating Radar) applied to NDT (Non-Destructive Test) field for the inspection of structural safety. In this study, we obtained 3-D migrated images of important targets in structuresurvey (e.g. steel pipes, cracks) by using 3-D Kirchhoff prestack depth migration scheme developed for seismic data processing. For a concrete model consisting of steel pipe and void, the targets have been well defined with opposite amplitude according to the parameters of the targets. And migrated images using Parallel-Broadside array (XX configuration) have shown higher resolution than those using Perpendicular-Broadside array (YY configuration) when steel pipes had different sizes. Therefore, it is required to analyze the migrated image of XX configuration as well as that of general YY configuration in order to get more accurate information. As the last stage, we chose a model including two steel pipes which cross each other. The upper pipe has been resolved clearly but the lower has been imaged bigger than the model size due to the high conductivity of the upper steel.