• Title/Summary/Keyword: overhead reduction

Search Result 188, Processing Time 0.027 seconds

Overhead Reduction by Channel Estimation Using Linear Interpolation for SC-FDE Transmission (SC-FDE 전송 방식에서 선형 보간법을 이용한 채널추정으로 오버헤드 감소 방안)

  • Song, Min-Su;Kil, Haeng-Bok;Kim, Jaesin;Jeong, Eui-Rim
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.611-613
    • /
    • 2017
  • This paper proposes a new method to reduce the overhead by pilots for single carrier frequency domain equalization (SC-FDE) transmission. In the conventional SC-FDE transmission structure, the overhead by transmitting pilot are heavy because the pilot are transmitted at every SC-FDE block. The proposed SC-FDE structure has fewer pilots and many SC-FCE blocks are transmitted between pilots. The channel estimation and equalization is performed at the pilot period and the channels between pilots are estimated through linear interpolation. This reduces the pilot overhead by reducing the pilot transmission compared with the conventional structure, and enables reliable channel estimation and equalization.

  • PDF

Optimizing Garbage Collection Overhead of Host-level Flash Translation Layer for Journaling Filesystems

  • Son, Sehee;Ahn, Sungyong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.27-35
    • /
    • 2021
  • NAND flash memory-based SSD needs an internal software, Flash Translation Layer(FTL) to provide traditional block device interface to the host because of its physical constraints, such as erase-before-write and large erase block. However, because useful host-side information cannot be delivered to FTL through the narrow block device interface, SSDs suffer from a variety of problems such as increasing garbage collection overhead, large tail-latency, and unpredictable I/O latency. Otherwise, the new type of SSD, open-channel SSD exposes the internal structure of SSD to the host so that underlying NAND flash memory can be managed directly by the host-level FTL. Especially, I/O data classification by using host-side information can achieve the reduction of garbage collection overhead. In this paper, we propose a new scheme to reduce garbage collection overhead of open-channel SSD by separating the journal from other file data for the journaling filesystem. Because journal has different lifespan with other file data, the Write Amplification Factor (WAF) caused by garbage collection can be reduced. The proposed scheme is implemented by modifying the host-level FTL of Linux and evaluated with both Fio and Filebench. According to the experiment results, the proposed scheme improves I/O performance by 46%~50% while reducing the WAF of open-channel SSDs by more than 33% compared to the previous one.

Study for Catenary System in High Speed Railway Long Tunnel applied UIC Standard (UIC 규격을 적용한 고속철도 장대터널구간의 전차선로 검토)

  • Ahn, Young-Hoon;Song, Jin-Ho
    • Proceedings of the KSR Conference
    • /
    • 2010.06a
    • /
    • pp.1924-1929
    • /
    • 2010
  • In long tunnel If we reduce the length of system height on catenary system, tunnel construction cost is cut down. It is because of tunnel section curtailment. So that we have review reduction of system height according to tunnel section. We have designed reduction of system height considered characteristics of overhead contact systems within UIC 799 code.

  • PDF

Test Time Reduction for BIST by Parallel Divide-and-Conquer Method (분할 및 병렬 처리 방법에 의한 BIST의 테스트 시간 감소)

  • Choe, Byeong-Gu;Kim, Dong-Uk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.6
    • /
    • pp.322-329
    • /
    • 2000
  • BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

  • PDF

Growth and Yield Responses of Soybean to Overhead Flooding Duration at Four Growth Stages (관수시간에 따른 콩의 생육 및 수량반응)

  • 박경열;이종형;조영철
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.40 no.1
    • /
    • pp.92-97
    • /
    • 1995
  • The objective of this study is to investigate the growth characters of overhead flooded soybean plants at four growth stage. Overhead flooding treatments were applied at the vegetative growth stage ($V_3,\;V_6$) and the reproductive stage ($R_2,\;R_4$) for 6.12.24 hrs, respectively. Yield and yield components were more decreased as the overhead flooding duration was longer and the growth stage was later. Yield was not reduced significantly in soybean plants flooded at $V_3$ stage regardless of flooding duration, and flooded 6 or 12 hrs at $V_6$ stage. When compared to the control, 27 to 36% of yield reduction was observed in soybean plants flooded for 24 hrs at $V_6$ stage, 6 or 12 hrs at $R_2$ stage, and 6 hrs at $R_4$ stage. And 43%, 53% and 66% of yield were reduced through the flooding treatment for 24 hrs at $R_2$ stage 12 hrs and 24 hrs at $R_4$ stage, respectively. So yield reduction was higher in overhead flooded soybean plants at the reproductive stage than that at the vegetative growth stage.

  • PDF

Application of Time-Driven Activity-Based Costing(TDABC) for Total Productive Maintenance(TPM) and Cost of Quality(COQ) Processes (TPM과 COQ 프로세스에서 시간동인 ABC시스템의 활용)

  • Choi, Sungwoon
    • Journal of the Korea Safety Management & Science
    • /
    • v.17 no.1
    • /
    • pp.321-335
    • /
    • 2015
  • This study introduces the methods to apply and develop the integrated Cost of Quality (COQ) and Time-Driven Activity-Based Costing (TDABC) model for seeking not only quality improvement but also reduction of overhead cost. Inefficient and uneconomical COQ activities can be identified by using time driver which also maximizes the quality improvement for Prevention-Appraisal- Failure (PAF) quality costs. In contrast, reduction of the indirect cost of unused capacity resource using Quality Cost Capacity Ratio (QCCR) of TDABC minimizes overhead cost for COQ activities. In addition, linkage between Overall Equipment Effective (OEE) and Time Driver develops the integrated system of Total Productive Maintenance (TPM) and TDABC model. Lean OEE maximizes when an Unused Time (UT) of TDABC that are TPM losses and lean wastes reduces whereas the TPM Cost Capacity Ratio (TCCR) of TDABC minimizes indirect cost for non-value added TPM activities. Numerical examples are derived to better understand the proposed COQ/TDABC model and TPM/TDABC model from this paper. From the proposed model, process mapping and time driver of TDABC are known to lessen indirect cost from general ledger of comprehensive income statement with a better quality innovation and improvement of equipment.

