• Title/Summary/Keyword: redundant cell

Search Result 50, Processing Time 0.023 seconds

Hardware Design of High Performance CAVLC Encoder (H.264/AVC를 위한 고성능 CAVLC 부호화기 하드웨어 설계)

  • Lee, Yang-Bok;Ryoo, Kwang-Ki
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.3
    • /
    • pp.21-29
    • /
    • 2012
  • This paper presents optimized searching technique to improve the performance of H.264/AVC. By using the proposed forward and backward searching algorithm, redundant cycles of latency for data reordering can be removed. Furthermore, in order to reduce the total number of execution cycles of CAVLC encoder, early termination mode and two stage pipelined architecture are proposed. The experimental result shows that the proposed architecture needs only 36.0 cycles on average for each $16{\times}16$ macroblock encoding. The proposed architecture improves the performance by 57.8% than that of previous designs. The proposed CAVLC encoder was implemented using Verilog HDL and synthesized with Magnachip $0.18{\mu}m$ standard cell library. The synthesis result shows that the gate count is about 17K with 125Mhz clock frequency.

Reduction of the Number of Power States for High-level Power Models based on Clock Gating Enable Signals (클럭 게이팅 구동신호 기반 상위수준 전력모델의 전력 상태 수 감소)

  • Choi, Hosuk;Yi, Joonhwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.28-35
    • /
    • 2015
  • In this paper, we propose to identify redundant power states of high-level power model based on clock gating enable signals(CGENs) using dependencies of Boolean functions and structural dependencies of clock gating cells. Three functional dependencies between two CGENs, namely equvalence, inversion, and inclusion, are used. Functions of CGENs in a circuit are represented by binary decision diagrams (BDDs) and the functional relations are used to reduce the number of power states. The structural dependency appears when a clock gating cell drives another clock gating cells in a circuit. Automatic dependency checking algorithm has been proposed. The experimental results show the average number of power state is reduced by 59%.

Quantitative analysis of gene expression pattern in aspergillus nidulans mycelia by sequencing of 3-directed cDNA clones

  • Park. Yoon-Dong;Lee, Dong-Whan;Lee, Seog-Jae;Kim, Jong-Hwa;Chae, Keon-Sang
    • Journal of Microbiology
    • /
    • v.34 no.1
    • /
    • pp.25-29
    • /
    • 1996
  • Since sequencing of randomly selected cDNA clones has been known to be a powerful approach to obtain information on gene expression pattern in specific cells or tissues, we have analyzed a 3'-directed cDNA library of vegetative mycelia of A. nidulans by single-pass sequencing of hundreds of randomly selected clones. Sequencing of 292 cDNA clones yielded 209 gene signatures (GSs) probably representing highly or lesser expressed genes in the vegetative mycelia. Among the 209 GSs, 25 (79 cDNA clones) appeared more than once and 184 only once. One GS appeared at a highest frequency of 6 times, 2 GSs5 times, 4 GSs 4 times, a GSs 3 times and 16 GSs twice. About 6.6% GSs comprizing of 13 GSs showed alternative polyadenylation. Among 23 redundant GSs, three were common in both mycelia and sexual organs, and 22 were probably mycelia-specific. Out of 209 GSs, 36 were identified in GenBank showing of 70% or greater similaritis. Only six GSs were for A. nidulans genes, and 13 GSs were of DNA or genes encoding cytoplasmic or organellar proteins. This pattern is similar to those in the human HepG2 cell line and in human colonic mucosa, although very few genes for nuclear proteins and for protein synthesis were in A. nidulans.

  • PDF

Cataloguing of Anther Expressed Genes through Differential Slot Blot in Oriental Lily (Lilium Oriental Hybrid 'Acapulco') (아카풀코나리에서 Differential Slot Blot을 이용한 약발현 유전자 목록작성)

  • Suh, Eun-Jung;Yu, Hee Ju;Han, Bong Hee;Lim, Yong Pyo;Jeong, Mi-Jeong;Lee, Seong-Kon;Kim, Dong-Hern;Chang, An-Cheol;Yae, Byeong Woo
    • Horticultural Science & Technology
    • /
    • v.31 no.5
    • /
    • pp.598-606
    • /
    • 2013
  • Anther is the major organ of flower in responsible to reproduction and outward appearance. From anther-specific cDNA library of Lilium Oriental Hybrid 'Acapulco', 2000 expressed sequence tags were selected randomly. Differential slot blot analysis with cDNA probes from the anther and leaf was used to get anther-expressed clone and 570 non-redundant ESTs were obtained and sequenced. Compared to the GenBank database using BLASTX algorithm, 191 clones showed significant similarity but others (66.5%) did not measured to known sequence. Functional categories according to gene ontology (GO) annotation included sequence representing a significant portion of protein in cell and cell part respectively. A transcriptional analysis at 7 different organs and developmental stage was performed using northern blot with thirty ESTs as putative anther specific gene. This report suggest that selection of anther expressed clone using differential slot blot was considered as very effective tool and our current study can provide fundamental information on the lily anther including pollen furthermore.

