EE Seminar: Interaction in Gaussian and Binary Channels

04 בנובמבר 2019, 15:00 
חדר 206, בניין וולפסון הנדסה מכנית  

Speaker: Assaf Ben-Yishai

Ph.D. student under the supervision of Prof. Ofer Shayevitz

 

Monday, November 4th, 2019 at 15:00
Room 206, Wolfson Mechanical Eng. Bldg., Faculty of Engineering

Interaction in Gaussian and Binary Channels

 

Abstract

The celebrated channel coding theorem proved by Claude Shannon in 1948, shows that information can be reliably conveyed over a noisy channel as long as its rate does not exceed a fundamental limit called the channel capacity. The scenario considered in Shannon’s original paper (and in the majority of the works following it), is where one user sends a long predetermined message to another user over a noisy channel using a codebook, i.e., by encoding the message into a codeword – a long predetermined sequence of channel inputs. In this research, we study two basic two-party communication scenarios that are richer than the prototypical problem considered by Shannon.

                    

In the first part of the research, we study the additive white Gaussian noise (AWGN) channel with noisy feedback. The AWGN with clean feedback has been originally studied by Schalkwijk & Kailath in 1966. They presented a coding scheme (the SK-scheme) based on scalar arithmetic and achieving remarkable improvement in the delay vs. reliability tradeoff compared to communication without feedback. However, this scheme is known to fail in the presence of arbitrarily low noise in the feedback channel. We show that the susceptibility to feedback noise can be overcome by using modulo-arithmetic over the feedback, maintaining essentially the same low-complexity as the SK-scheme. Our new scheme provides a fast decay in the error probability at rates close to the Shannon capacity, provided that the signal-to-noise ratio of the feedback channel is sufficiently larger than that of the feedforward channel. The idea of applying modulo operations over the feedback is then leveraged to obtain two more contributions: improved error exponents for the AWGN with noisy feedback, and a new achievable rate region for the AWGN broadcast channel with an AWGN multiple-access feedback.

 

In the second part of the research, we study the problem of interactive communication over binary-input channels. In this setup, originally presented by Schulman in 1992 and motivated by distributed computing, two parties wish to simulate an interactive protocol over a pair of noisy channels. In contrast to Shannon’s setup, the information exchanged by the parties is not predetermined but rather generated on-the-fly during the course of communication. Our first contribution is a structured coding scheme based on extended-Hamming codes and randomized error detection, which is proved to reliably simulate any protocol at a coding rate of at least 0.302 the Shannon channel capacity, for any binary-input symmetric-output memoryless channel. We further show that the randomness required by the scheme can be harvested from the channel, giving rise to a fully deterministic coding scheme.

 

An exact characterization of the interactive capacity for general protocols remains notoriously elusive to date. It is commonly believed that the interactive capacity is strictly smaller than the Shannon capacity; this was recently shown to be the case in the infinitesimal noise regime by Kol & Raz. Nevertheless, rather surprisingly, we show that the full Shannon capacity can be achieved when simulating arbitrary two-state protocols, as well as broad classes of finite-state protocols with a bounded number of states.

EE Seminar: Stacking Neural Networks with Predictive Normalized Maximum Likelihood

30 באוקטובר 2019, 15:30 
חדר 011 בניין כיתות חשמל  

 

Speaker: Ido Lublinsky

M.Sc. student under the supervision of Prof. Meir Feder

 

Wednesday, October 30th 2019 at 15:30

Room 011, Kitot Bldg., Faculty of Engineering

 

Stacking Neural Networks with Predictive Normalized Maximum Likelihood

 

Abstract

 

We consider an approach, called Stacked Generalization, for solving the problem of ensemble learning. This approach, introduced by Wolpert in ’92, suggests learning an ensemble function by creating a dataset that includes the outputs from all the learners we wish to combine as features along with the original corresponding labels. We incorporate a few variants of Stacked Generalization that provide superior performance in the logarithmic loss function sense and also in the computational complexity sense. We also modify the common classification scheme that is usually measured by the zero-one loss function to a scheme that can be evaluated by the logarithmic loss function, also known as log-loss. We then compare and examine an alternative scheme for classification that was recently suggested for universal learning of individual data called Predictive Normalized Maximum Likelihood (pNML). The pNML scheme competes with a genie, a learner that has access to the training and test data. However, it is restricted to some given hypotheses class and does not know which data is the test data. The pNML solution is minimax optimal in the log-loss sense. We further examine the use of the regret of the pNML solution as a confidence or learnability measure.

EE Seminar: The Advantage of Beamformer Cochlear Noise Reduction Algorithm to the Hearing Impaired

30 באוקטובר 2019, 15:00 
חדר 011 בניין כיתות חשמל  

 

Speaker: Carmi Shimon

M.Sc. student under the supervision of Prof. Miriam Furst-Yust

 

Wednesday, October 30, 2019 at 15:00

Room 011, Kitot Bldg., Faculty of Engineering

 

The Advantage of Beamformer Cochlear Noise Reduction Algorithm to the Hearing Impaired

Abstract

 

