• Title/Summary/Keyword: Map Size

Search Result 767, Processing Time 0.026 seconds

Performance evaluation of BWA protocol according to uplink frame size and contention slot (상향링크의 프레임 크기와 경쟁슬롯에 따른 BWA 프로토콜의 성능평가)

  • Oh Sung-Min;Kim Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.967-973
    • /
    • 2004
  • DOCSIS and IEEE 802.16 define the usage and element of a MAP which is uplink control message. Standards does not include the details of MAP size and the number of contention slots affecting the performance of MAC protocols for DOCSIS and IEEE 802.16. In this paper, we analyzed the performance of throughput and access delay according to the MAP size and contention slot size. Based on the analytical results, we found the optimal MAP size and the number of contention slots. We found that the protocol shows best performance when the MAP size is 2msec and the number of contention slots is 8. The simulation results can apply to the network system parameters. The simulator can be used to optimize the system parameters in cable network, BWA and WiBro.

Effects of Grid Size on Noise Prediction Results of Road Traffic Noise Map (소음지도 격자크기가 도로교통 소음도 예측 결과에 미치는 영향)

  • Kim, Ji-Yoon;Park, In-Sun;Park, Chan-Youn;Park, Sang-Kyu;Ryu, Bong-Jo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.05a
    • /
    • pp.867-871
    • /
    • 2007
  • Noise map is very efficient tool to evaluate the road traffic noise. However, calculation time and accuracy of noise map heavily depend on the grid size of noise map. In this study, effects of grid size on the prediction results of road traffic noise map have been investigated in detail for urban and rural areas, respectively, and efficient grid size for the noise map has been proposed.

  • PDF

Effects of Grid Size on Noise Prediction Results of Road Traffic Noise Map (소음지도 격자크기가 도로교통 소음도 예측결과에 미치는 영향)

  • Kim, Ji-Yoon;Park, In-Sun;Park, Chan-Youn;Park, Sang-Kyu
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.2
    • /
    • pp.199-204
    • /
    • 2010
  • Noise map is very efficient tool to evaluate the road traffic noise. However, calculation time and accuracy of noise map heavily depend on the grid size of noise map. In this study, effects of grid size on the prediction results of road traffic noise map have been investigated in detail for urban and rural areas, respectively, and efficient grid size for the noise map has been proposed.

A Study for Improvement Performance on Using Exponentially Weighted Moving Average at IPv6 networks (IPv6 네트웍 환경에서 지수가중적 이동평균 기법을 이용한 성능향상에 관한 연구)

  • Oh, Ji-Hyun;Jeong, Choong-Kyo
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2007.08a
    • /
    • pp.323-326
    • /
    • 2007
  • Mobility Anchor Points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro handoff. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we proposed a cost effective MAP selection scheme. When leaving the current MAP domain. the mobile node calculates the optimum MAP domain size to minimize the local mobility cost at the new MAP domain considering mobile node's velocity and packet transmission rate. The mobile node then selects a MAP domain of size close to the optimum domain size calculated among the candidate MAP domains. In this way, it is possible for the mobile node to select an optimal MAP adaptively taking the network and node states into account, thus reducing the communication cost.

  • PDF

Analysis of Classification Characteristics for Rainfall-runoff and TOC Variation according to the Change of Map Size and Array using SOM (SOM 적용을 위한 Map Size와 Array의 변화에 따른 강우-유출 및 TOC관계 분석)

  • Park, Sung-Chun;Kim, Yong-Gu;Roh, Kyong-Bum;Lee, Han-Min
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2008.05a
    • /
    • pp.2066-2070
    • /
    • 2008
  • 본 연구는 인공신경망(Artificial Neural Networks: ANNs)기법의 일종인 자기조직화(Self Organizing Map: SOM) 이론을 이용한다. 자기조직화 특성을 이용하여 스스로 학습이 가능하고, 구조상 수행이 빨라 학습 단계에 소요되는 시간을 줄 일 수 있는 장점을 가진 자기조직화 이론을 도입하고, 수질자료 중 전체 유기물의 양을 나타내며 난분해성 물질에 대한 해석이 가능하고 재현성이 탁월한 TOC 와 강우-유출량 자료의 분포적 양상과 특징을 분석하여 예측을 위한 모형화 과정에 기여하고자 한다. 최적의 Map Size와 Map Array 결정을 위해 수집된 강우와 유출량자료 및 TOC 자료에 대해 Garcia의 경험식을 이용하여 Map을 구성하는 단위구조의 총 수(M)를 산정하여 M값에 따른 종방향 및 횡방향 크기를 결정하는 다수의 Map 크기를 검토하고, 또한 Map 배열은 2차원 배열의 사각형배열(Rectangular array)과 육각형배열(Hexagonal array)에 대해서도 복합적으로 검토하여 최적의 특성조건을 결정하여 강우-유출 및 TOC 관계의 분할특성을 분석한다.

  • PDF

