PhD Research Intern

What you’ll be doing:

  • Explore circuit approaches to optimizing processor computation and interconnect performance and power

  • Design and implement circuit approaches in prototype systems

  • Collaborate with other team members, both in research and product roles

  • Transfer technology to product groups

 

What we need to see: 

Image Processing Algorithm Student

About The Position

Samsung R&D Center is looking for Image Processing Algorithm Student to join our team.

Shmuel Saadi-Blind equalization of moving average channels over Galois fields

סמינר מחלקת מערכות - EE Systems Seminar

11 בפברואר 2024, 15:00 
Electrical Engineering-Kitot Building 011 Hall  
Shmuel Saadi-Blind equalization of moving average channels over Galois fields

Electrical Engineering Systems Seminar

 

Speaker: Shmuel Saadi

M.Sc. student under the supervision of Prof. Arie Yeredor

 

Sunday, 11th February 2024, at 15:00

Room 011, Kitot Building, Faculty of Engineering

 

Blind equalization of moving average channels over Galois fields

 

Abstract

This work presents three different approaches for the estimation (or equalization) of the blind moving average (MA) channel over finite fields. In this framework, the channel's input signal, output signal, and coefficients all belong to a Galois (finite) field of prime order, and all the arithmetics (additions and multiplications) are calculated modulo the field's order.

The source signal is assumed to be a sequence of independent and identically distributed (iid) samples with an unknown distribution. The goal is to estimate the channel's coefficients from the output signal alone.

