Mediatek Corporation

Shih-Chung Yin

Kuo-Ming Wu

Po-Yuen Cheng

Shang-Ho Tsai

Tsai-Yuan Hsu

Chu-Ming Lin

Kun-Chien Hung

Chieh-Chao Liu

Ching-Yu Kuo

Hung-Pin Ma

Ching An Chung

Chung-Yen Huang

A time-division mechanism that a source station uses a proprietary frame for notifying switching from a normal bandwidth operation to a narrow bandwidth operation to at least one destination station in a wireless communication system, and uses a protection frame to reserve the service period for the narrow bandwidth operation without the interference from the normal bandwidth operation, wherein the service period of the narrow bandwidth operation is indicated in the protection frame.

Method of handling normal bandwidth and narrow bandwidth coexistence

The invention relates to a low power module, and in particular, to a low power module applied in a station of a wireless communication system. A low power module includes a first MAC module, a second MAC module, a low power switch register, a control register unit, a slow clock generator, and a multiplexer (MUX). The first and second MAC module transmits and receives packets in a normal operational mode and a power save mode, respectively. The low power switch register switches a current mode to another mode. The control register unit controls the RF/BB module and the clock generator under the control of the low power switch register. The slow clock generator generates a slow operational clock for the second MAC module in the power save mode. The MUX chooses the normal operational or the slow operational clock periodically as a clock of the second MAC module according to the control register unit.

Low power module for a station of a wireless communication system and related method

A communication device and a method of processing input data. The communication device, processing input data constituting at least one of data packet comprises a detection unit, an Automatic Gain Controller (AGC), a signal processor, a demodulator, a pre-detection module, and a Baseband module. The detection unit receives the input data to perform the packet detection. The Automatic Gain Controller, coupled to the detection unit, generates an adjusted data and a gain control parameter once packet is detected. The signal processor, coupled to the AGC, performs the data signal processing includes at least one of analog to digital transformation processing, radio frequency processing and baseband processing, and detects at least one of the desired signal, noise and interference. The demodulator, coupled to the signal processor, demodulates the processed data into a processed data according to at least one processing function of noise reduction, interference reduction, and signal compensation. The pre-detection module, coupled to the demodulator, determines whether a potential error has occurred in the demodulated input data by a pre-detection method prior completing retrieval of the data packet for performing a packet-based error check sequence, and performs a selection to decide whether the components need to be terminated and which of the components need to be terminated if there is a potential error occurred on the demodulated input data. The Baseband module, coupled to the demodulator, performs a packet-based error check on the data packet upon completing retrieval of the data packet if there is no potential error occurred on the demodulated input data.

Communication device and method

An apparatus for survivor path decoding in a Viterbi decoder with a constraint length of K. The apparatus of the invention includes a best survivor unit, a a register-exchange network, and a trace-back unit. The best survivor unit receives path metrics of 2local winner states from which a best state is selected every L iterations. Meanwhile, the register-exchange network generates decision vectors of survivor paths leading to 2states at instant i according to decision bits of all states from instant i&#x2212;L to instant i. Every L iterations the register-exchange network outputs L-bit decision vectors for all states at instant i. Then the trace-back unit stores the decision vectors and finds a global survivor path sequence by following the decision vectors back from the best state at instant i&#x2212;L. In this manner, L decoded bits can be output from the trace-back unit every L iterations.

Survivor memory management in a Viterbi decoder

A polling-based communication apparatus and system. The apparatus of the invention, connected to a host computer through a peripheral bus, comprises an arbiter and multiple addressable entities. Each addressable entity corresponds to one of queues maintained in the host computer. The arbiter can determine which queue is to be served next in accordance with a quality of serve policy. The host computer polls each addressable entity by issuing a query packet. Depending on the queue chosen to be served next, the arbiter grants the corresponding addressable entity access to the peripheral bus, causing this granted addressable entity to respond to the host computer's polling with an acknowledgement packet. Thus the host computer initiates transactions to transfer data packets from the chosen queue through the peripheral bus to the corresponding addressable entity.

Polling-based apparatus and system guaranteeing quality of service

An apparatus for branch metric computation and add-compare-select operation in a rate 1/n Viterbi decoder with a constraint length of K. The apparatus of the invention includes a branch metric generator and an add-compare-select unit. The branch metric generator calculates a plurality of branch metrics each of which is a measure between a currently received data symbol and a corresponding branch label. The add-compare-select unit can generate respective decision bits for a pair of odd and even states at next instant with a novel pre-computational architecture. Further, a local winner between the odd and even states is predetermined in a manner providing reduction of the activity required by the computation. Thus the add-compare-select unit outputs a path metric of the local winner, whereby a saving of half the output number of path metrics is achieved.

Growing community of inventors

Hsinchu, Taiwan

Shih-Chung Yin