Hearing aid (HA) research still have the challenge of improving the ability of the   hearing impaired (HI) to understand speech in a noisy environment. Modern HAs use multiple-channel noise reduction algorithms to reduce the background noise. A decade ago we have developed a Cochlear Noise Reduction Algorithm (CNRA) that mimics the way the cochlea process acoustic signals. We have shown experimentally that the algorithm significantly helps HI people, but not normal hearing (NH) people. In the current study we introduce a new algorithm:  Beamformer Cochlear Noise Reduction Algorithm  (BCNRA) which includes a beamformer (the Frost algorithm) followed by CNRA.  BCNRA was evaluated theoretically and experimentally by using a database of 150 Hebrew sentences embedded in different noise types and SNRs. The theoretical evaluation included derivation of Segmental SNR (sSNR) of the input signals, followed by Frost and followed by BCNRA. The analysis yielded a significant improvement in  sSNR of BCNRA relative to Frost especially in those parts of the sentences that did not include speech. In the experimental evaluation subjects were asked to indicate the words they heard while listening to  noisy sentences. The subjects were a group of 10 young normal hearing (NH) people and 10 old HI people who regularly use HAs. In the average the NH yielded an improvement of about 30% in words identification following both Frost BCNRA. On the other hand, the HI yielded an improvement of 30% following Frost and 50% following BCNRA. The benefit of BCNRA to the HI is probably due to its ability to separate words in the noisy sentences.

EE Seminar: Codes for Endurance-Limited Memories

28 באוקטובר 2019, 15:00 
חדר 011 בניין כיתות חשמל  

(The talk will be given in English)

 

Speaker:     Dr. Michal Horovitz
                     CS, Tel-Hai College

 

Monday, October 28th, 2019
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

 

Codes for Endurance-Limited Memories 

 

Abstract

Resistive memories, such as phase change memories and resistive random access memories have attracted significant attention in recent years due to their better scalability, speed, rewritability, and yet non-volatility. However, their limited endurance is still a major drawback that has to be improved before they can be widely adapted in large-scale systems. 
I will introduce a coding scheme, called Endurance-Limited Memories (ELM) codes, that increases the endurance of these memories by limiting the number of cell programming operations. An l-change t-write ELM code is a coding scheme that allows to write t messages into some n binary cells while guaranteeing that each cell is programmed at most t times.
I will define some models of these codes which depend upon whether the encoder and the decoder know on each write the number of times each cell was programmed, know only the memory state before the new data encoded, or even do not know anything.
I will present results regarding the capacity and maximum sum-rate of these models, as well as, introduce some constructions.
Joint work with Yeow Meng Chee, Alexander Vardy, Van Khu Vu, and Eitan Yaakobi.

Short Bio
Michal Horovitz is a Lecturer in the Department of Computer Science, Tel-Hai College, Israel and she is also a researcher in The Galilee Research Institute - Migal, Upper Galilee, Israel. 
She received the Ph.D. degree from the Computer Science Department at the Technion - Israel Institute of Technology, in 2017. Her research interests include coding theory with applications to non-volatile memories, information theory, and combinatorics. 

School of Mechanical Engineering: Yarden Amsalem 12.11.19

12 בנובמבר 2019, 14:00 - 15:00 
בניין וולפסון 206  
0
School of Mechanical Engineering: Yarden Amsalem 12.11.19

~~

SCHOOL OF MECHANICAL ENGINEERING SEMINAR
Tuesday, November 12, 2019 at 13:00
Wolfson Building of Mechanical Engineering, Room 206

Cubic Equations of State and nucleation inception in boiling due to rapid heating
Yarden Amsalem
MSc student of Dr. Tali Bar-Kohany and Prof. Slava Krylov

This study deals with the onset of isobaric boiling for a superheated liquid due to moderate to high heating rates (1.e5.. 1.e9  K/s).
In real liquids, namely liquids that are not specially treated for the removal of possible nucleation sites (such as dissolved gasses, suspended particles etc.), a high level of superheating may be obtained using high heating rates such that the liquid’s nucleation temperature is substantially higher than its saturation temperature; it can reach up to the thermodynamic stability threshold (spinodal).
Prediction of superheat levels and nucleation temperatures under these conditions as a function of temperature change rate has not been possible with analytic tools available today. Despite the fact that the equilibrium boiling temperature (saturation temperature) and the thermodynamic threshold temperature are known for every liquid (although the certainty of the later is less than that of the former) there still lies a difficulty in predicting a liquid’s onset of nucleate boiling (ONB) point within the metastable region.
In the course of this study, 167 data points from relevant (rapid, isobaric) experiments were collected. The experiments were carried out under a pressure of one atmosphere using different liquids: polar (i.e. water, methanol and ethanol) and nonpolar (i.e. heptane and toluene).
A thermodynamic analysis was carried out by using classical thermodynamic potentials while adapting them for use in kinetic processes (quasi-steady). The analysis allowed for the development of a simple correlation which predicts the onset of nucleation boiling conditions for different liquids as a function of their temperature change rate or of the solid interface which heats them. The correlation’s only required inputs are the saturation temperature and the homogenous boiling temperature, both of which are well known quantities.
Owing to its simple mathematical nature, the correlation can be easily applied as a sub-model to any of the existing CFD codes.

 

