نتایج جستجو برای: row technique

تعداد نتایج: 628822  

Journal: :Computers & Electrical Engineering 2004
Bogdan J. Falkowski

A lossless compression of images using coding schemes and patterns that include minterm, cube and coordinate data coding, Walsh, triangular and Reed–Muller weights based patterns, Reed–Muller spectra and reference row technique is proposed. The experimental results indicate that the technique is fairly efficient when compared with other methods based on representations of logic functions. 2003 ...

Journal: :Numerical Linear Algebra with Applications 2000

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس 1389

growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...

2015
Richa Goyal Sourav Garg

The paper presents a lossless image compression technique using the hybridization of two different entropy coding techniques. Initially data folding technique has been applied to the image. A row folding is applied on the image matrix followed by a column folding. Multiple iterations of this process is applied on the image. After completing the data folding process another entropy coding techni...

Journal: :BJOG: An International Journal of Obstetrics & Gynaecology 2021

2007
David Garza-Salazar

This paper presents performance results of a new data partitioning technique: snake partitioning , a data decomposition technique than can be derived at compile-time. Snake partitioning is suitable for multidimensional arrays with restricted aane references. The technique derives the data partitioning of these arrays and an execution order that exploits locality in loops. Experiments that compa...

Journal: :Integration 1995
Yao-Ping Chen Martin D. F. Wong

We study in this paper the feed-through pin assignment problem for cell based design that assigns global nets to feed-through cells or implicit feed-through ports. On a single row, for a restricted permutation of global nets, we develop a graph theoretic approach for optimally minimizing the density of the channel above (below) the row subject to the bound on the density of the channel below (a...

2004
Gerd Richter Simon Plass

This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique ...

Journal: :Journal of clinical pathology 1957
F R ELLIS

(4) In the remaining tubes of each row is placed 0.5 ml. of 0.85% sodium chloride. (5) To the first tube of each row 0.1 ml. of serum is added and mixed thoroughly. (6) Then 0.5 ml. of the diluted serum is carried over into tube 2 and so on until tube 10, the last 0.5 ml. being discarded. (7) To each tube 0.5 ml. of washed fresh sheep cells is added, thus giving a final serum dilution of 1:20 u...

Aynalem Gebere Hordofa Melkamu Lule Belistie Nebret Tadesse Btru

Objective: An experiment was conducted at Wondo Genet Agricultural Research Center in the production season of 2013/14 and 2014/15 with the objective of identifying the best combination of intra and inter-row spacing for optimum plant population density of stevia. Methods: The experiment was conducted using five intra-row spacing (20cm, 25cm, 30cm, 35cm, and 40...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید