• 제목/요약/키워드: Memory reduction

Search Result 473, Processing Time 0.022 seconds

Finite Element Stress Analysis of Coil Springs using a Multi-level Substructuring Method II : Validation and Analysis (다단계 부분구조법을 이용한 코일스프링의 유한요소 응력해석 II : 검증 및 해석)

  • Kim, Jin-Young;Huh, Hoon
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.8 no.3
    • /
    • pp.151-162
    • /
    • 2000
  • This study is concerned with computerized multi-level substructuring methods and stress analysis of coil springs. The purpose of substructuring methods is to reduce computing time and capacity of computer memory by multiple level reduction of the degrees of freedom in large size problems that are modeled by three dimensional continuum finite elements. In this paper, the spring super element developed is investigated with tension, torsion, and bending of a cylindrical bar in order to verify its accuracy and efficiency for the multi-level substructuring method. And then the algorithm is applied to finite element analysis of coil springs. The result demonstrates the validity of the multi-level substructuring method and the efficiency in computing time and memory by providing good computational results in coil spring analysis.

  • PDF

A Study on Developement of Portable Digital Bio-signal Recorder (디지털 휴대용 생체 기록계 개발에 관한 연구)

  • Lee, H.J.;Chun, T.Y.;Yun, C.H.;Huh, W.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1993 no.05
    • /
    • pp.109-113
    • /
    • 1993
  • In this paper, we devised a simple portable digital recorder for a day life ECG signal recording. The system are consisted of ECG amp. part, signal conditioning part. A/D converter, data compression part and digital memory part. An ADPCM algorithm used at data compress part for 50% of data reduction. The maximum lengths of recording times take 3 hours in 1 mega byte memory.

  • PDF

Enhanced Inter-Symbol Interference Cancellation Scheme for Diffusion Based Molecular Communication using Maximum Likelihood Estimation

  • Raut, Prachi;Sarwade, Nisha
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.5035-5048
    • /
    • 2016
  • Nano scale networks are futuristic networks deemed as enablers for the Internet of Nano Things, Body area nano networks, target tracking, anomaly/ abnormality detection at molecular level and neuronal therapy / drug delivery applications. Molecular communication is considered the most compatible communication technology for nano devices. However, connectivity in such networks is very low due to inter-symbol interference (ISI). Few research papers have addressed the issue of ISI mitigation in molecular communication. However, many of these methods are not adaptive to dynamic environmental conditions. This paper presents an enhancement over original Memory-1 ISI cancellation scheme using maximum likelihood estimation of a channel parameter (λ) to make it adaptable to variable channel conditions. Results of the Monte Carlo simulation show that, the connectivity (Pconn) improves by 28% for given simulation parameters and environmental conditions by using enhanced Memory-1 cancellation method. Moreover, this ISI mitigation method allows reduction in symbol time (Ts) up to 50 seconds i.e. an improvement of 75% is achieved.

Effects of Different Advance Organizers on Mental Model Construction and Cognitive Load Decrease

  • OH, Sun-A;KIM, Yeun-Soon;JUNG, Eun-Kyung;KIM, Hoi-Soo
    • Educational Technology International
    • /
    • v.10 no.2
    • /
    • pp.145-166
    • /
    • 2009
  • The purpose of this study was to investigate why advance organizers (AO) are effective in promoting comprehension and mental model formation in terms of cognitive load. Two experimental groups: a concept-map AO group and a key-word AO group and one control group were used. This study considered cognitive load in view of Baddeley's working memory model: central executive (CE), phonological loop (PL), and visuo-spatial sketch pad (VSSP). The present experiment directly examined cognitive load using dual task methodology. The results were as follows: central executive (CE) suppression task achievement for the concept map AO group was higher than the key word AO group and control group. Comprehension and mental model construction for the concept map AO group were higher than the other groups. These results indicated that the superiority of concept map AO owing to CE load decrement occurred with comprehension and mental model construction in learning. Thus, the available resources produced by CE load reduction may have been invested for comprehension and mental model construction of learning contents.

A Study on Design and Cache Replacement Policy for Cascaded Cache Based on Non-Volatile Memories (비휘발성 메모리 시스템을 위한 저전력 연쇄 캐시 구조 및 최적화된 캐시 교체 정책에 대한 연구)

  • Juhee Choi
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.3
    • /
    • pp.106-111
    • /
    • 2023
  • The importance of load-to-use latency has been highlighted as state-of-the-art computing cores adopt deep pipelines and high clock frequencies. The cascaded cache was recently proposed to reduce the access cycle of the L1 cache by utilizing differences in latencies among banks of the cache structure. However, this study assumes the cache is comprised of SRAM, making it unsuitable for direct application to non-volatile memory-based systems. This paper proposes a novel mechanism and structure for lowering dynamic energy consumption. It inserts monitoring logic to keep track of swap operations and write counts. If the ratio of swap operations to total write counts surpasses a set threshold, the cache controller skips the swap of cache blocks, which leads to reducing write operations. To validate this approach, experiments are conducted on the non-volatile memory-based cascaded cache. The results show a reduction in write operations by an average of 16.7% with a negligible increase in latencies.

  • PDF

