Abstract:
A comparison circuit can reduce the amount of power consumed when searching a load queue or a store queue of a microprocessor. Some embodiments of the comparison circuit use a comparison unit that performs an initial comparison of addresses using a subset of the address bits. If the initial comparison results In a match, a second comparison unit can be enabled to compare another subset of the address bits.
Abstract:
A device includes a circular buffer, which, in operation, is organized into a plurality of subsets of buffers, and control circuitry coupled to the circular buffer. The control circuitry, in operation, receives a memory load command (404) to load a set of data into the circular buffer. The memory load command (404) has an offset parameter (408) indicating a data offset and a subset parameter (410) indicating a subset of the plurality of subsets into which the circular buffer is organized. The control circuitry responds to the command by identifying a set of buffer addresses (412) of the circular buffer based on a value of the offset parameter (408) and a value of the subset parameter (410), and loading the set of data (414) into the circular buffer using the identified set of buffer addresses (412).
Abstract:
A comparison circuit can reduce the amount of power consumed when searching a load queue or a store queue of a microprocessor. Some embodiments of the comparison circuit use a comparison unit that performs an initial comparison of addresses using a subset of the address bits. If the initial comparison results In a match, a second comparison unit can be enabled to compare another subset of the address bits.
Abstract:
A blind carrier frequency offset estimator is based on a single-OFDM-symbol training sequence in multi-user OFDMA uplink. Through multiple access interference modeling and analysis, a virtual user is employed that occupies the all null sub-carriers. By minimizing the energy leakage on the virtual user in term of tentative frequency offsets, the estimator can approach the real frequency offset. The estimator performs only on frequency-domain, simplifies interference calculations, and lowers the rank of the matrix. An iterative computation method is used to approach the real frequency offset.
Abstract:
A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as "previous output." A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.
Abstract:
Consideration of Quality of Service is taken into account during the establishment of a sleep cycle in a mobile station providing real-time services. Upon the mobile station's identification of a need for a real-time service to enter into sleep mode, a request conveying that need is sent to the base station. The base station replies with a start frame number and other sleep parameters. Thereafter the mobile station enters sleep mode comprising sleep intervals interleaved with listening intervals. To prevent transmission packets from being buffered at the mobile station for an excessive period of time due to attempts to transmit packets to the base station during a sleep interval, the length of the sleep interval is set so as not to exceed the maximum latency value reflecting the QoS of the real-time service negotiated during establishment of the real-time services.
Abstract:
A method for decoding tail-biting convolutional codes. The method includes initializing a correction depth, selecting a first starting state from a set of encoding states, and initializing a metric value for the selected starting state as zero and the other states as infinity. The input bit stream is read and a Search Depth Viterbi algorithm (SDVA) is performed to determine path metrics and identify a minimum-metric path. The ending state for the minimum-metric path is determined and the output for this ending state is identified as "previous output." A second starting state is set to the ending state of the minimum-metric path, and symbols equal to the correction depth from the previous output are read. The SDVA is performed on the second set of read symbols to generate a corrected output. A decoded output is generated by replacing symbols at the beginning of the previous output with the corrected output.
Abstract:
An embodiment of a technique for selecting instructions for execution from an issue queue at multiple function units while reducing the chances of instruction collisions. Each function unit in a processor may include a selection logic circuit that selects a specific instruction from the issue queue for execution. In order to avoid instruction collision, a function unit may have a selection logic circuit that may select two instructions from an instruction queue: one according to a first selection technique and one according to a second selection technique. Then, by comparing the instruction selected by the first selection technique to the instruction selected by the selection logic circuit of another function unit, the instruction selected by the second technique may be used instead if there will be an instruction collision because the instruction selected by the first selection technique is the same as the instruction selected at a different function unit.
Abstract:
A method, and components for performing such method, is provided for synchronizing multiple user signals in a multi-user communication system. An interference matrix is generated based on time delay and frequency offset information for the active users accessing an OFDMA uplink receiver. User signals are received from the active users and are segmented into blocks, and the interference matrix is applied to each of the blocks. The received user signal is OFDM demodulated and unused sub-carriers are discarded. Typically, the method includes also applying a factorization matrix formed by factoring a correction matrix created from the interference matrix and an inverse matrix formed based on the factoring results to the user signal blocks, e.g., the correction step includes multiplying each of the blocks from the user signal by each of these three matrices. The corrected user blocks are then concatenated to form a corrected vector signal.