摘要:
A method for communicating over a wireless backhaul channel comprising generating a radio frame comprising a plurality of time slots, wherein each time slot comprises a plurality of symbols in time and a plurality of sub-carriers in a system bandwidth, broadcasting a broadcast channel signal comprising a transmission schedule to a plurality of remote units in a number of consecutive sub-carriers centered about a direct current (DC) sub-carrier in at least one of the time slots in the radio frame regardless of the system bandwidth, and transmitting a downlink (DL) control channel signal and a DL data channel signal to a first of the remote units, wherein the DL data channel signal is transmitted by employing a single carrier block transmission scheme comprising a Discrete Fourier Transform (DFT) spreading for frequency diversity.
摘要:
A method for communicating over a wireless backhaul channel comprising generating a radio frame comprising a plurality of time slots, wherein each time slot comprises a plurality of symbols in time and a plurality of sub-carriers in a system bandwidth, broadcasting a broadcast channel signal comprising a transmission schedule to a plurality of remote units in a number of consecutive sub-carriers centered about a direct current (DC) sub-carrier in at least one of the time slots in the radio frame regardless of the system bandwidth, and transmitting a downlink (DL) control channel signal and a DL data channel signal to a first of the remote units, wherein the DL data channel signal is transmitted by employing a single carrier block transmission scheme comprising a Discrete Fourier Transform (DFT) spreading for frequency diversity.
摘要:
A method for uplink (UL) wireless backhaul communication at a wireless backhaul remote unit in a radio access network comprising receiving a configuration for radio frames and a transmission schedule through a downlink (DL) physical layer broadcast channel, wherein the transmission schedule comprises a transmission allocation for the remote unit, generating a UL data frame, wherein generating the UL data frame comprises performing forward error correction (FEC) encoding on a data bit stream to generate a plurality of FEC codewords, wherein performing the FEC encoding comprises performing Reed Solomon (RS) encoding on the data bit stream to generate a plurality of RS codewords, performing byte interleaving on the RS codewords, and performing Turbo encoding on the byte interleaved RS codewords to generate one or more Turbo codewords, wherein each Turbo codeword is encoded from more than one RS codeword, and transmitting the UL data frame according to the transmission allocation.
摘要:
A method for uplink (UL) wireless backhaul communication at a wireless backhaul remote unit in a radio access network comprising receiving a configuration for radio frames and a transmission schedule through a downlink (DL) physical layer broadcast channel, wherein the transmission schedule comprises a transmission allocation for the remote unit, generating a UL data frame, wherein generating the UL data frame comprises performing forward error correction (FEC) encoding on a data bit stream to generate a plurality of FEC codewords, wherein performing the FEC encoding comprises performing Reed Solomon (RS) encoding on the data bit stream to generate a plurality of RS codewords, performing byte interleaving on the RS codewords, and performing Turbo encoding on the byte interleaved RS codewords to generate one or more Turbo codewords, wherein each Turbo codeword is encoded from more than one RS codeword, and transmitting the UL data frame according to the transmission allocation.
摘要:
Embodiments of the invention provide a method of decoding of hexagonal constellations. The decoding methods exploit the inherent structure of the hexagonal grid to eliminate/minimize the requirements for distance computations. A constellation which has unused constellation points is received. A plurality of lookup tables is used for indicating whether a particular constellation point is used. The lookup tables are indexed using the two integers u and v. An initial estimate ū and v is found. The Euclidean distance to the immediate neighbors resulting in the immediate upper and lower integers for ū and v is computed. From the distance to the nearest neighbor, the log-likelihood ratio value is computed.
摘要:
Embodiments of the invention provide a methods for the assignment of codewords to the available constellation points to minimize the Hamming distance between adjacent codewords. An hexagonal constellation is modeled as a two-dimensional trellis with an horizontal axis varying across a plurality of constellation points and a vertical axis varying across a plurality of codewords [0, 1, . . . , N−1]. A best path through the trellis is found to select a single constellation point per each codeword where a codeword is to be assigned. A each state in the transition across the trellis diagram, a current score and the best path that leads to the state is stored in a memory. Each codeword is assigned to the selected constellation point. The hexagonal constellation is used for transmitting data in a communication system.
摘要:
A method for uplink (UL) wireless backhaul communication at a wireless backhaul remote unit in a radio access network comprising receiving a configuration for radio frames and a transmission schedule through a downlink (DL) physical layer broadcast channel, wherein the transmission schedule comprises a transmission allocation for the remote unit, generating a UL data frame, wherein generating the UL data frame comprises performing forward error correction (FEC) encoding on a data bit stream to generate a plurality of FEC codewords, wherein performing the FEC encoding comprises performing Reed Solomon (RS) encoding on the data bit stream to generate a plurality of RS codewords, performing byte interleaving on the RS codewords, and performing Turbo encoding on the byte interleaved RS codewords to generate one or more Turbo codewords, wherein each Turbo codeword is encoded from more than one RS codeword, and transmitting the UL data frame according to the transmission allocation.
摘要:
A method for uplink (UL) wireless backhaul communication at a wireless backhaul remote unit in a radio access network comprising receiving a configuration for radio frames and a transmission schedule through a downlink (DL) physical layer broadcast channel, wherein the transmission schedule comprises a transmission allocation for the remote unit, generating a UL data frame, wherein generating the UL data frame comprises performing forward error correction (FEC) encoding on a data bit stream to generate a plurality of FEC codewords, wherein performing the FEC encoding comprises performing Reed Solomon (RS) encoding on the data bit stream to generate a plurality of RS codewords, performing byte interleaving on the RS codewords, and performing Turbo encoding on the byte interleaved RS codewords to generate one or more Turbo codewords, wherein each Turbo codeword is encoded from more than one RS codeword, and transmitting the UL data frame according to the transmission allocation.
摘要:
A method for incorporating invisible APs for RSSI based indoor positioning is presented. An empirical estimate of the probability of invisible APs versus distance is computed. An estimated position of the receiver can be computed using any statistical estimator based on the probability. In one embodiment, an estimate of the probability is computed by combining the probability over a set of visible APs and the probability over a set of invisible APs with the probability of individual contribution. In one embodiment a dynamic procedure is used to update the invisible probability that is computed using an AP dictionary built on the fly as new APs are detected. Incorporating invisible APs for estimating user position from the RSSI measurements for indoor positioning provides a better positioning accuracy as compared to typical estimators which rely only on the visible APs.
摘要:
The breadth-first search (BFS) starts with a root node. In the first stage, all neighbors of the root node are discovered and added to the nodes frontier. In the following stages, unvisited nodes from the neighbors of the frontier nodes are discovered and added to the frontier. To improve the parallelization of the BFS, the bottom-up search iterates over all unvisited nodes, where each unvisited node searches for its visited neighbors. Communication between nodes and clusters is pipelined with the execution of the BFS.