Huawei Technologies Canada Co., Ltd.

Future Wei Technologies, Inc.

Huawei Technologies Co., Limited

Ramy Gohary

Halim Yanikomeroglu

Gamini Senarath

Yaser Fouad

Nimal Gamini Senarath

Hosein Nikopour

Ngoc Dung Dao

Ho Ting Cheng

Akram Bin Sediq

Ian Marsland

Reinhard Balogun

According to embodiments, there is provided a method apparatus for determining an encoding scheme for transmission of encoded data across a communications channel. The method includes determining the encoding scheme at a design Signal-to-Noise Ratio and evaluating a Frame Error Rate of the encoding scheme. If the FER is not within a target range, the method further includes modifying the encoding scheme until the evaluated FER is within the target range. There is further provided a method and apparatus for mapping bit labels to a plurality of symbols in a constellation, wherein the constellation are organisable into a plurality of sets and each bit label includes a plurality of bit positions. The method includes determining a distance metric between sets and merging pairs of sets according to the distance metric. The method further includes assigning a value to a bit position for bit labels of symbols in the merged set.

Method for determining an encoding scheme and symbol mapping

An embodiment method includes determining, by a first network device, an equivalent coherence time of a narrowband network corresponding to the broadband network in accordance with a channel coherence time and a coherence bandwidth of the broadband network. The method further includes structuring, by the first network device, a Grassmannian symbol in accordance with the equivalent coherence time, generating, by the first network device, Grassmannian symbol sections by partitioning the Grassmannian symbol in accordance with the coherence bandwidth, and transmitting, by the first network device to a second network device, the Grassmannian symbol sections on subchannels within the coherence bandwidth.

System and method for grassmannian signaling in a broadband network

An embodiment communication system and method for using multiple-input multiple-output use. Kronecker model to determine a symbol coding formulation that achieves ergodic capacity for high signal-to-noise ratios (SNRs). The lower bound on this capacity is achieved by input signals in the form of the product of an isotropically distributed random Grassmannian component and a deterministic component comprising the eigenvectors and the inverse of the eigenvalues of the transmitter covariance matrix.

System and method for multiple-input multiple-output communication

Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

System and methods to achieve optimum efficiency-jain fairness in wireless systems

Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

Growing community of inventors

Ottawa, Canada

Ramy Gohary