A Memory-Efficient Block-wise MAP Decoder Architecture

  • Kim, Sik;Hwang, Sun-Young;Kang, Moon-Jun
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.615-621
    • /
    • 2004
  • Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

  • PDF

Cost Effective Mobility Anchor Point Selection Scheme for HMIPv6 Networks (HMIPv6 환경에서의 최소비용 MAP 선택 기법)

  • Roh, Myoung-Hwa;Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.26 no.B
    • /
    • pp.207-213
    • /
    • 2006
  • Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

  • PDF

An Analysis of the Cognitive Characteristics of Child Residential Environment Using Cognitive Map (인지도(Cognitive Map)를 활용한 아동의 주거환경 인지 특성 분석)

  • Park, Jeong-Hee;Kim, Mi-Hui
    • Journal of the Korean housing association
    • /
    • v.23 no.5
    • /
    • pp.19-29
    • /
    • 2012
  • It is very necessary to know about child recognition of residential environment to plan and design an environment proper for children's growth and development. The research method using Cognitive Map, which may be defined as "an overall mental image of representation of the space and layout of a setting" can be a good tool for studying child recognition of residential environment. This study analyzed the child recognition of the size of home range, the number of residential environment elements, the types of Cognitive Map and the levels of Cognitive Map to understand the contents of child recognition about their residential environment. Subjects were 206 children in age6, 8 and 10 in Gwanju and Jeonnam area. As the result of the study, we found that 70% of child recognized 100~500 M as the size of home range, and that the number of the elements of residential environment was 7, average. And we also found that sequential map was more popular than spatial map in child's Cognitive Map type and that almost 60% of child respondents drew the Cognitive Map of level 1 complexity type. As the result of this study, we could know that the research method using Cognitive Map was very useful for understanding the child recognition of residential environment.

Determination of the Optimized Structure of Self-Organizing Map for the Rainfall-Runoff Analysis in Naju (나주지점의 강우-유출 해석을 위한 최적의 SOM 구조 결정)

  • Kim, Yong-Gu;Jin, Young-Hoon;Park, Sung-Chun;Jeong, Choen-Lee
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.10
    • /
    • pp.995-1007
    • /
    • 2008
  • Studies on modeling the rainfall-runoff relationship which shows nonlinear trend strongly use artificial neural networks theory not only for the prediction but also for the characteristics analysis of the data used by pattern classification. For the pattern classification, the results from Self-Organizing Map (SOM) mention that the map size and array for the SOM training have significantly influenced on the SOM performance. Since there is no deterministic method or theoretical equation to determine the number of rows and columns for the map size, hexagonal array is generally used for the map array. Therefore, this study present a determination of the optimized map structure for the rainfall-runoff analysis in Naju station considering the map size and array simultaneously which can represent the classified characterization of rainfall-runoff relationship. The result showed that the map size of 20$\times$16 hexagonal array with 8-clustered patterns was selected as an appropriate map structure for rainfall-runoff analysis in Naju station.

Turbo MAP Decoding Algorithm based on Radix-4 Method (Radix-4 방식의 터보 MAP 복호 알고리즘)

  • 정지원;성진숙;김명섭;오덕길;고성찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.546-552
    • /
    • 2000
  • The decoding of Turbo-Code relies on the application of a soft input/soft output decoders which can be realized using maximum-a-posteriori(MAP) symbol estimator[l]. Radix-2 MAP decoder can not be used for high speed communications because of a large number of interleaver block size N. This paper proposed a new simple method for radix-4 MAP decoder based on radix-2 MAP decoder in order to reduce the interleave block size. A branch metrics, forward and backward recursive functions are proposed for applying to radix-4 MAP structure with symbol interleaver. Radix-4 MAP decoder shall be illustratively described and its error performance capability shall be compared to conventional radix-2 MAP decoder in AWGN channel.

  • PDF