Abstract: Embodiment techniques map parity bits to sub-channels based on their row weights. In one example, an embodiment technique includes polar encoding, with an encoder of the device, information bits and at least one parity bit using the polar code to obtain encoded data, and transmitting the encoded data to another device. The polar code comprises a plurality of sub-channels. The at least one parity bit being placed in at least one of the plurality of sub-channels. The at least one sub-channel is selected from the plurality of sub-channels based on a weight parameter.

Abstract: Embodiments of this application provide a method for transmitting encoded information. A communication device obtains K bits of information, and generates a to-be-encoded sequence u1N, wherein N is a length of the sequence. The device encodes the sequence u1N in an encoding process, to obtain an output sequence, and transmits the output sequence. In the sequence u1N, each of the N bits corresponds to a subchannel, and each subchannel has a reliability. The K information bits, a quantity J of first-type auxiliary bits, and a quantity J? of second-type auxiliary bits are placed in K?=K+J+J? bit positions of the sequence u1N according to reliabilities of the subchannels. Since the positions of the information bits and the auxiliary bits are pre-determined and not affected by subsequent encoding and rate-matching, overheads of real-time reliability calculation are effectively reduced, time is saved, and delay is reduced.

Abstract: Embodiments of the inventive subject matter include receiving, in a distributed computing environment, a plurality of files for execution. Embodiments further include identifying, by parsing the plurality of files, code segments contained in each of the plurality of files. Embodiments further include determining, based on a comparison of the code segments and definitions contained in a distributed computing basic function library, a first group of the code segments that include configuration tasks and a second group of the code segments that include computational tasks. Embodiments further include combining the first group of the code segments to form a super configuration task. Embodiments further include creating an executable code, wherein the executable code comprises the super configuration task and the second group of code segments. Embodiments further include allocating the executable code to one or more nodes. Embodiments further include executing the executable code on the one or more nodes.

Abstract: Two algorithms for different functional-split network models are provided, which are the CU-based (central unit based) beam allocation and admission control algorithm (CU-BAACA) and the DU-based (distributed unit based) beam allocation and admission control algorithm (DU-BAACA). Difference between the CU-BAACA and DU-BAACA includes whether the algorithm is implemented at the CU site or at the DU site. Proposed algorithms aim to optimize DUs' quality of experience (QoE) by admission control to determine the amount of data from application layer entering into traffic queue and allocating beam in physical layer at the fronthaul network between CU and DUs. On the other hand, queueing delay and queue stability are taken into consideration to maintain the system steadiness. Simulation results compare performance of two functional split models to find the appropriate scenario for each function split option, which provide technical requirement and applicability of the proposed algorithms for practical system.

Abstract: This application relates to the field of wireless communications technologies, and discloses an encoding method and apparatus, to improve accuracy of reliability calculation and ordering for polarized channels. The method includes: obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence includes sequence numbers of N polarized channels, the first sequence is same as a second sequence or a subset of the second sequence, the second sequence comprises sequence numbers of Nmax, polarized channels, and the second sequence is the sequence shown in Sequence Q11 or Table Q11, K is a positive integer, N is a positive integer power of 2, n is equal to or greater than 5, K?N, Nmax=1024; selecting sequence numbers of K polarized channels from the first sequence; and performing polar code encoding on K the to-be-encoded bits based on the selected sequence numbers of the K polarized channels.

Abstract: Embodiments of the present invention provide a coding method, where the coding method includes: obtaining, based on a puncturing/shortening proportion P? and a prestored sequence S?, a constructed sequence S that has a length equal to a target code length M, where S? includes N? channel indexes sorted by channel reliability or channel capacity, and sorting of channel indexes in S is the same as or different from sorting of channel indexes in S?; and mapping a to-be-sent bit sequence to a channel corresponding to S. According to this method, an appropriate constructed sequence S may be generated based on different puncturing/shortening proportions to perform coding, thereby decreasing a bit error rate.

Abstract: Aspects of this disclosure provide a technique for implementing polar encoding with incremental redundancy HARQ re-transmission. In particular, a transmitter encodes a message using different polar codes to obtain a first codeword and a second codeword that is twice the length of the first codeword, and transmit the first codeword as an original transmission, and the second half of the second codeword as a re-transmission without transmitting the first half of the second codeword. Information bits that are common to both the first codeword and the second half of the second codeword is mapped to more-reliable bit-locations in the second half of the second codeword. Decoded bit values for the common information in the original transmission and retransmission is compared by the receiver to perform a parity check.

Abstract: Embodiments of this application provide a method for processing information bits in a wireless communication network. A device obtains a Polar encoded bit sequence, then divide the Polar encoded bit sequence into g groups that are of equal length N/g, wherein g is 32. The device block interleaves the g groups to obtain an interleaved bit sequence according to a sequence S, wherein the sequence S comprises: group numbers of the g groups, wherein a group whose number is 0 is the first element in the sequence S, wherein a group whose number is 12 is the 17th element in the sequence S, wherein a group whose number is 31 is the 32nd element in the sequence S, wherein the S is an integer and output the interleaved bit sequence.

Abstract: An image processing method and apparatus belong to the technical field of image processing. The method is applied to a mobile terminal, and includes: acquiring a target image on a Two-dimensional (2D) image (S11); creating a Three-Dimensional (3D) image layer, taking the 2D image as a background of the 3D image layer, and creating a background frame on the 3D image layer (S12); detecting an orientation of the mobile terminal, and adjusting a shape of the background frame according to the orientation of the mobile terminal, so that different areas of the 2D image are moved into or out of the background frame (S13); and when the target object on the 2D image is not completely accommodated within the background frame, drawing the target object at a position of the target object on the 3D image layer (S14), where the 2D image, the background frame, and the drawn target object on the 3D image layer are sequentially stacked from bottom to top.