An Efficient Spatial Index Structure for Main Memory (메인 메모리를 위한 효율적인 공간 인덱스 구조)

  • Lee, Ki-Young;Lim, Myung-Jae;Kang, Jeong-Jin;Kim, Joung-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.13-20
    • /
    • 2009
  • Recently there is growing interest in LBS requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based spatial indexes of the spatial main memory DBMS in the main memory, spatial index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMB (relative-sized MBR)compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

A Design of Fractional Motion Estimation Engine with 4×4 Block Unit of Interpolator & SAD Tree for 8K UHD H.264/AVC Encoder (8K UHD(7680×4320) H.264/AVC 부호화기를 위한 4×4블럭단위 보간 필터 및 SAD트리 기반 부화소 움직임 추정 엔진 설계)

  • Lee, Kyung-Ho;Kong, Jin-Hyeung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.145-155
    • /
    • 2013
  • In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Fractional Motion Estimation in 8K UHD($7680{\times}4320$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $10{\times}10$ reference data for interpolation, we design 2D cache buffer which consists of the $10{\times}10$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The gate count is 436.5Kgates. The proposed H.264/AVC Fractional Motion Estimation can support 8K UHD at 30 frames per second by running at 187MHz.

Efficient Processing of Aggregate Queries in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 집계 질의 처리)

  • Kim, Joung-Joon;Shin, In-Su;Lee, Ki-Young;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.3
    • /
    • pp.95-106
    • /
    • 2011
  • Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

An Efficient MBR Compression Technique for Main Memory Multi-dimensional Indexes (메인 메모리 다차원 인덱스를 위한 효율적인 MBR 압축 기법)

  • Kim, Joung-Joon;Kang, Hong-Koo;Kim, Dong-Oh;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.13-23
    • /
    • 2007
  • Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

Titanium Hemostatic Clip Tailoring Method to Overcome Vessel Caliber Discrepancy in Interposition Saphenous Vein Graft for Carotid Artery Resection (경동맥 절제술 후 재건에 사용된 복재정맥의 혈관구경 불일치를 극복하기 위한 Titanium Hemostatic Clip 봉합방법)

  • Kim Sun-Ho;Lim Young-Chang;Lee Sei-Young;Lim Jae-Yol;Choi Eun-Chang
    • Korean Journal of Head & Neck Oncology
    • /
    • v.20 no.2
    • /
    • pp.177-180
    • /
    • 2004
  • Objectives: To completely excise a malignant tumor which invades carotid artery walls, the resection and reconstruction of the carotid artery is essentially required. In most of the cases, interposition graft using a saphenous vein has been performed, however the vessel caliber discrepancy between a common carotid artery and the saphenous vein can result in a problem on surgical technique. We have introduced and evaluated a new titanium hemoclip tailing method to overcome vessel caliber discrepancy in interposition saphenous vein graft for carotid artery resection in the treatment of head and neck cancers. Method: After carotid artery resection, the calibers of the proximal common carotid artery and the vein were compared, and an orifice of the common carotid artery was gradually reduced to a little larger than or the same size as the orifice of the vein by using the titanium hemostatic clip. Subsequently, the common carotid artery was connected to the vein through anastomosis. The same method was also applied to the distal anastomosis site. There after, the vessels were connected through the anastomosis, and a circulation was restored by releasing a vascular clamp. Then, a titanium hemostatic clip-applied redundant portion on the outside of carotid artery was sutured by the blanket edge suture method, using 6-0 Prolene. Results: We have experienced this method in two patients with recurrent squamous cell carcinoma and neuroblostoma, respectively. The interposition saphenous vein graft of these patients was found to maintain good patency on the follow up angiography after one year, and they had no specific vascular complication, such as atherosclerosis. Conclusion: This method made it possible to simply perform the interposition saphenous vein graft (ISVG) within a short time and, therefore, was very useful for shortening the duration to block circulation.

A Design of 4×4 Block Parallel Interpolation Motion Compensation Architecture for 4K UHD H.264/AVC Decoder (4K UHD급 H.264/AVC 복호화기를 위한 4×4 블록 병렬 보간 움직임보상기 아키텍처 설계)

  • Lee, Kyung-Ho;Kong, Jin-Hyeung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.102-111
    • /
    • 2013
  • In this paper, we proposed a $4{\times}4$ block parallel architecture of interpolation for high-performance H.264/AVC Motion Compensation in 4K UHD($3840{\times}2160$) video real time processing. To improve throughput, we design $4{\times}4$ block parallel interpolation. For supplying the $9{\times}9$ reference data for interpolation, we design 2D cache buffer which consists of the $9{\times}9$ memory arrays. We minimize redundant storage of the reference pixel by applying the Search Area Stripe Reuse scheme(SASR), and implement high-speed plane interpolator with 3-stage pipeline(Horizontal Vertical 1/2 interpolation, Diagonal 1/2 interpolation, 1/4 interpolation). The proposed architecture was simulated in 0.13um standard cell library. The maximum operation frequency is 150MHz. The gate count is 161Kgates. The proposed H.264/AVC Motion Compensation can support 4K UHD at 72 frames per second by running at 150MHz.