• Title/Summary/Keyword: Memory Reference

Search Result 290, Processing Time 0.022 seconds

The 4bit Cell Array Structure of PoRAM and A Sensing Method for Drive this Structure (PoRAM의 4bit 셀 어레이 구조와 이를 동작시키기 위한 센싱 기법)

  • Kim, Jung-Ha;Lee, Sang-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.6 s.360
    • /
    • pp.8-18
    • /
    • 2007
  • In this paper, a 4bit cell way structure of PoRAM and the sensing method to drive this structure are researched. PoRAM has a different operation from existing SRAM and DRAM. The operation is that when certain voltage is applied between top electrode and bottom electrode of PoRAM device we can classify the cell state by measuring cell current which is made by changing resistance of the cell. In the decoder selected by new-addressing method in the cell array, the row decoder is selected "High" and the column decoder is selected "Low" then certain current will flow to the bit-line. Because this current is detect, in order to make large enough current, the voltage sense amplifier is used. In this case, usually, 1-stage differential amplifier using current mirror is used. Furthermore, the detected value at the cell is current, so a diode connected NMOSFET, that is, a device resistor is used at the input port of the differential amplifier to converter current into voltage. Using this differential amplifier, we can classify the cell states, erase mode is "Low" and write mode is "High", by comparing the input value, Vin, that is a product of current value multiplied by resistor value with a reference voltage, Vref.

A Hardwired Location-Aware Engine based on Weighted Maximum Likelihood Estimation for IoT Network (IoT Network에서 위치 인식을 위한 가중치 방식의 최대우도방법을 이용한 하드웨어 위치인식엔진 개발 연구)

  • Kim, Dong-Sun;Park, Hyun-moon;Hwang, Tae-ho;Won, Tae-ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.11
    • /
    • pp.32-40
    • /
    • 2016
  • IEEE 802.15.4 is the one of the protocols for radio communication in a personal area network. Because of low cost and low power communication for IoT communication, it requires the highest optimization level in the implementation. Recently, the studies of location aware algorithm based on IEEE802.15.4 standard has been achieved. Location estimation is performed basically in equal consideration of reference node information and blind node information. However, an error is not calculated in this algorithm despite the fact that the coordinates of the estimated location of the blind node include an error. In this paper, we enhanced a conventual maximum likelihood estimation using weighted coefficient and implement the hardwired location aware engine for small code size and low power consumption. On the field test using test-beds, the suggested hardware based location awareness method results better accuracy by 10 percents and reduces both calculation and memory access by 30 percents, which improves the systems power consumption.

AN EXPLORATORY STUDY COMPARING BLOOD METAL CONCENTRATIONS BETWEEN STROKE AND NON-STROKE PATIENTS IN KOREANS

  • Lee, Sun-Dong;Ko, Seong-Gyu;Kim, Rok-Ho;Hu, Howard;Amarasiriwardena, Chitra J.;Park, Hae-Mo
    • Proceedings of the Korean Environmental Health Society Conference
    • /
    • 2005.12a
    • /
    • pp.87-94
    • /
    • 2005
  • Results from previous studies revealed that metal level in the body is related to certain types of diseases. For example. serum copper level with chronic heart failure, iron and transferrin in the blood serum with acute cerebral vascular diseases, Zn in the CNS, lead with neurotoxicity, hypertension, genetic damage, arsenic with cancer skin lesion, Al with neurobehavioral function (cognitive impairment and memory disorder), and etc. The rate of stroke has increased in recent years and several metals were found to be responsible for causing stroke. This study compared several blood metal concentrations between stroke and non-stroke patients. Patients with stroke (116 samples) and non-stroke (111 samples including lowback pain and others) participated in this study. Total of 227 blood samples were collected and participants completed questionnaires regarding age, gender, occupation, residence, alcohol, smoking, and etc. To be qualified into the stroke group, patients have never experienced stroke previously. Subjects only included ischemic stroke and intracerebral hemorrhage patients diagnosed by brain CT and brain MRI. Patients with high risk of metal exposure such as herbal intake and job related exposure were excluded. 10ml of blood samples were analyzed by ICP-MS method at the Center of Nature and Science at Sangji University. Metal geometric mean (SD) concentrations in blood of study subjects showed higher values, 2.64-36.12%, than WHO reference values in Mn, Ni, Hg, Se, and As. Metal concentration in blood of stroke patients non-adjusted for potential confounders was higher except for Hg and also higher except for Ni in adjusted for potential confounders. Co was significantly higher in stroke patients (p=0.002) than non-stroke patients adjusted for potential confounders. Regression coefficient values of stroke patients was 0.17-8.25 in each metals. Odd ratio of stroke patients had 0.96 (Ni)-2.68 (Co) compared to non-stroke cases. This result means that Co increase of 1 raises the risk ratio of stroke by 2.86 times. Based on the results, metal concentration in blood seems to affect incidence of stroke.

  • PDF

