The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For several decades, the output from semiconductor manufacturers has been high volume products with process optimisation being continued throughout the lifetime of the product to ensure a satisfactory yield. However, product lifetimes are continually shrinking to keep pace with market demands. Furthermore there is an increase in dasiafoundrypsila business where product volumes are low; consequently...
Feature extraction of specified object is an important preprocessing stage in machine vision systems. In this paper, we present a novel hybrid feature extraction method using PCNN (Pulse Coupled Neural Network) and shape information. First, we use PCNN firing map train to formulate object’s time signature, then we use roundness of each firing map to formulate object’s shape information vector, the...
In this paper, we propose a robust STBC transmission scheme to combat the timing synchronization errors over frequency-selective multiple-access channels. First, the equivalent channel model in the presence of timing synchronization errors is derived and we find that the synchronization errors result in an equivalent channel model with larger number of correlated channel taps. Based on this correlated...
Li and Xia have recently investigated the design of space-time codes that achieve full spatial diversity for asynchronous cooperative communications. They show that certain of the binary space-time trellis codes derived from the Hammons-El Gamal stacking construction are delay tolerant and can be used in the multilevel code constructions by Lu and Kumar to produce delay tolerant space-time codes for...
This work studies the performance of a data-driven reduced rank scheme for rapid timing acquisition in multiple access communications. Our results show that when only a limited amount of preamble bits are available, instead of the true second-order statistics (SOS), the reduced rank scheme provides reliable timing information. Exploiting the structure of the multiple access interference, the data...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
Correlative minimum shift keying (MSK), a second order polynomial modulation scheme known as tamed frequency modulation (TFM), is a constant envelope type of modulation with a perfect peak to average power ratio (PAPR), besides the property of low out of band power. We apply the linearized TFM to the single carrier transmission with frequency domain equalization (SC/FDE) concept. We then obtain a...
Fast Fourier Transform (FFT) is the most basic and essential part of Software Defined Radio (SDR). Therefore, designing regular, reconfigurable, modular and low hardware complexity FFT computation block is very important. A single FFT block should be configurable for varying length FFT computation and also for computation of different transforms like DCT, DST etc. In this paper, the authors analyze...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.