סמינר מחלקה אלקטרוניקה פיזיקאלית: Meisong Tong

03 בנובמבר 2019, 15:00 
הפקולטה להנדסה, בניין כיתות, חדר 011  
סמינר מחלקה אלקטרוניקה פיזיקאלית: Meisong Tong

סמינר אורח אמיר בוג

You are invited to attend a lecture:

Nontraditional Numerical Methods for Solving Electromagnetic Problems
By:
Meisong Tong
Department of Electronic Science and Technology
Tongji University, Shanghai, China

Abstract
Electromagnetic (EM) problems are governed by the well-known Maxwell’s equations which take a differential equation form, but they can be manipulated into an integral equation form by introducing the Green’s function. Many numerical methods have been developed for solving EM integral equations and the most popular or traditional method is known as the method of moments (MoM). Although the MoM is quite robust in general, there exist certain deficiencies in the method for many applications. Recently, some nontraditional numerical methods for solving the EM integral equations have been developed and they could become strong competitors to the MoM, attracting a wide attention in the EM community. The typical methods are the Nyström method and meshless method and they can overcome or alleviate the problems in the traditional MoM, leading to having alternative choices in many scenarios. In this talk, I will review these two methods and present their applications for solving various EM problems.

 

On Sunday, November 03, 2019, 15:00
Room 011, Kitot building, Tel Aviv University

School of Mechanical Engineering: Prof. Tsinober

25 בדצמבר 2019, 14:00 - 15:00 
בניין וולפסון 206  
0
School of Mechanical Engineering: Prof. Tsinober

School of Mechanical Engineering: Tomer Mayaan

18 בנובמבר 2019, 14:00 - 15:00 
בניין וולפסון 206  
0
School of Mechanical Engineering: Tomer Mayaan

סמינר מחלקהאלקטרוניקה פיזיקאלית: Constantine A. Balanis

03 בנובמבר 2019, 14:00 
הפקולטה להנדסה, בניין כיתות חדר 011  
סמינר מחלקהאלקטרוניקה פיזיקאלית: Constantine A. Balanis

סמינר אורח

Electromagnetic Education and Antenna Technology:
Past, Present and Future
Constantine A. Balanis
School of Electrical, Computer and Energy Engineering, Arizona State University

The field of Electromagnetics (EM) includes theoretical and applied concepts, both of which are described by a set of basic analytical laws, widely acclaimed as Maxwell’s equations.  These laws were formulated primarily through experiments conducted during the nineteenth century by many scientists, and they then were combined into a consistent set of vector equations.  These laws, both in differential and integral form, withstood the test of time for over two centuries, and they have been the foundation of electrical engineering and physics curricula.  They have successfully been applied to numerous problems, and the results have compared favorably with experimental and simulated data.  While there have been no basic changes in the initial structure of these basic laws, there has been an impressive surge in their application, especially during the last 50 or so years.  Because of the dramatic increase in the geometrical complexity of the new problems, whose geometries were not of canonical shapes and could not be described by basic orthogonal coordinate systems, the solutions of most of them could not be derived in closed-form using analytical expressions.  This necessitated the development of numerical methods to solve these complicated problems, whose solutions would otherwise have remained dormant.  The history of EM and its integration to Electrical Engineering curricula will be briefly reviewed.
The genesis of the application of numerical methods to electromagnetics may have started in the 1960s, aided and supported by the advancement of computational resources.  These computational methods and associated software have been integrated in current curricula of Electrical Engineering, both at the undergraduate and graduate levels.  While users are currently highly dependent on these computer codes, we should not lose focus on the interpretation and physical realization of the data simulated using these full-wave solvers.  Therefore, the analytical methods are, and will continue to be, the foundation of electromagnetics and provide understanding and physical interpretation of electromagnetic phenomena and interactions.
Antenna technology has undergone a dramatic evolution from the days of Hertz, with his spark-gap with end-loaded dipole, to today’s high performance Active Electronically Scanned Arrays (AESA) and multiband antennas for smart phones and mobile devices.  The antenna technology reached even greater heights with the introduction and advancements of integrated circuits, solid state technology, unique and creative radiator designs, and signal processing algorithms.  Recently electromagnetic band-gap structures, and the integration of Artificial Magnetics Conductor (AMCs), have begun to play a pivotal role.  Although numerical and computational methods, and associated full-wave simulators, have also contributed to this advancement, basic concepts and fundamental principles in the physical realization, interpretation and verification of designs of simulated should be emphasized.  The timelines over which antenna technology leaped forward are identified, and the various antenna configurations developed during those periods are highlighted.  Future trends in antenna technology are identified and suggested.
On Sunday, November 03, 2019, 14:00
Room 011, Kitot building, Tel Aviv University

School of Mechanical Engineering Prof. Subrahmanyam

13 בנובמבר 2019, 14:00 - 15:00 
בניין וולפסון חדר 206  
0
School of Mechanical Engineering Prof. Subrahmanyam

עמודים

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