A Vector-Perturbation Based Lattice-Reduction using look-Up Table (격자 감소 기반 전부호화 기법에서의 효율적인 Look-Up Table 생성 방법)

  • Han, Jae-Won;Park, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6A
    • /
    • pp.551-557
    • /
    • 2011
  • We investigate lattice-reduction-aided precoding techniques using Look-Up table (LUT) for multi-user multiple-input multiple-output(MIMO) systems. Lattice-reduction-aided vector perturbation (VP) gives large sum capacity with low encoding complexity. Nevertheless lattice-reduction process based on the LLL-Algorithm still requires high computational complexity since it involves several iterations of size reduction and column vector exchange. In this paper, we apply the LUT-aided lattice reduction on VP and propose a scheme to generate the LUT efficiently. Simulation results show that a proposed scheme has similar orthogonality defect and Bit-Error-Rate(BER) even with lower memory size.

Implementation of High Speed Big Data Processing System using In Memory Data Grid in Semiconductor Process (반도체 공정에서 인 메모리 데이터 그리드를 이용한 고속의 빅데이터 처리 시스템 구현)

  • Park, Jong-Beom;Lee, Alex;Kim, Tony
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.5
    • /
    • pp.125-133
    • /
    • 2016
  • Data processing capacity and speed are rapidly increasing due to the development of hardware and software in recent time. As a result, data usage is geometrically increasing and the amount of data which computers have to process has already exceeded five-thousand transaction per second. That is, the importance of Big Data is due to its 'real-time' and this makes it possible to analyze all the data in order to obtain accurate data at right time under any circumstances. Moreover, there are many researches about this as construction of smart factory with the application of Big Data is expected to have reduction in development, production, and quality management cost. In this paper, system using In-Memory Data Grid for high speed processing is implemented in semiconductor process which numerous data occur and improved performance is proven with experiments. Implemented system is expected to be possible to apply on not only the semiconductor but also any fields using Big Data and further researches will be made for possible application on other fields.

Twiddle Factor Index Generate Method for Memory Reduction in R2SDF FFT (R2SDF FFT의 메모리 감소를 위한 회전인자 인덱스 생성방법)

  • Yang, Seung-Won;Kim, Yong-Eun;Lee, Jong-Yeol
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.5
    • /
    • pp.32-38
    • /
    • 2009
  • FTT(Fast Fourier Transform) processor is widely used in OFDM(Orthogonal Frequency Division Multiplesing) system. Because of the increased requirement of mobility and bandwidth in the OFDM system, they need large point FTT processor. Since the size of memory which stores the twiddle factor coefficients are proportional to the N of FFT size, we propose a new method by which we can reduce the size of the coefficient memory. In the proposed method, we exploit a counter and unsigned multiplier to generate the twiddle factor indices. To verify the proposed algorithm, we design TFCGs(Twiddle Factor Coefficient Generator) for 1024pint FFTs with R2SDF(Radix-2 Single-Path Delay Feedback), $R2^3SDF,\;R2^3SDF,\;R2^4SDF$ architectures. The size of ROM is reduced to 1/8N. In the case of $R2^4SDF$ architecture, the area and the power are reduced by 57.9%, 57.5% respectively.

A Main Memory-resident Multi-dimensional Index Structure Employing Partial-key and Compression Schemes (부분키 기법과 압축 기법을 혼용한 주기억장치 상주형 다차원 색인 구조)

  • 심정민;민영수;송석일;유재수
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.384-394
    • /
    • 2004
  • Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

The Optimization of $0.5{\mu}m$ SONOS Flash Memory with Polycrystalline Silicon Thin Film Transistor (다결정 실리콘 박막 트랜지스터를 이용한 $0.5{\mu}m$ 급 SONOS 플래시 메모리 소자의 개발 및 최적화)

  • Kim, Sang Wan;Seo, Chang-Su;Park, Yu-Kyung;Jee, Sang-Yeop;Kim, Yun-Bin;Jung, Suk-Jin;Jeong, Min-Kyu;Lee, Jong-Ho;Shin, Hyungcheol;Park, Byung-Gook;Hwang, Cheol Seong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.111-121
    • /
    • 2012
  • In this paper, a poly-Si thin film transistor with ${\sim}0.5{\mu}m$ gate length was fabricated and its electrical characteristics are optimized. From the results, it was verified that making active region with larger grain size using low temperature annealing is an efficient way to enhance the subthreshold swing, drain-induced barrier lowering and on-current characteristics. A SONOS flash memory was fabricated using this poly-Si channel process and its performances are analyzed. It was necessary to optimize O/N/O thickness for the reduction of electron back tunneling and the enhancement of its memory operation. The optimized device showed 2.24 V of threshold voltage memory windows which coincided with a well operating flash memory.