A New Method of Liver Size Estimation on Hepatic Scintigram -Hepato-abdominal Ratio (간신티그램상 간크기의 새로운 평가방법 -간.복부횡경비-)

  • Yang, Il-Kwon;Yoon, Sung-Do;Park, Seog-Hee;Bahk, Yong-Whee
    • The Korean Journal of Nuclear Medicine
    • /
    • v.16 no.2
    • /
    • pp.25-28
    • /
    • 1982
  • Estimation of liver size is essential in the diagnosis of liver disease, Many approaches have been attempted in evaluation of liver size such as the measurement of length, area and volume. Among these, area and volume measurements are accurate but complicated, so we commonly use formerly introduced various linear measurements, but in scintigraphy one must calculate the actual liver size using rate of reduction, which is time consuming. Because of these reasons, we carried out present study to represent liver size by means of a simple liver measurement like we express the cardiac size by cardiothoracic ratio. Our cases consisted of 100 clinically normal subjects as the normal group and 50 patients suffering from liver disease and diagnosed to have hepatomegaly on abdominal palpation and scintigram at Dept, of Radiology of St. Mary's Hospital, Catholic Medical College during the period of 8 months from Jan. 1980. We measured the liver size using 4 linear diameters(Fig. 1). And as the reference measurement, the distance from the right margin of the liver to the left margin of the spleen was measured. We called this "abdominal transverse diameter(ATD)". The results were as follows; 1) The smallest value was recorded in the midline vertical diameter (MVD). It was $4.2{\pm}0.4cm$ in normal group and $5.0{\pm}0.6cm$ in the hepatomegaly group. 2) The diameter using other methods ranged from 5.6 to 7.2 cm in the normal group and from 6.3 to 7.5cm in the hepatomegaly group. 3) There was significant difference in the ratio of each diameter to ATD between the normal and hepatomegaly group (<0.01). We called this "hepato-abdominal ratio". 4) The "hepato-abdominal ratio" using MVD is $0.43{\pm}0.06$ in the normal group and $0.53{\pm}0.07$ in the hepatomegaly group. The "hepato-abdominal ratio" of MVD was most significantly different between normal and hepatomegaly group. 5) The tolerance limits(99%) of "hepato-abdominal ratio" using MVD is from 0.41 to 0.45 in the normal group and from 0.51 to 0.55 in the hepatomegaly group. Therefore, by reasons of error during measurement and convenience of memory, it was warranted to suggest hepatomegaly when "hepato-abdominal ratio" using MVD is more than 0.5 in the interpretation of hepatic scintigram.

  • PDF