Abstract: This disclosure provides a data retransmission method and apparatus. The method includes: A transmitting device obtains information to be transmitted for a tth time, where the information to be transmitted for the tth time includes Rt extension locations and information to be transmitted for a (t?1)th time, and the extension locations include Mt information bits and Lt check bits corresponding to the Mt information bits. The transmitting device then performs Polar encoding on the information to be transmitted for the tth time, to obtain a codeword after the Polar encoding, obtains a codeword for (t?1)th retransmission based on the codeword after the Polar encoding, and transmits the codeword for (t?1)th retransmission. A receiving device performs polar decoding after receiving the codeword for (t?1)th retransmission, to obtain a decoding result of codewords for t times of transmission.

Abstract: Embodiments of the application provide a method for transmitting data in a wireless communication network. A device of the network receives a bit sequence of K information bits. The device polar codes the bit sequence to obtain a first encoded sequence, wherein a length of the first encoded sequence is N, and N is greater than or equal to K. The device block interleaves the first encoded sequence to obtain an interleaved bit sequence. The device determines a transmission code rate R. When the transmission code rate R is less than the code rate threshold, the device outputs a second bit sequence. The length of the second bit sequence is M, M is smaller than N. The second bit sequence is punctured from the interleaved bit sequence by removing (N?M) bits from beginning of the interleaved bit sequence.

Abstract: This application provides an encoding method and apparatus in wireless communications between a network device and a terminal. The method includes: performing cyclic redundancy check (CRC) encoding on A to-be-encoded information bits based on a CRC polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and A information bits, L=11; and performing polar encoding on the first bit sequence.

Abstract: A polar code encoder is configured to: map q bits to q positions of q sub-channels, where q is a positive integer, and the q bits are used to indicate a version of encoded codeword; map K-q information bits to K-q positions for the K-q information bits, K is an integer, K>q; and perform polar encoding over an input vector u0N-1, comprising the q bits and the K-q information bits, with the length of N, N is an integer, N>=K and scramble with scrambling vector over the polar encoded bits, where the scrambling vector is associated to the q sub-channels or the scrambling vector is associated to a special frozen bit which is corresponding to the q sub-channels.

Abstract: A polar code encoding method and apparatus are provided, the method including obtaining a first sequence used to encode K to-be-encoded bits, where the first sequence comprises sequence numbers of N polar channels, where the sequence numbers of the N polar channels are arranged in the first sequence according to reliability of the N polar channels, where K is a positive integer, where N is a mother code length of a polar code, where N is a positive integer power of 2, and where K?N, selecting sequence numbers of K polar channels from the first sequence in descending order of the reliability, and placing the to-be-encoded bits according to the selected sequence numbers of the K polar channels, and performing polar code encoding on the to-be-encoded bits.

Abstract: A gearbox assembly includes a gearbox housing and a planetary gear system configured within the gearbox housing. The planetary gear system includes a plurality of planet gears, at least one sun gear, at least one ring gear, at least one planetary carrier operatively coupled with the plurality of planet gears, and a plurality of pin shafts. Each of the plurality of planet gears are arranged so as to rotate around one of the plurality of pin shafts. Further, the plurality of planet gears are engaged with the ring gear and configured to rotate about the sun gear. The gearbox assembly also includes a first lubricant path defined from a first location to a second location through the at least one planetary carrier. Moreover, the first lubricant path is located outside of the plurality of pin shafts.

Abstract: Example Polar code rate matching methods and apparatus are described. One example method includes determining a first index set corresponding to N to-be-encoded bits. The first index set includes indexes of Z polarized channels on which forced frozen bits are placed. The Z polarized channels are a subset of N polarized channels corresponding to the N to-be-encoded bits, N=2n, Z<N, and n and Z are positive integers. A first codeword with a length of N is obtained by performing Polar coding on the N to-be-encoded bits. Rate matching is performed on the first codeword based on the first index set, to obtain a second codeword with a length of M, where M<N and M is a positive integer. The second codeword is sent with a length of M.

Abstract: Various embodiments provide an interleaving method, to improve error correction performance of a polar code. In these embodiments, a first bit sequence is obtained. The first bit sequence includes L number of bits, and L is a positive integer. The L number of bits are then written into an interleaving matrix according to a preset write rule. The interleaving matrix includes C rows and R number of columns. C and R are positive integers. The L number of bits can be read from the interleaving matrix according to a preset read rule to obtain a second bit sequence. The second bit sequence includes L number of bits; and sending the second bit sequence.

Abstract: This application provides an encoding method and apparatus in a wireless communications system. The method includes: performing cyclic redundancy check (CRC) encoding on A to-be-encoded information bits based on a CRC polynomial, to obtain a first bit sequence, where the first bit sequence includes L CRC bits and the A information bits; and performing polar encoding on the first bit sequence, where L has a value of one of 3, 4, 5, 8, and 16. Based on an improved CRC polynomial, coding satisfying a false alarm rate (FAR) requirement is implemented.

Abstract: Embodiment techniques map parity bits to sub-channels based on their row weights. In one example, an embodiment technique includes polar encoding, with an encoder of the device, information bits and at least one parity bit using the polar code to obtain encoded data, and transmitting the encoded data to another device. The polar code comprises a plurality of sub-channels. The at least one parity bit being placed in at least one of the plurality of sub-channels. The at least one sub-channel is selected from the plurality of sub-channels based on a weight parameter.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.