Nxp Usa, Inc.

Cirrus Logic Inc.

Rohit Tomar

Maik Brett

Navdeep Singh Gill

Deboleena Sakalley

Tejbal Prasad

Gurinder Singh

Aadilhussain Maniyar

Peter J Tonge

Gill Navdeep Singh

Circuitry for processing an input signal from a sensor, the circuitry comprising: an input configured to receive the input signal; bias circuitry configured to apply a bias to the input signal to obtain a biased input signal; a gain stage configured to apply a gain to the biased input signal to obtain an amplified input signal; an analog-to-digital converter (ADC) configured to convert the amplified input signal to a digital output signal; wherein, during a calibration phase, the control circuitry is configured to: control the bias circuitry to apply a macro offset to the input signal, the macro offset to bring the amplified input signal within a dynamic range of the ADC; and determine a micro offset to be applied during a measurement phase of the sensor based on the macro offset and the digital output signal; and wherein during the measurement phase, the control circuitry is configured to control the bias circuitry to disable application of the macro offset and apply the micro offset to the input signal, the macro offset having a greater magnitude than the micro offset.

Methods and circuitry for calibration

An FFT device for performing a Fast Fourier Transform (FFT) is described. The FFT device comprises: a control unit arranged to control a sequence of transformation rounds; and a coefficient unit for providing transformation data; and a transformation unit arranged to receive the transformation data and to perform the respective linear transformation on the basis of the transformation data. The coefficient unit comprises or is integrated in a Random Access Memory (RAM) unit, the RAM unit comprising a set of memory blocks. The set of memory blocks comprises: a subset of window memory blocks or a subset of window-FFT memory blocks. The set of memory blocks further comprises a subset of FFT memory blocks providing a set of twiddle coefficients or a reduced set of twiddle coefficients.

FFT device and method for performing a fast fourier transform

An FFT device for performing a Fast Fourier Transform (FFT) of an operand vector of length N is described. The FFT device comprises a control unit, a coefficient unit, and a transformation unit. The control unit controls a sequence of transformation rounds, the transformation rounds including two or more FFT rounds and further including or not including a window round. The control unit also maintains configuration data indicating for each of said transformation rounds whether the respective transformation round is an FFT round, a window-FFT round, or a window round. The coefficient unit provides transformation data. The transformation unit is arranged to receive the transformation data and to perform the respective linear transformation on the basis of the transformation data. A method for performing a Fast Fourier Transform is described as well.

FFT device and method for performing a Fast Fourier Transform

A signal processing unit and a method for searching for peaks in a two-dimensional matrix of numbers are described. The matrix is analyzed row by row and then column by column. Analyzing a row comprises, for each element of the row, tagging the element in response to determining that the element is a local maximum of the row Analyzing a column comprises determining a bit field associated with the column by determining, for each element of the column, a corresponding bit field element Determining the bit field element comprises: if the element of the column has not been tagged, setting the bit field element to a predefined first value, and, if the element of the column has been tagged, determining whether the element is a local maximum and, in this case, setting the bit field element to a predefined second value different from the first value and, otherwise, setting the bit field element to the first value.

Signal processing unit and method for searching for peaks in a two-dimensional matrix

A data processing device and a method for performing second or next stage of an N point Fast Fourier Transform is suggested. The processing device comprises an input operand memory unit and an input buffer comprising a plurality of addressable memory cells arranged in lines and columns. Furthermore, the device comprises a number of radix-P operation units for producing output operands that are buffered in an output buffer. Input operands are read from the input operand memory unit and buffering into the input buffer. The input operands are stored and fetched from the input buffer according to a reordering scheme that allows efficient parallel processing of the operands by the butterflies and the buffering of subsequent input operands.

Growing community of inventors

Edinburgh, United Kingdom

Rohit Tomar