Motion Estimation and Mode Decision Algorithm for Very Low-complexity H.264/AVC Video Encoder (초저복잡도 H.264 부호기의 움직임 추정 및 모드 결정 알고리즘)

  • Yoo Youngil;Kim Yong Tae;Lee Seung-Jun;Kang Dong Wook;Kim Ki-Doo
    • Journal of Broadcast Engineering
    • /
    • v.10 no.4 s.29
    • /
    • pp.528-539
    • /
    • 2005
  • The H.264 has been adopted as the video codec for various multimedia services such as DMB and next-generation DVD because of its superior coding performance. However, the reference codec of the standard, the joint model (JM) contains quite a few algorithms which are too complex to be used for the resource-constraint embedded environment. This paper introduces very low-complexity H.264 encoding algorithm which is applicable for the embedded environment. The proposed algorithm was realized by restricting some coding tools on the basis that it should not cause too severe degradation of RD-performance and adding a few early termination and bypass conditions during the motion estimation and mode decision process. In case of encoding of 7.5fps QCIF sequence with 64kbpswith the proposed algorithm, the encoder yields worse PSNRs by 0.4 dB than the standard JM, but requires only $15\%$ of computational complexity and lowers the required memory and power consumption drastically. By porting the proposed H.264 codec into the PDA with Intel PXA255 Processor, we verified the feasibility of the H.264 based MMS(Multimedia Messaging Service) on PDA.

Back-end Prefetching Scheme for Improving the Performance of Cluster-based Web Servers (클러스터 웹 서버에서 성능 향상을 위한 노드간 선인출 기법)

  • Park, Seon-Yeong;Park, Do-Hyeon;Lee, Joon-Won;Cho, Jung-Wan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.5
    • /
    • pp.265-273
    • /
    • 2002
  • With the explosive growth of WWW traffic, there is an increasing demand for the high performance Web servers to provide a stable Web service to users. The cluster-based Web server is a solution to core with the heavy access from users, easily scaling the server according to the loads. In the cluster-based Web sewer, a back-end node may not be able to serve some HTTP requests directly because it does not have the requested contents in its main memory. In this case, the back-end node has to retrieve the requested contents from its local disk or other back-end nodes in the cluster. To reduce service latency, we introduce a new prefetch scheme. The back-end nodes predict the next HTTP requests and prefetch the contents of predicted requests before the next requests arrive. We develop three prefetch algorithms bated on some useful information gathered from many clients'HTTP requests. Through trace-driven simulation, the service latency of the prefetch scheme is reduced by 10 ~ 25% as compared with no prefetch scheme. Among the proposed prefetch algorithms, Time and Access Probability-based Prefetch (TAP2) algorithm, which uses the access probability and the inter-reference time of Web object, shows the best performance.

Fast Motion Estimation for Variable Motion Block Size in H.264 Standard (H.264 표준의 가변 움직임 블록을 위한 고속 움직임 탐색 기법)

  • 최웅일;전병우
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.209-220
    • /
    • 2004
  • The main feature of H.264 standard against conventional video standards is the high coding efficiency and the network friendliness. In spite of these outstanding features, it is not easy to implement H.264 codec as a real-time system due to its high requirement of memory bandwidth and intensive computation. Although the variable block size motion compensation using multiple reference frames is one of the key coding tools to bring about its main performance gain, it demands substantial computational complexity due to SAD (Sum of Absolute Difference) calculation among all possible combinations of coding modes to find the best motion vector. For speedup of motion estimation process, therefore, this paper proposes fast algorithms for both integer-pel and fractional-pel motion search. Since many conventional fast integer-pel motion estimation algorithms are not suitable for H.264 having variable motion block sizes, we propose the motion field adaptive search using the hierarchical block structure based on the diamond search applicable to variable motion block sizes. Besides, we also propose fast fractional-pel motion search using small diamond search centered by predictive motion vector based on statistical characteristic of motion vector.