In the first approach, we try to maximize the source's implied probability vector's norm (with respect to the channel's coefficients) and based on new theories and insight that we present in this work, we show that this maximization process yields a consistent estimate of the channel's coefficients that define the MA channel (and thus solve the equalization problem).

The second approach attempts to factorize the empirical characteristic tensor of the output, where the factors are the unknown characteristic vectors of the channel's source at different indices, which depend on the channel's coefficients. Applying a logarithmic operator, we obtain a set of linear equations that leads us to solve a least-squares (LS) problem, whose solution is an implied estimate of the second characteristic vector of the channel's source that yields the minimum squared error (MSE) for a specific hypothesized set of channel coefficients.

Repeating this process for every possible set of channel coefficients (out of a finite number of possibilities) leads us to the true set as explained in detail in this work.

The last approach is based on a sequential identification of the polynomial factors of the channel's associated polynomial (the Z-transform of its impulse response). By using this sequential approach, we "break" the problem into smaller problems (with smaller channel orders) that are easier to solve. Once we identify all the factors, we can easily compose the original associated polynomial and extract the channel's coefficients.

For each approach, we explain the advantages and disadvantages, demonstrate their performance by simulations with different parameter settings, and compare them to each other. Note that since, to the best of our knowledge, this work is the first attempt to solve this problem, there are no other known approaches to compare to.

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בדף הנוכחות שיועבר באולם במהלך הסמינר

 

 

 

Gabriel Marques Domingues-A Micro-architecture that supports the Fano–Elias encoding and a hardware accelerator for approximate membership queries

סמינר מחלקת מערכות - EE Systems Seminar

11 בפברואר 2024, 15:30 
Electrical Engineering-Kitot Building 011 Hall  
Gabriel Marques Domingues-A Micro-architecture that supports the Fano–Elias encoding and a hardware accelerator for approximate membership queries

Electrical Engineering Systems Seminar

 

Speaker: Gabriel Marques Domingues

M.Sc. student under the supervision of Prof. Guy Even and Prof. Boaz Patt-Shamir

 

Sunday, 11th February 2024, at 15:30

Room 011, Kitot Building, Faculty of Engineering

 

A Micro-architecture that supports the Fano–Elias encoding and a hardware accelerator for approximate membership queries

 

Abstract

We present the first hardware design that supports operations over the Fano–Elias encoding (FE-encoding). Our design is a combinational circuit (i.e., single clock cycle) that supports insertions, deletions, and queries. FE-encoding allows one to store f binary strings, each of length l+log(m) using a string that is m+f+fl bits long (rather than f(l+log(m))). The asymptotic gate-count of the circuit is Θ((m+f)log(m)+fl). The asymptotic delay is Θ(log(m)+log(f)+log(l)). We implemented our design on an FPGA with four combinations of parameters in which the FE-encoding fits in 512 or 1024 bits.

We present the first hardware design for a dynamic filter that maintains a set subject to insertions, deletions, and approximate membership queries. The design contains four main blocks: two memory banks that store FE-encodings and two combinational circuits for FE-encoding. Additional logic deals with double buffering and forwarding.

We implemented the dynamic filter on an FPGA with the following parameters: (1) Elements in the dataset are 32-bit strings. (2) The supported dataset can contain up to nmax=45⋅214  = 737, 280 elements. (3) The latency is 2-4 clock cycles. (4) Fixed (i.e., constant and stable) throughput. A new operation can be issued every clock cycle. (5) We prove that the probability of a false-positive error is bounded by 0.385⋅10-2 . (6) We prove that the expected number of insertion failures is less than 1 for every 75 million insertions.

Synthesis of our filter on a Xilinx Alveo U250 FPGA achieves a clock rate of 100 MHz (the critical path is due to the memory access). We measure a fixed throughput of 97.7 million operations per second (the loss of 2.3% in the throughput is due to instabilities in the bandwidth of the AXI4 Lite I/O channel). A unique feature of our filter implementation is that the throughput is stable and constant for all benchmarks and loads. Namely, the combination of operations does not influence the throughput and the throughput does not depend on the number of elements in the dataset (as long as the cardinality of the dataset is bounded by nmax). Previous dynamic filter implementations in software (implemented on x86 or GPU’s) do not exhibit stable and constant throughputs.

 

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בדף הנוכחות שיועבר באולם במהלך הסמינר

 

Endoscopy optics and learning algorithms student

למחקר העוסק בשילוב של פיתוח אלקטרואופטי ואלגוריתמיקה  לשערוך  תמונה מתוך הדמיה אנדוסקופית דרוש סטודנט\ית לביצוע עבודת חקר לתזה.

HS learning- Lab student

למחקר העוסק בשילוב של פיתוח אלקטרואופטי ואלגוריתמיקה  לשערוך השינויים הכימיים בצומח, דרוש סטודנט\ית לביצוע עבודת חקר לתזה.

Michael Zuckerman-Visual system inspire algorithm for breast cancer risk assistant in terminal image

סמינר מחלקת מערכות - EE Systems Seminar

04 בפברואר 2024, 15:00 
Electrical Engineering-Kitot Building 011 Hall  
Michael Zuckerman-Visual system inspire algorithm for breast cancer risk assistant in terminal image

Electrical Engineering Systems Seminar

 

Speaker: Michael Zuckerman

M.Sc. student under the supervision of Dr. Hedva Spitzer

 

Sunday, 4th February 2024, at 15:00

Room 011, Kitot Building, Faculty of Engineering

 

Visual system inspire algorithm for breast cancer risk assistant in terminal image

 

Abstract

In the last decade, breast cancer has become one of the leading cancer types worldwide. Every year, it causes the deaths of 685,000 individuals in the world. Early detection is crucial for increasing the chances of survival, and thermography is one tool physicians use to evaluate the risk of the disease. It is a noninvasive tool for measuring temperature distribution over the skin using infrared (IR) wavelets. 

Many previous studies tried to enhance thermal image through manly via denoising and histogram equalization. In recent years, several studies have attempted to improve the evaluation methods for distinguishing between sick and healthy patients.  

Our study aimed to improve the image appearance of the area in the image, such as areolar regions, nipples, and blood vessels (BV) that might give an indicator for breast cancer.

We propose a new algorithm that aims to enhance the above diagnostic areas through a unique algorithm for enhancing the structure of the image by lateral facilitation visual system mechanism and preprocess of companding HDR image based on Adaptive Contrast Companding (ACC) and a component that computes the region of interest (ROI) of the breast.   

The algorithm showed a 16% increase in the contrast of the blood vessel and areolar. It has been demonstrated on images from the DMA database through contrast-to-noise ratio (CNR) in comparison to the original BIR image.

We employed the deep learning evaluation method ResNet50 to validate our algorithm's effectiveness. This evaluation categorizes images into "sick" and "healthy" classes. The algorithm succeeded in obtaining better scores for the “sick” and the “healthy” cases (97%) in comparison to the ability to distinguish the diagnostic in the original image (86%). Our proposal algorithm yielded better accuracy and precision than the previous studies, at least for those that relied only on frontal direction breast examination.

 

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בדף הנוכחות שיועבר באולם במהלך הסמינר

 

 

Yonatan Shafir-PriorMDM: Human Motion Diffusion as a Generative Prior

סמינר מחלקת מערכות - EE Systems Seminar

07 בפברואר 2024, 15:00 
Electrical Engineering-Kitot Building 011 Hall  
Yonatan Shafir-PriorMDM: Human Motion Diffusion as a Generative Prior

Electrical Engineering Systems Seminar

 

Speaker: Yonatan Shafir

M.Sc. student under the supervision of Prof. Amit H. Bermano

 

Wednesday, 7th February 2024, at 15:00

Room 011, Kitot Building, Faculty of Engineering

 

PriorMDM: Human Motion Diffusion as a Generative Prior

 

Abstract

Recent work has demonstrated the significant potential of denoising diffusion models for generating human motion, including text-to-motion capabilities. However, these methods are restricted by the paucity of annotated motion data, a focus on single-person motions, and a lack of detailed control. In this paper, we introduce three forms of composition based on diffusion priors: sequential, parallel, and model composition. Using sequential composition, we tackle the challenge of long sequence generation. We introduce DoubleTake, an inference-time method with which we generate long animations consisting of sequences of prompted intervals and their transitions, using a prior trained only for short clips. Using parallel composition, we show promising steps toward two-person generation. Beginning with two fixed priors as well as a few two-person training examples, we learn a slim communication block, ComMDM, to coordinate interaction between the two resulting motions. Lastly, using model composition, we first train individual priors to complete motions that realize a prescribed motion for a given joint. We then introduce DiffusionBlending, an interpolation mechanism to effectively blend several such models to enable flexible and efficient fine-grained joint and trajectory-level control and editing. We evaluate the composition methods using an off-the-shelf motion diffusion model, and further compare the results to dedicated models trained for these specific tasks. https://priormdm.github.io/priorMDM-page/ 1

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בדף הנוכחות שיועבר באולם במהלך הסמינר

 

 

Alon Rashelbach-Trading Memory Accesses for Computations in Packet Processing (and Beyond)

סמינר מחלקת מערכות - EE Systems Seminar

05 בפברואר 2024, 15:00 
Electrical Engineering-Kitot Building 011 Hall  
Alon Rashelbach-Trading Memory Accesses for Computations in Packet Processing (and Beyond)

 

(The talk will be given in English)

Speaker:     Alon Rashelbach

Electrical Engineering Faculty, Technion

011 hall, Electrical Engineering-Kitot Building

Monday, February 5th, 2024

15:00 - 16:00

 

Trading Memory Accesses for Computations in Packet Processing (and Beyond)

 

Abstract

Range matching, the process of identifying a range that contains a given input number, is vital in various computer systems, like networking, security, and storage. However, the current methods for range matching hit a wall when it comes to handling a larger number of supported ranges without slowing down search performance. They heavily rely on pointer-chasing algorithms, causing issues when their data structures outgrow the CPU core cache. This reliance on data-dependent memory accesses also constrains efficient memory prefetching and limits potential hardware implementations.

We introduce a novel data structure called the Range Query Recursive Model Index (RQRMI) to tackle the complexities associated with range matching (SIGCOMM’20). RQRMI utilizes shallow neural networks that learn the mapping between inputs and the position of the matching range in memory. This transformation turns the memory-intensive lookup processes into swift neural network inferences, essentially trading costly memory accesses for cheap computations. Remarkably, RQRMI achieves an impressive range compression ratio, up to 90X compared to current methods, enabling direct lookup operations while staying within the CPU core cache limits. The RQRMI training algorithm guarantees a strict upper bound on lookup delay, assures result accuracy, and showcases rapid convergence rates when implemented on CPUs.

We present an algorithm for multi-field packet classification that leverages RQRMI models, and integrate it into the critical path of Open vSwitch, a broadly used open-source virtual switch (NSDI’22). The integration of RQRMI yields impressive scalability, empowering Open vSwitch to manage 500 times more routing rules and experiencing a throughput boost of up to 160 times. When implemented in hardware, RQRMI resolves scalability issues seen in current longest-prefix-matching methods (MICRO’23). This allows scaling the number of routing rules and their bit length to meet forthcoming network demands. Its efficient memory usage and low bandwidth needs make it suitable for genomic processing hardware (BCB’23), and address translators in SSD storage drives (work in progress).

 

Alon Rashelbach, is a 5th year PhD student at Technion, supervised by Mark Silberstein and Ori Rottenstreic

 

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום שם מלא + מספר ת.ז. בטופס הנוכחות שיועבר באולם במהלך הסמינר

 

 

 

 

Photoluminance learning- lab student

 

למחקר העוסק בכיול ושערוך מידע מתוך אותות photo-luminance דרוש סטודנט\ית לביצוע עבודת לביצוע עבודת חקר לתזה.

עמודים

אוניברסיטת תל אביב עושה כל מאמץ לכבד זכויות יוצרים. אם בבעלותך זכויות יוצרים בתכנים שנמצאים פה ו/או השימוש שנעשה בתכנים אלה לדעתך מפר זכויות
שנעשה בתכנים אלה לדעתך מפר זכויות נא לפנות בהקדם לכתובת שכאן >>