Reduction of Hardware Overhead for Test Pattern Generation in BIST (내장형 자체 테스트 패턴 생성을 위한 하드웨어 오버헤드 축소)

  • 김현돈;신용승;김용준;강성호
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.7
    • /
    • pp.526-531
    • /
    • 2003
  • Recently, many BIST(Built-in Self Test) schemes have been researched to reduce test time and hardware. But, most BIST schemes about pattern generation are for deterministic pattern generation. In this paper a new pseudo-random BIST scheme is provided to reduce the existing test hardware and keep a reasonable length of test time. Theoretical study demonstrates the possibility of the reduction of the hardware for pseudo-random test with some explanations and examples. Also the experimental results show that in the proposed test scheme the hardware for the pseudo-random test is much less than in the previous scheme and provide comparison of test time between the proposed scheme and the current one.

Lattice Reduction-aided Detection with Out-of-Constellation Point Correction for MIMO Systems (MIMO 시스템을 위한 Out-of-Constellation Point 보정 Lattice Reduction-aided 검출기법)

  • Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1339-1345
    • /
    • 2007
  • An important drawback in Lattice Reduction (LR) aided detectors has been investigated. For the solution, an improved LR aided detection with ignorable complexity overhead is proposed for MIMO system, where the additional correction operation is performed for the case of unreliable symbol decision. We found that LR aided detection errors mainly occur when the lattice points after the inverse lattice transform in the final step fall outside the constellation point set. In the proposed scheme, we check whether or not the lattice point obtained through LR detection is out of constellation. Only for the case of out of constellation, we additionally perform ML search with reduced search region restricted to the neighboring points near to the obtained lattice points. Using this approach, we can effectively and significantly improve the detection performance with just a slight complexity overhead which is negligible compared to full searched ML scheme. Simulation results show that the proposed scheme achieves the detection performance near to that of the ML detection with a lower computational complexity.

The Ewe's Reproductive Performance, Growth Rate and Carcass Quality of Lambs Kept in a Barn vs Those Kept under an Overhead Shelter

  • Kuznicka, Ewa;Rant, Witold
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.26 no.2
    • /
    • pp.211-217
    • /
    • 2013
  • A herd of polish lowland local sheep was divided into two equal groups: the first group was kept under an overhead shelter, and the second group was kept in a warm barn. The effect of maintenance on ewe's reproductive performance, survival as well as the growth rate of lambs, and their carcasses quality was investigated. The lack of differences in fertility and prolificacy of ewes as well as in the survival and growth rate between the groups confirmed a good adaptation of $\dot{Z}$ela$\acute{z}$nie$\acute{n}$ska sheep to low temperature. Harsh environmental conditions did not cause a significant decrease of the body weight growth; however, they brought in an (insignificant) reduction of subcutaneous fat thickness and meatiness of the loin part of a lamb's body. The fat content of carcasses obtained from lambs reared under the overhead shelter was significantly lower, with no differences of meat and bones contribution between the groups.

X+ Join : The improved X join scheme for the duplicate check overhead reduction (엑스플러스 조인 : 조인 중복체크의 오버헤드를 줄이기 위한 개선된 방법)

  • Baek, Joo-Hyun;Park, Sung-Wook;Jung, Sung-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.28-32
    • /
    • 2006
  • 유비쿼터스(Ubiquitous)환경과 같이 외부로부터 입력되는 데이터가 stream의 형식으로 실시간으로 들어오고, 입력의 끝을 알 수 없는 환경에서는 기존의 join방식으로는 문제를 해결 할 수 없다. 또한 이러한 환경 하에서는 데이터의 크기나 특성이 모두 다르고 네트워크 상태에 따라 입력이 많은 영향을 받게 된다. 이런 stream환경의 join연산을 위하여 double pipelined hash join, Xjoin, Pjoin등 많은 알고리즘이 기존의 연구를 대표하여 왔다. 그 중 Xjoin은 symmetric hash join과 hybrid hash join의 특징들을 이용해서 들어오는 data의 흐름에 따라서 reactive하게 join과정을 조절함으로써 streaming data에 대한 join을 수행한다. 그러나 여러 단계의 수행에 따른 연산의 중복결과를 체크하기 위한 overhead로 인해 성능이 떨어진다. 이 논문에서는 이러한 점을 개선하기 위해서 Xjoin의 수행과정을 수정한 방법을 제시할 것이다. 각 partition마다 구분자만을 추가함으로써 간단하게 중복을 만들어내지 않는 방법을 제안하고 불필요한 연산과 I/O를 줄일 수 있도록 partition선택방법을 추가할 것이다. 이를 통해서 중복된 연산인지 체크하는 과정을 상당히 단순화함으로써 좀 더 좋은 성능을 가지게 될 것이고 또한 timestamp를 저장해야 하는 overhead를 줄여서 전체 연산에 필요한 저장 공간을 절약할 수 있다.

  • PDF