Wide Range Analog Dual-Loop Delay-Locked Loop (광대역 아날로그 이중 루프 Delay-Locked Loop)

  • Lee, Seok-Ho;Kim, Sam-Dong;Hwang, In-Seok
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.1
    • /
    • pp.74-84
    • /
    • 2007
  • This paper presents a new dual-loop Delay Locked Loop(DLL) to expand the delay lock range of a conventional DLL. The proposed dual-loop DLL contains a Coarse_loop and a Fine_loop, and its operation utilizes one of the loops selected by comparing the initial time-difference among the reference clock and 2 internal clocks. The 2 internal clock signals are taken, respectively, at the midpoint and endpoint of a VCDL and thus are $180^{\circ}$ separated in phase. When the proposed DLL is out of the conventional lock range, the Coarse_loop is selected to push the DLL in the conventional lock range and then the Fine_loop is used to complete the locking process. Therefore, the proposed DLL is always stably locked in unless it is harmonically false-locked. Since the VCDL employed in the proposed DLL needs two control voltages to adjust the delay time, it uses TG-based inverters, instead of conventional, multi-stacked, current-starved inverters, to compose the delay line. The new VCDL provides a wider delay range than a conventional VCDL In overall, the proposed DLL demonstrates a more than 2 times wider lock range than a conventional DLL. The proposed DLL circuits have been designed, simulated and proved using 0.18um, 1.8V TSMC CMOS library and its operation frequency range is 100MHz${\sim}$1GHz. Finally, the maximum phase error of the DLL locked in at 1GHz is less than 11.2ps showing a high resolution and the simulated power consumption is 11.5mW.

Optimized DSP Implementation of Audio Decoders for Digital Multimedia Broadcasting (디지털 방송용 오디오 디코더의 DSP 최적화 구현)

  • Park, Nam-In;Cho, Choong-Sang;Kim, Hong-Kook
    • Journal of Broadcast Engineering
    • /
    • v.13 no.4
    • /
    • pp.452-462
    • /
    • 2008
  • In this paper, we address issues associated with the real-time implementation of the MPEG-1/2 Layer-II (or MUSICAM) and MPEG-4 ER-BSAC decoders for Digital Multimedia Broadcasting (DMB) on TMS320C64x+ that is a fixed-point DSP processor with a clock speed of 330 MHz. To achieve the real-time requirement, they should be optimized in different steps as follows. First of all, a C-code level optimization is performed by sharing the memory, adjusting data types, and unrolling loops. Next, an algorithm level optimization is carried out such as the reconfiguration of bitstream reading, the modification of synthesis filtering, and the rearrangement of the window coefficients for synthesis filtering. In addition, the C-code of a synthesis filtering module of the MPEG-1/2 Layer-II decoder is rewritten by using the linear assembly programming technique. This is because the synthesis filtering module requires the most processing time among all processing modules of the decoder. In order to show how the real-time implementation works, we obtain the percentage of the processing time for decoding and calculate a RMS value between the decoded audio signals by the reference MPEG decoder and its DSP version implemented in this paper. As a result, it is shown that the percentages of the processing time for the MPEG-1/2 Layer-II and MPEG-4 ER-BSAC decoders occupy less than 3% and 11% of the DSP clock cycles, respectively, and the RMS values of the MPEG-1/2 Layer-II and MPEG-4 ER-BSAC decoders implemented in this paper all satisfy the criterion of -77.01 dB which is defined by the MPEG standards.

A Real-Time Multiple Circular Buffer Model for Streaming MPEG-4 Media (MPEG-4 미디어 스트리밍에 적합한 실시간형 다중원형버퍼 모델)

  • 신용경;김상욱
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.1
    • /
    • pp.13-24
    • /
    • 2003
  • MPEG-4 is a standard for multimedia applications and provides a set of technologies to satisfy the needs of authors, service providers and end users alike. In this paper, we suggest a Real-time Multiple Circular Buffer (M4RM Buffer) model, which is suitable for streaming these MPEG-4 contents efficiently. M4RM buffer generates each structure of the buffer, which matches well with each object composing an MPEG-4 content, according to the transferred information, and manipulates multiple read/write operations only by its reference. It divides the decoder buffer and the composition buffer, which are described in the standard, by the unit of frame allocated to minimize the range of access. This buffer unit of a frame is allocated according to the object description. Also, it processes the objects synchronization within the buffer and provides APIs for an efficient buffer management to process the real-time user events. Based on the performance evaluation, we show that M4RM buffer model decreases the waiting time in a buffer frame, and so allows the real-time streaming of an MPEG-4 content using the smaller size of the memory block than IM1-2D and Window Media Player.