Abstract: Certain aspects of the present disclosure provide methods and apparatus for creating tags (static or dynamic) for input/output classes of a neural network model using supervised learning. The method includes augmenting a neural network model with a plurality of neurons and training the augmented network using spike timing dependent plasticity (STDP) to determine one or more tags.

Abstract: Certain aspects of the present disclosure provide methods and apparatus for creating tags (static or dynamic) for input/output classes of a neural network model using supervised learning. The method includes augmenting a neural network model with a plurality of neurons and training the augmented network using spike timing dependent plasticity (STDP) to determine one or more tags.

Abstract: Techniques for polling fingers on a channel (which are fingers for which symbols are to be combined) to determine the last finger on the channel. As each finger is polled, the polled finger compares its state information with the state information for the channel to determine whether or not it is the last finger on the channel. The polled finger may be deemed as the last finger if (1) the polled finger is the current last finger, (2) the polled finger is later than the current last finger, or (3) all fingers on the channel have been polled and none of the fingers indicated that it is the last finger. If the polled finger is deemed as the last finger then, (1) the channel state information is updated with the polled finger state information, and (2) the symbols provided by the polled finger may be marked as being ready for subsequent processing.

Abstract: Techniques for canceling pilot interference in a wireless (e.g., CDMA) communication system. In one method, a received signal comprised of a number of signal instances, each including a pilot, is initially processed to provide data samples. Each signal instance's pilot interference may be estimated by despreading the data samples with a spreading sequence for the signal instance, channelizing the despread data to provide pilot symbols, filtering the pilot symbols to estimate the channel response of the signal instance, and multiplying the estimated channel response with the spreading sequence to provide the estimated pilot interference. The pilot interference estimates due to all interfering multipaths are combined to derive the total pilot interference, which is subtracted from the data samples to provide pilot-canceled data samples. These samples are then processed to derive demodulated data for each of at least one (desired) signal instance in the received signal.

Abstract: Methods and systems for estimating and canceling pilot interference in a wireless (e.g., CDMA) communication system. In one method, a received signal comprised of a number of signal instances, each including a pilot, is initially processed to provide data samples. Each signal instance's pilot interference may be estimated by despreading the data samples with a spreading sequence for the signal instance, channelizing the despread data to provide pilot symbols, filtering the pilot symbols to estimate the channel response of the signal instance, and multiplying the estimated channel response with the spreading sequence. The pilot interference estimates due to a plurality of interfering multipaths are accumulated to derive the total pilot interference, which is subtracted from the data samples to provide pilot-canceled data samples. These samples are then processed to derive demodulated data for each of at least one (desired) signal instance in the received signal.

Abstract: An apparatus to determine the inverse transform of a block of encoded data the block of encoded data comprising a plurality of compressed frequency domain data elements. An input register is configured to receive a predetermined quantity of data elements. At least one butterfly processor is coupled to the input register and is configured to perform at least one mathematical operation on selected pairs of data elements to produce an output of processed data elements. At least one intermediate register is coupled to the butterfly processor and configured to temporarily store the processed data. A feedback loop is coupled to the intermediate register and the butterfly processor, and where if enabled, is configured to transfer a first portion of processed data elements to the appropriate butterfly processor to perform additional mathematical operations and where if disabled, is configured to transfer a second portion of processed data elements to at least one holding register.

Abstract: Methods and systems for estimating and canceling pilot interference in a wireless (e.g., CDMA) communication system. In one method, a received signal comprised of a number of signal instances, each including a pilot, is initially processed to provide data samples. Each signal instance's pilot interference may be estimated by despreading the data samples with a spreading sequence for the signal instance, channelizing the despread data to provide pilot symbols, filtering the pilot symbols to estimate the channel response of the signal instance, and multiplying the estimated channel response with the spreading sequence. The pilot interference estimates due to a plurality of interfering multipaths are accumulated to derive the total pilot interference, which is subtracted from the data samples to provide pilot-canceled data samples. These samples are then processed to derive demodulated data for each of at least one (desired) signal instance in the received signal.

Abstract: Techniques for polling fingers on a channel (which are fingers for which symbols are to be combined) to determine the last finger on the channel. As each finger is polled, the polled finger compares its state information with the state information for the channel to determine whether or not it is the last finger on the channel. The polled finger may be deemed as the last finger if (1) the polled finger is the current last finger, (2) the polled finger is later than the current last finger, or (3) all fingers on the channel have been polled and none of the fingers indicated that it is the last finger. If the polled finger is deemed as the last finger then, (1) the channel state information is updated with the polled finger state information, and (2) the symbols provided by the polled finger may be marked as being ready for subsequent processing.