Abstract:
A method and apparatus for uplink transmission over a non-contentious shared feedback channel are disclosed, wherein the parameters of the uplink transmission are determined by the parameters of a downlink transmission. A new uplink channel, called a physical shared uplink feedback channel (PSUFCH) is used for uplink transmission such as feedback information in response to a downlink transmission on a fast shared data channel. The content of the feedback information may be general, e.g. an ACK/NACK or a channel quality indicator (CQI). The PSUFCH is transmitted using power ramping that terminates upon reception of a downlink ACK (DLACK) from a Node-B. No ambiguity resolution is required due to the non-contentious and deterministic mapping of the uplink channel resources.
Abstract:
When a wireless transmit receive unit (WTRU) is using a reduced dedicated physical control channel (DPCCH) frame, the WTRU may periodically send a normal DPCCH frame. The WTRU may periodically increase the transmit power or send a normal DPCCH frame if there is a transmit power control (TPC) error or a downlink quality is below a threshold. When the WTRU implements DPCCH transmission gating, the WTRU may set a gating period based on the number of received TPC commands. The WTRU or Node-B may restore to a normal mode, if the link quality is below a threshold. The WTRU may periodically increase a transmit power. When a reduced signal-to-interference ratio (SIR) target is used for TPC, the WTRU may increase a transmit power, if the downlink power is not responsive. The WTRU or the Node-B may restore a normal SIR target if the link quality is below a threshold.
Abstract:
A method and system for generating a secret key from joint randomness shared by wireless transmit/receive units (WTKUs) are disclosed. A first WTRU and a second WTRU perform channel estimation to generate a sampled channel impulse response (CIR) on a channel between the first WTRU and the second WTRU. The first WTRU generates a set of bits from the sampled CIR and generates a secret key and a syndrome, (or parity bits), from the set of bits. The first WTRU sends the syndrome, (or parity bits), to the second WTRU. The second WTRU reconstructs the set of bits from the syndrome, (or parity bits), and its own sampled CIR, and generates the secret key from the reconstructed set of bits.
Abstract:
A wireless transmit/receive unit (WTRU) and a Node B, respectively, perform joint randomness not shared by others (JRNSO) measurement to generate JRNSO bits based on a channel estimate between the WTRU and the Node B. The WTRU and the Node B then perform a reconciliation procedure to generate a common JRNSO bits. The Node B sends the common JRNSO bits to a serving network. The WTRU and the SN secure a session key (such as an integrity key, a cipher key and an anonymity key), using the common JRNSO bits. The JRNSO measurements are performed on an on-going basis, and the session key is updated using a new set of common JRNSO bits. The JRNSO bits may be expanded by using a pseudorandom number generator (PNG) or a windowing technique. A handover may be intentionally induced to increase the JRNSO bits generation rate.
Abstract:
A protocol engine (PE) (210) for processing data within a protocol stack in a wireless transmit/receive unit (WTRU) is disclosed. The protocol stack executes decision and control operations. The data processing and re-formatting which was performed in a conventional protocol stack is removed from the protocol stack and performed by the PE. The protocol stack issues a control word for processing data and the PE processes the data based on the control word. Preferably, the WTRU includes a shared memory (220) and a second memory (221). The shared memory (220) is used as a data block place holder to transfer the data amongst processing entities. For transmit processing, the PE retrieves source data from the second memory and processes the data while moving the data to the shared memory (220) based on the control word. For receive processing, the PE retrieves received data from the shared memory (220) and processes it while moving the data to the second memory (221).
Abstract:
At least one user data stream is layer 2/3 processed, physical layer processed and radio frequency processed. A watermark/signature is embedded at at least one of layer 2/3, physical layer or radio frequency, producing an embedded wireless communication. The embedded wireless communication is wirelessly transferred. The embedded wireless communication is received and the watermark/signature is extracted from the embedded wireless communication.
Abstract:
A channel estimation method which reduces the strain on resources of a Rake receiver using a complex weight gain (CWG) algorithm. In one embodiment, a non-adaptive algorithm is used to average blocks of pilot symbols from several slots. In another embodiment, an adaptive algorithm implements sliding window averaging or a recursive filter. Using a CWG algorithm reduces the memory and processor requirements of the Rake receiver.
Abstract:
A “smart antenna” (30) method and apparatus for use in cellular networks where the wireless transmit receive unit (wtru-1, wtru-2, wtru-3) and/or the base station utilize multi-user detection (MUD). The interference to and from other users is taken into consideration to maximize the desired signal while eliminating or reducing interfering signals, thereby increasing overall system capacity.
Abstract:
A plurality of communication signals have differing spreading codes. Each communication has an associated code comprising chips. For each chip of each communication, a vector of that chip convolved with an impulse response is produced. For each communication, support blocks comprising the chip vectors are produced. A number of the chip vectors in a support block is based on that communication's spreading factor. A system response matrix is assembled. The system response matrix has symbol sub-matrices. Each symbol sub-matrix comprises a support block from each communication. Data of the communications is detected using the symbol response matrix.
Abstract:
A Node-B/base station receiver comprises at least one antenna for receiving signals. Each finger of a pool of reconfigurable Rake fingers recovers a multipath component of a user and is assigned a code of the user, a code phase of the multipath component and an antenna of the at least one antenna. An antenna/Rake finger pool interface provides each finger of the Rake pool an output of the antenna assigned to that Rake finger. A combiner combines the recovered multipath components for a user to produce data of the user.