Search results

The decoding problem is a fundamental problem in computational complexity theory. In particular, the efficiency of which the problem can be decided has implications on the security of cryptosystems based on hard problems in coding theory. Stern's algorithm has long been the best algorithm available, with slight modifications over the years yielding only small speed-ups. This paper describes an imp

A 5GHz digital frequency synthesizer achieving a low noise for wireless RF application is presented. This architecture uses a multi-delay coarse-fine Time-to-Digital Converter (TDC) to achieve both the large detection range and fine resolution. A Digitally Controlled Oscillator (DCO) based on capacitive degeneration in LC-Tank is also implement-ed. The DCO achieves frequency quantization step of 3

Despite the widely recognized importance of replications in software engineering, industrial replications in software engineering are still rarely reported. Although the literature provides some evidence about the issues and challenges related to conducting experiments and replications the practitioner's view of the issues and challenges has not been fully explored. This paper reports an industria

This paper presents a low-complexity energy efficient channel pre-processing update scheme, targeting the emerging 3GPP long term evolution advanced (LTE-A) downlink. Upon channel matrix renewals, the number of explicit QR decompositions (QRD) and channel matrix inversions are reduced since only the upper triangular matrices R and R^-1 are updated, based on an on-line update decision mechanism. Th

This paper presents a high throughput, low latency soft-output signal detector for a 4×4 64-QAM MIMO system. To achieve high data-level parallelism and accurate soft information, the detector adopts a node perturbation technique to generate a list of candidate vectors around Zero Forcing, ZF, result. Additionally a fast and hardware friendly node enumeration scheme is developed to significantly re

This paper presents a QVCO and divider for a 28 GHz SiGe PLL. It was designed in a SiGe process with fT= 200 GHz. The PLL is intended to be used for beam steering in an 81-86 GHz E-band transmitter. Phase control is implemented by programmable current injection into the loop filter. The simulations in Spectre use a layout extracted view with parasitics for the QVCO and the frequency divider and an

Next generation wireless systems have to be able to efficiently deal with fast fading environments in order to achieve high spectral efficiency. Using multiple-input multiple-output (MIMO) systems and exploiting receive diversity, their spectral efficiency can be greatly increased. Commonly, the channel is estimated via training symbols, before the data detection is carried out based on the previo

The friction stir welding procedure to seal copper canisters requires variable power input throughout the 45 minute long weld cycle to keep the welding temperature within the process window. This is due to variable thermal boundary conditions throughout the weld cycle which, together with fast disturbances in the spindle torque, requires control of both the power input and the welding temperature

The state-of-the-art in development tools today provides users with a large number of both syntactic and semantic services, such as syntax highlighting, name completions and refactorings. Preferably, every language should have sophisticated tool support, but unfortunately, the manual task of tool development is both time-consuming and error-prone, making it too costly for small language communitie

This paper presents a new Hardware (HW) im- plementation proposal for Discrete Fourier Transform (DFT) based channel estimators. The presented algorithm uses the high time correlation property of the channel estimates to reduce the complexity and the power consumption by utilizing a lower number of bits for the FFT in the channel estimator, compared to a traditional approach. The idea is that the

Attribute grammars are useful in integrated editing environments for obtaining automatic incremental compilation features. However, traditional attribute grammars use aggregated values during name resolution, resulting in large sets of affected attribute instances after edits. In this paper, we show how reference attribute grammars (RAGs) can significantly reduce the number of affected attributes.

In this note, we deduce a bound between fast algebraic immunity and higher order nonlinearity (it is the first time that a bound between these two cryptographic criteria is given), and find that a Boolean function should have high r-order nonlinearity to resist fast algebraic attacks. As a corollary, we find that no matter how much effort we make, the Tu-Deng functions cannot be repaired in a stan