Patent Description:
Aspects of the present disclosure generally relate to wireless communication and to techniques and apparatuses for noncoherent wireless communication using modified Reed Muller codes.

<CIT> discloses aspects of uplink control signal design for wireless systems. <CIT> discloses aspects of the generation and application of a sub-codebook of an error control coding codebook.

The invention is defined by the subject-matter of independent claims <NUM>, <NUM>, <NUM> and <NUM>.

Controller/processor <NUM> of base station <NUM>, controller/processor <NUM> of UE <NUM>, and/or any other component(s) of <FIG> may perform one or more techniques associated with noncoherent wireless communication using modified Reed Muller codes, as described in more detail elsewhere herein. For example, controller/processor <NUM> of base station <NUM>, controller/processor <NUM> of UE <NUM>, and/or any other component(s) of <FIG> may perform or direct operations of, for example, process <NUM> of <FIG>, process <NUM> of <FIG>, and/or other processes as described herein. Memories <NUM> and <NUM> may store data and program codes for base station <NUM> and UE <NUM>, respectively. In some aspects, memory <NUM> and/or memory <NUM> may comprise a non-transitory computer-readable medium storing one or more instructions for wireless communication. For example, the one or more instructions, when executed by one or more processors of the base station <NUM> and/or the UE <NUM>, may perform or direct operations of, for example, process <NUM> of <FIG>, process <NUM> of <FIG>, and/or other processes as described herein.

In some aspects, UE <NUM> may include means for generating a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits, means for removing, from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix, means for encoding the information bit vector using the modified Reed Muller generating matrix to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like. In some aspects, UE <NUM> may include means for prepending a fixed-value bit to an information bit vector that includes a plurality of information bits, means for generating a Reed Muller generating matrix for the information bit vector with the fixed-value bit prepended to the information bit vector, means for encoding, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like. In some aspects, such means may include one or more components of UE <NUM> described in connection with <FIG>, such as controller/processor <NUM>, transmit processor <NUM>, TX MIMO processor <NUM>, MOD <NUM>, antenna <NUM>, DEMOD <NUM>, MIMO detector <NUM>, receive processor <NUM>, and/or the like.

In some aspects, base station <NUM> may include means for generating a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits, means for removing, from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix, means for encoding the information bit vector using the modified Reed Muller generating matrix to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like. In some aspects, base station <NUM> may include means for prepending a fixed-value bit to an information bit vector that includes a plurality of information bits, means for generating a Reed Muller generating matrix for the information bit vector with the fixed-value bit prepended to the information bit vector, means for encoding, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like. In some aspects, such means may include one or more components of base station <NUM> described in connection with <FIG>, such as antenna <NUM>, DEMOD <NUM>, MIMO detector <NUM>, receive processor <NUM>, controller/processor <NUM>, transmit processor <NUM>, TX MIMO processor <NUM>, MOD <NUM>, antenna <NUM>, and/or the like.

<FIG> are block diagrams conceptually illustrating one or more examples <NUM> of various types of wireless communication, in accordance with various aspects of the present disclosure. <FIG> illustrates an example <NUM> of coherent wireless communication and <FIG> illustrates and example <NUM> of noncoherent wireless communication. The various types of wireless communication illustrated in <FIG> may be performed by wireless communication devices, such as a UE <NUM>, a BS <NUM>, and/or the like.

As shown in <FIG>, coherent communication may include wireless communication involving the use of pilot signals and/or reference signals. A wireless communication device (referred to as a "transmitter") may transmit an information bit vector (e.g., a string of bits carrying one or more types of information) by encoding the information bit vector to form one more codewords that each include a plurality of coded bits, modulating the codewords to form one or more orthogonal frequency division multiplexing (OFDM) symbols, generating a pilot signal or reference signal associated with the OFDM symbols (e.g., a demodulation reference signal (DMRS) and/or another type of reference signal), and transmitting the pilot/reference signal and the OFDM symbols over a wireless physical channel (e.g., a physical downlink control channel (PDCCH), a physical downlink shared channel (PDSCH), a physical uplink control channel (PUCCH), a physical uplink shared channel (PUSCH), and/or the like) to another wireless communication device (referred to as a "receiver").

As further shown in <FIG>, the receiver may receive the pilot/reference signal and the OFDM symbols via the physical channel, and may use the pilot/reference signal to obtain channel state information associated with the physical channel. For example, the receiver may demodulate and decode the pilot/reference signal and the OFDM symbols, may perform a channel estimation of the physical channel based at least in part on the demodulation and/or decoding of the pilot/reference signal, and may adjust or modify demodulation and/or decoding parameters for the receiver to increase the efficiency and performance of demodulation and/or decoding for the receiver.

In some cases, coherent communication in a wireless system may be suboptimal at low signal to noise ratios (SNR). For example, the energy used to transmit, decode, and/or measure pilot/reference signals may be wasted because, at low SNR, pilot/reference signals may contain little to no useful information for the receiver. Moreover, attempting to perform a channel estimation at low SNR may result in an inaccurate and/or poor quality channel estimation, which in turn may result in degraded performance in demodulation and/or decoding.

As shown in <FIG>, a transmitter and a receiver may perform noncoherent communication to increase demodulation and/or decoding performance in low SNR scenarios. "Noncoherent communication" may refer to a wireless communication scheme in which the transmitter does not transmit any pilot signals or reference signals for OFDM symbols carrying data/information. In this case, the receiver directly demodulates and decodes the received OFDM symbols without performing a channel estimation based at least in part on a pilot signal or reference signal.

Noncoherent communication schemes rely on a channel coherence principal that channel properties for adjacent coded OFDM symbols (e.g., adjacent in time resources and/or frequency resources) are the same or roughly the same. This permits a transmitter to use differential modulation (e.g., where information is modulated based at least in part on the phase difference between adjacent coded OFDM symbols) and/or sequence-based modulation (e.g., where information is modulated jointly on a sequence of OFDM symbols). However, the longer that channel coherence is used (e.g., the greater the quantity of adjacent coded OFDM symbols that are considered to be coherent), the greater the complexity of encoding at the transmitter and decoding at the receiver. In some channel encoding/decoding techniques, channel coherence may cause an exponential increase in encoding and decoding.

A wireless communication device (e.g., a transmitter) may encode an information bit vector using various encoding techniques. One encoding technique includes the use of Reed Muller codes. A Reed Muller code is a class of linear block codes that is used in various wireless networks and in deep space communications. A Reed Muller code may be defined by an order r and a dimension m, where <NUM> ≤ r ≤ m. For a Reed Muller code with an order r and a dimension m, a blocklength may be defined as N = <NUM>m, and the maximum payload size of the Reed Muller code (e.g., the quantity of information bits that the Reed Muller code is capable of carrying) is given by <MAT>.

To encode an information bit vector using a Reed Muller code, a transmitter may generate a Reed Muller generating matrix and may right-multiply the information bit vector with the Reed Muller generating matrix, where the multiplication is in the binary field. The information bit vector may include a row vector, in which case the a <NUM>^m by K matrix may be right-multiplied with the <NUM> by K column vector to generate a codeword the of size <NUM> by <NUM>^m. The transmitter may generate the Reed Muller generating matrix by generating a tensor product of a binary Hadamard matrix (e.g., a <NUM> × <NUM> binary Hadamard matrix). The resulting matrix may be a <NUM><NUM> × <NUM><NUM> binary matrix. To obtain the Reed Muller generating matrix from the tensor product of the binary Hadamard matrix, the transmitter may identify a particular quantity of row vectors having the greatest Hamming weight (e.g., having the greatest quantity of <NUM>-value bits). For example, to obtain a Reed Muller generating matrix for an order of <NUM> and a dimension of <NUM>, the transmitter may identify <NUM> row vectors having the greatest Hamming weight. As another example, to obtain a Reed Muller generating matrix for an order of <NUM> and a dimension of <NUM>, the transmitter may identify <NUM> row vectors having the greatest Hamming weight.

Reed Muller codes having a relatively low order (e.g., an order of <NUM> or less) may have a very large minimum distance, which permits a receiver to obtain near-optimal decoding performance with relatively moderate complexity in noncoherent communication schemes. However, Reed Muller codes are nested in that a Reed Muller code of order r and a dimension m contains a Reed Muller code of order r-<NUM> and a dimension m, a Reed Muller code of order r-<NUM> and a dimension m contains a Reed Muller code of order r-<NUM> and a dimension m, and so on. Thus, all Reed Muller codes with an order greater than <NUM> contain a Reed Muller code of order <NUM>, which produces a Reed Muller generating matrix of all <NUM>-values (e.g., [<NUM>, <NUM>,. , <NUM>, <NUM>]). As a result, if the bit values in half of the codewords generated by a Reed Muller code with an order greater than <NUM> are flipped, this results in the other half of the codewords generated by the same Reed Muller code. If a first codeword for an information bit vector [<NUM>, x,. , x ,x] and a second codeword for an information bit vector [<NUM>, x,. , x ,x] are transmitted noncoherently over a physical channel that does not have a known phase to the receiver, the receiver may not be able to distinguish between the first codeword and the second codeword because the received OFDM symbols for the first codeword and the received OFDM symbols for the second codeword may only differ by a constant phase (which is unknown to the receiver due to the communication between the transmitter and the receiver being noncoherent). More specifically, a first codeword for an information bit vector [<NUM>,x. x] is a bit-flipped version of a second codeword for an information bit vector [<NUM>,x,. After modulation, these two codewords will only differ by a constant phase. For example, if the modulated first codeword is x1,. ,xN, then the second codeword after modulation becomes -x1,. The modulation will convert a binary codeword into a sequence of modulated complex symbols. As a consequence, the modulated first and second codeword will not be distinguishable by the receiver over a noncoherent channel. Accordingly, the use of a Reed Muller code in noncoherent communication may result in a minimum block error rate (BLER) of at least <NUM>, which may result in poor decoding performance and high information loss at the receiver.

Some aspects described herein provide techniques and apparatuses for noncoherent wireless communication using modified Reed Muller codes. In some aspects, a wireless communication device (e.g., a UE <NUM>, a base station <NUM>, and/or the like) may generate a Reed Muller generating matrix for an information bit vector and may modify the Reed Muller generating matrix by removing a row vector consisting of all <NUM>-values. In this case, the wireless communication device removes the nested Reed Muller generating matrix corresponding to a Reed Muller code of order <NUM> from the overall Reed Muller generating matrix, which results in a modified Reed Muller generating matrix that may be used to encode K-<NUM> information bits into N coded bits. More specifically, a modified Reed Muller code of order r and dimension m may be used to encode K-<NUM> information bits into N coded bits, where <MAT>.

The wireless communication may use the modified Reed Muller generating matrix to encode the information bit vector to form one or more codewords, and may transmit the one or more codewords to a receiver without a pilot signal or reference signal (e.g., DMRS and/or another type of reference signal). This reduces the decoding BLER at the receiver when using Reed Muller codes for noncoherent communication, which may improving the decoding performance at the receiver while permitting the use of Reed Muller codes for noncoherent communication.

In some aspects, a wireless communication device may generate a Reed Muller generating matrix for an information bit vector and may prepend a fixed-value bit to the information bit vector before using the Reed Muller generating matrix to form codewords from the information bit vector. In this case, the wireless communication device may take an information bit vector including K-<NUM> information bits, and may prepend a <NUM>-value or a <NUM>-value to obtain a K-bit information bit vector. In some examples, the first row of the Reed Muller generator matrix corresponds to the all <NUM> vector. However, in other examples, the all-<NUM> vector may be placed as the last row of the Reed Muller generator matrix. In such cases, the fix-value may be appended to the information vector (instead of pre-pend).

The wireless communication device may encode the K-bit information vector using a Reed Muller generating matrix of order r and dimension m to form one or more codewords, and may transmit the one or more codewords to a receiver. In this way, the fixed-value bit prepended to the information bit vector removes the ambiguity, between codewords formed from information bit vectors differing by a first bit value in each of the information bit vectors, resulting from an unknown phase of a physical channel over which the codewords are transmitted. This reduces the decoding BLER at the receiver when using Reed Muller codes for noncoherent communication, which may increase decoding performance at the receiver while permitting the use of Reed Muller codes for noncoherent communication, which decreases the demodulation and decoding complexity for the receiver.

<FIG> are diagrams illustrating one or more examples <NUM> of noncoherent wireless communication using modified Reed Muller codes, in accordance with various aspects of the present disclosure. As shown in <FIG>, example(s) <NUM> may include communication between a transmitter and a receiver. The transmitter and the receiver may each include a wireless communication device. The wireless communication device for each of the transmitter and the receiver may be a UE <NUM>, a base station <NUM>, and/or another type of wireless communication device. The transmitter and the receiver may be included in a wireless network, such as wireless network <NUM> and/or another type of wireless network.

In some aspects, the transmitter and the receiver may communicate via noncoherent communication. In this case, the transmitter may receive an information bit stream, may encode the information bit stream to form one or more codewords, may modulate the codewords to form one or more OFDM symbols, and may transmit the OFDM symbols to the receiver without transmitting associated pilot signal or reference signal (e.g., DMRS and/or other types of reference signals).

As shown in <FIG>, and by reference number <NUM>, to encode an information bit vector that includes a plurality of information bits, the transmitter may generate a Reed Muller generating matrix for the information bit vector. As shown in <FIG>, an example Reed Muller generating matrix GRM(<NUM>,<NUM>) may be generated by the transmitter for a Reed Muller code having an order of <NUM> and a dimension of <NUM>. In this case, the resulting Reed Muller generating matrix GRM(<NUM>,<NUM>) may have <NUM> row vectors each including <NUM> bit values. Each of the <NUM> bit values may represent a <NUM>-value or a <NUM>-value.

In some aspects, the transmitter may generate a Reed Muller generating matrix may corresponding to a Reed Muller code having an order that satisfies an order threshold. For example, to ensure that the information bit vector is encoded with a low channel coding rate, the order threshold may be an order of <NUM> or <NUM> such that the transmitter generates a Reed Muller generating matrix corresponding to a Reed Muller code having an order that is less than or equal to an order of <NUM> or <NUM>. This prevents the decoding complexity at the receiver from being too high to permit Reed Muller codes from being used for noncoherent communication. Thus, in some aspects, to ensure that the order of the Reed Muller code associated with the Reed Muller generating matrix is low, the transmitter may use the Reed Muller generating matrix to encode the information bit vector based at least in part on determining that the coding rate to be used for the information bit vector satisfies a coding rate threshold, may determine that the quantity of bits included in the information bit vector satisfies a quantity threshold, and/or the like.

As shown in <FIG>, and by reference number <NUM>, the transmitter may remove a row vector from the Reed Muller generating matrix to form a modified Reed Muller generating matrix in which a row vector consisting of all <NUM>-values is removed. This removes the nested Reed Muller generating matrix having an order of <NUM> from the Reed Muller generating matrix. The modified Reed Muller generating matrix may correspond to a (K-<NUM>, N) Reed Muller code, which may be used to encode up to K-<NUM> information bits into N coded bits. As an example, if K-<NUM>=<NUM>, N=<NUM>, and if the sequence of information bits is [<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>], then the encoded bits can be obtained by right-multiplying the information bit vector [<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>] by the Reed Muller generating matrix illustrated in <FIG>, which may yield an encoded bit vector of [<NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>, <NUM>].

As shown in <FIG>, and by reference number <NUM>, the transmitter may encode the information bit vector using the modified Reed Muller generating matrix to form one or more codewords. Each of the codewords may include a plurality of coded bits. In some aspects, the transmitter may encode the information bit vector by right-multiplying the information bit vector with the modified Reed Muller generating matrix, where the multiplication is in the binary field.

In some cases, the blocklength n and the payload size k of the information bit vector may be non-standard or arbitrary. In this case, to encode the information bit vector, the transmitter may generate a parent modified Reed Muller generating matrix corresponding to a parent (K-<NUM>, N) Reed Muller code with order r and dimension m, and may extend the parent (K-<NUM>, N) Reed Muller code to a specified (k, n) Reed Muller code. To extend the parent (K-<NUM>, N) Reed Muller code to a specified (k, n) Reed Muller code, the transmitter may determine a largest value for a dimension m codeword such that <NUM>m ≤ n, may generate a <NUM>m-length codeword, and may cyclically repeat the <NUM>m-length codeword to form an n-length codeword. In some aspects, the transmitter may determine the largest value for the dimension m codeword based at least in part on an upper limit on order r.

As an example of the above, if the transmitter is to encode k information bits into n coded bits, the transmitter may determine r,m (and thus, K,N) by determining the following inequalities/equalities: <MAT> <MAT> <MAT>.

There may be multiple pairs of (r, m) values that satisfy the above inequalities/equalities. The transmitter may identify the pair that has smallest m. For the same m, the transmitter may identify the smallest value of r that satisfies r ≤ <NUM>. In some aspects, the transmitter may identify the smallest value for m=m<NUM> such that: <MAT> The transmitter may determine if for such an m, whether inequality (<NUM>) above is satisfied for r = <NUM> and m = mo. If not, the transmitter may increase mo by <NUM> (e.g., may set m<NUM> = m<NUM>+<NUM>). If so, the transmitter may determine whether inequality (<NUM>) above is satisfied for r = <NUM>, m = mo. If so, the transmitter may set r = <NUM>, m = m<NUM>. If not, the transmitter may set r = <NUM>, and m = m<NUM>.

As further shown in <FIG>, and by reference number <NUM>, the transmitter may noncoherently transmit the one or more codewords over a physical channel to the receiver. In this case, the transmitter may transmit the one or more codewords without transmitting an associated pilot signal or reference signal. In some aspects, to transmit the one or more codewords, the transmitter may modulate the one or more codewords into one or more OFDM symbols and may transmit the one or more OFDM symbols over the physical channel to the receiver. In some aspects, to achieve a low peak to average power ratio (PAPR) for the transmission of the OFDM symbols, the transmitter may modulate the one or more codewords using π/<NUM> binary phase shift keying (BPSK) modulation or quadrature phase-shift keying (QPSK) modulation. In some aspects, the transmitter may modulate the one or more codewords using one or more time-domain filters, one or more frequency-domain filters, and/or the like.

In this way, the transmitter may generate a Reed Muller generating matrix for an information bit vector and may modify the Reed Muller generating matrix by removing a row vector consisting of all <NUM>-values, which removes the nested Reed Muller generating matrix corresponding to a Reed Muller code of order <NUM> from the overall Reed Muller generating matrix. The resulting modified Reed Muller generating matrix may be used to encode K-<NUM> information bits into N coded bits. The transmitter may use the modified Reed Muller generating matrix to encode the information bit vector to form one or more codewords, and may transmit the one or more codewords to a receiver without a pilot signal or reference signal. This reduces the decoding BLER at the receiver when using Reed Muller codes for noncoherent communication, which may increase decoding performance at the receiver while permitting the use of Reed Muller codes for noncoherent communication, which decreases the demodulation and decoding complexity for the receiver.

As shown in <FIG>, and by reference number <NUM>, to encode an information bit vector that includes a plurality of information bits (e.g., K-<NUM> information bits), the transmitter may prepend a fixed-value bit to the information bit vector (e.g., may add a fixed value bit to the beginning of the information bit vector) to form a K-bit information bit vector. The fixed-value bit may be a <NUM>-value bit or a <NUM>-value bit, so long as the same fixed-value bit is prepended to the information bit vector and other information bit vectors to be encoded by the transmitter.

As shown in <FIG>, and by reference number <NUM>, the transmitter may generate a Reed Muller generating matrix for the information bit vector with the prepended fixed-bit value. As shown in <FIG>, an example Reed Muller generating matrix GRM(<NUM>,<NUM>) may be generated by the transmitter for a Reed Muller code having an order of <NUM> and a dimension of <NUM>. In this case, the resulting Reed Muller generating matrix GRM(<NUM>,<NUM>) may have <NUM> row vectors each including <NUM> bit values. Each of the <NUM> bit values may represent a <NUM>-value or a <NUM>-value.

As shown in <FIG>, and by reference number <NUM>, the transmitter may encode the information bit vector using the Reed Muller generating matrix to form one or more codewords. Each of the codewords may include a plurality of coded bits. In some aspects, the transmitter may encode the information bit vector with the prepended fixed-value bit by right-multiplying the information bit vector with the Reed Muller generating matrix, where the multiplication is in the binary field.

In some cases, the blocklength n and the payload size k of the information bit vector may be non-standard or arbitrary. In this case, to encode the information bit vector, the transmitter may generate a parent Reed Muller generating matrix corresponding to a parent (K-<NUM>, N) Reed Muller code with order r and dimension m, and may extend the parent (K-<NUM>, N) Reed Muller code to a specified (k, n) Reed Muller code. To extend the parent (K-<NUM>, N) Reed Muller code to a specified (k, n) Reed Muller code, the transmitter may determine a largest value for a dimension m codeword such that <NUM>m ≤ n, may generate a <NUM>m-length codeword, and may cyclically repeat the <NUM>m-length codeword to form an n-length codeword. In some aspects, the transmitter may determine the largest value for the dimension m codeword based at least in part on an upper limit on order r.

As further shown in <FIG>, and by reference number <NUM>, the transmitter may noncoherently transmit the one or more codewords over a physical channel to the receiver. In this case, the transmitter may transmit the one or more codewords without transmitting an associated pilot signal or reference signal. In some aspects, to transmit the one or more codewords, the transmitter may modulate the one or more codewords into one or more OFDM symbols and may transmit the one or more OFDM symbols over the physical channel to the receiver. In some aspects, to achieve a low PAPR for the transmission of the OFDM symbols, the transmitter may modulate the one or more codewords using π/<NUM> BPSK modulation or quadrature phase-shift keying (QPSK) modulation, using one or more time-domain filters, one or more frequency-domain filters, and/or the like.

In this way, the transmitter may generate a Reed Muller generating matrix for an information bit vector with a prepended fixed-value bit and may encode the information bit vector with the prepended fixed-value bit using the Reed Muller generating matrix. The fixed-value bit prepended to the information bit vector removes the ambiguity between codewords formed from information bit vectors differing by a first bit value in each of the information bit vectors that would otherwise result from an unknown phase of a physical channel over which the codewords are transmitted. This reduces the decoding BLER at the receiver when using Reed Muller codes for noncoherent communication, which may increase decoding performance at the receiver while permitting the use of Reed Muller codes for noncoherent communication, which decreases the demodulation and decoding complexity for the receiver.

<FIG> is a diagram illustrating a process <NUM> performed by a wireless communication device in accordance with the claimed invention. Process <NUM> is a process where the wireless communication device (e.g., UE <NUM>, base station <NUM>, and/or the like) performs operations associated with noncoherent wireless communication using modified Reed Muller codes.

As shown in <FIG>, process <NUM> includes generating a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) generates a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits, as described above. In some aspects, generating the Reed Muller generating matrix comprises generating the Reed Muller generating matrix using an order that satisfies an order threshold, wherein the order threshold is <NUM> or <NUM>.

As further shown in <FIG>, process <NUM> includes removing, from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) removes from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix, as described above. In some aspects, determining a largest value for the dimension m of the codeword comprises determining a largest value for a dimension m of the codeword such that <NUM>m is less than or equal to a block length n of the information bit vector; generating a <NUM>m-length codeword; and cyclically repeating the <NUM>m-length codeword to form an n-length codeword. In some aspects, encoding the information bit vector using the modified Reed Muller generating matrix to form the codeword comprises determining a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

As further shown in <FIG>, process <NUM> includes encoding the information bit vector using the modified Reed Muller generating matrix to form a codeword (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) encodes the information bit vector using the modified Reed Muller generating matrix to form a codeword, as described above.

As further shown in <FIG>, process <NUM> includes transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) transmits the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, as described above. In some aspects, transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises determining that a coding rate to be used for the information bit vector satisfies a coding rate threshold and transmitting, based at least in part on determining that the coding rate satisfies the coding rate threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword. In some aspects, transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword comprises determining that a quantity of bits included in the information bit vector satisfies a quantity threshold and transmitting, based at least in part on determining that the quantity of bits satisfies the quantity threshold, the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

In some aspects, process <NUM> includes modulating the codeword using π/<NUM> BPSK modulation or quadrature phase-shift keying (QPSK) modulation.

As shown in <FIG>, process <NUM> includes prepending a fixed-value bit to an information bit vector that includes a plurality of information bits (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) prepends a fixed-value bit to an information bit vector that includes a plurality of information bits, as described above. In some aspects, the fixed-value bit is a <NUM>-value bit. In some aspects, the fixed-value bit is a <NUM>-value bit.

As further shown in <FIG>, process <NUM> includes generating a Reed Muller generating matrix for the information bit vector (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) generates a Reed Muller generating matrix for the information bit vector, as described above. In some aspects, generating the Reed Muller generating matrix comprises generating the Reed Muller generating matrix using an order that satisfies an order threshold, wherein the order threshold is <NUM> or <NUM>.

As further shown in <FIG>, process <NUM> includes encoding, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword (block <NUM>). The wireless communication device (e.g., using transmit processor <NUM>, receive processor <NUM>, controller/processor <NUM>, memory <NUM>, receive processor <NUM>, transmit processor <NUM>, controller/processor <NUM>, memory <NUM>, and/or the like) encodes, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword, as described above. In some aspects, encoding the information bit vector using the Reed Muller generating matrix to form the codeword comprises determining a largest value for a dimension m of the codeword such that <NUM>m is less than or equal to a block length n of the information bit vector; generating a <NUM>m-length codeword; and cyclically repeating the <NUM>m-length codeword to form an n-length codeword. In some aspects, determining a largest value for the dimension m of the codeword comprises determining a largest value for the dimension m of the codeword based at least in part on an upper limit for an order of the codeword.

In some aspects, process <NUM> includes modulating the codeword using π/<NUM> binary BPSK modulation or quadrature phase-shift keying (QPSK) modulation.

<FIG> is a conceptual data flow diagram <NUM> illustrating data flow between different modules/means/components in an example apparatus <NUM>. The apparatus <NUM> may be a UE (e.g., UE <NUM>), a base station (e.g., base station <NUM>), and/or the like. In some aspects, the apparatus <NUM> includes a prepending module <NUM>, a generating module <NUM>, a removing module <NUM>, an encoding module <NUM>, and a transmitting module <NUM>.

In some aspects, prepending module <NUM> may prepend a fixed-value bit to an information bit vector that includes a plurality of information bits, generating module <NUM> may generate a Reed Muller generating matrix for the information bit vector with the fixed-value bit prepended to the information bit vector, encoding module <NUM> may encode, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword, and transmitting module <NUM> may transmit the codeword without transmitting a pilot signal or demodulation reference signal for the codeword. In some aspects, generating module <NUM> may generate a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits, removing module <NUM> may remove, from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix, encoding module <NUM> may encode the information bit vector using the modified Reed Muller generating matrix to form a codeword, and transmitting module <NUM> may transmit the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.

In some aspects, prepending module <NUM>, generating module <NUM>, removing module <NUM>, and encoding module <NUM> may each include a receive processor (e.g., receive processor <NUM>, receive processor <NUM>, and/or the like), a transmit processor (e.g., transmit processor <NUM>, transmit processor <NUM>, and/or the like), a controller/processor (e.g., controller/processor <NUM>, controller/processor <NUM>, and/or the like), a memory (e.g., memory <NUM>, memory <NUM>, and/or the like), and/or the like. In some aspects, transmitting module <NUM> may include an antenna (e.g., antenna <NUM>, antenna <NUM>, and/or the like), a MOD (e.g., MOD <NUM>, MOD <NUM>, and/or the like), a transmit processor (e.g., transmit processor <NUM>, transmit processor <NUM>, and/or the like), a Tx MIMO processor (e.g., Tx MIMO processor <NUM>, Tx MIMO processor <NUM>, and/or the like), a controller/processor (e.g., controller/processor <NUM>, controller/processor <NUM>, and/or the like), a memory (e.g., memory <NUM>, memory <NUM>, and/or the like), and/or the like.

The apparatus may include additional modules that perform each of the blocks of the algorithm in the aforementioned process <NUM> of <FIG>, process <NUM> of <FIG>, and/or the like. Each block in the aforementioned process <NUM> of <FIG>, process <NUM> of <FIG>, and/or the like may be performed by a module, and the apparatus may include one or more of those modules. The modules may be one or more hardware components specifically configured to carry out the stated processes/algorithm, implemented by a processor configured to perform the stated processes/algorithm, stored within a computer-readable medium for implementation by a processor, or some combination thereof.

<FIG> is a diagram <NUM> illustrating an example of a hardware implementation for an apparatus <NUM>' employing a processing system <NUM>. The apparatus <NUM>' may be a UE (e.g., UE <NUM>), a base station (e.g., base station <NUM>), and/or the like.

The processing system <NUM> may be implemented with a bus architecture, represented generally by the bus <NUM>. The bus <NUM> may include any number of interconnecting buses and bridges depending on the specific application of the processing system <NUM> and the overall design constraints. The bus <NUM> links together various circuits including one or more processors and/or hardware modules, represented by the processor <NUM>, the modules <NUM>, <NUM>, <NUM>, <NUM>, and <NUM>, and the computer-readable medium / memory <NUM>. The bus <NUM> may also link various other circuits such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art, and therefore will not be described any further.

The processing system <NUM> may be coupled to a transceiver <NUM>. The transceiver <NUM> is coupled to one or more antennas <NUM>. The transceiver <NUM> provides a means for communicating with various other apparatuses over a transmission medium. The transceiver <NUM> receives a signal from the one or more antennas <NUM>, extracts information from the received signal, and provides the extracted information to the processing system <NUM>. In addition, the transceiver <NUM> receives information from the processing system <NUM>, specifically the transmitting module <NUM>, and based at least in part on the received information, generates a signal to be applied to the one or more antennas <NUM>. The processing system <NUM> includes a processor <NUM> coupled to a computer-readable medium / memory <NUM>. The processor <NUM> is responsible for general processing, including the execution of software stored on the computer-readable medium / memory <NUM>. The software, when executed by the processor <NUM>, causes the processing system <NUM> to perform the various functions described herein for any particular apparatus. The computer-readable medium / memory <NUM> may also be used for storing data that is manipulated by the processor <NUM> when executing software. The processing system further includes at least one of the modules <NUM>, <NUM>, <NUM>, <NUM>, and <NUM>. The modules may be software modules running in the processor <NUM>, resident/stored in the computer readable medium / memory <NUM>, one or more hardware modules coupled to the processor <NUM>, or some combination thereof. In some aspects, the processing system <NUM> may be a component of the UE <NUM> and may include the memory <NUM> and/or at least one of the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM>. In some aspects, the processing system <NUM> may be a component of the base station <NUM> and may include the memory <NUM> and/or at least one of the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM>.

In some aspects, the apparatus <NUM>/<NUM>' for wireless communication includes means for generating a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits, means for removing, from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix, means for encoding the information bit vector using the modified Reed Muller generating matrix to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like In some aspects, the apparatus <NUM>/<NUM>' for wireless communication includes means for prepending a fixed-value bit to an information bit vector that includes a plurality of information bits, means for generating a Reed Muller generating matrix for the information bit vector with the fixed-value bit prepended to the information bit vector, means for encoding, using the Reed Muller generating matrix, the information bit vector with the fixed-value bit prepended to the information bit vector to form a codeword, means for transmitting the codeword without transmitting a pilot signal or demodulation reference signal for the codeword, and/or the like.

The aforementioned means may be one or more of the aforementioned modules of the apparatus <NUM> and/or the processing system <NUM> of the apparatus <NUM>' configured to perform the functions recited by the aforementioned means. As described elsewhere herein, the processing system <NUM> may include the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM>. In one configuration, the aforementioned means may be the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM> configured to perform the functions and/or operations recited herein. As described elsewhere herein, the processing system <NUM> may include the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM>. In one configuration, the aforementioned means may be the transmit processor <NUM>, the receive processor <NUM>, and/or the controller/processor <NUM> configured to perform the functions and/or operations recited herein.

As an example, "at least one of a, b, or c" is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c, as well as any combination with multiples of the same element (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b, b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b, and c).

Claim 1:
A method of wireless communication performed by a wireless communication device, comprising:
generating (<NUM>) a Reed Muller generating matrix for an information bit vector that includes a plurality of information bits;
removing (<NUM>), from the Reed Muller generating matrix, a row vector consisting of all <NUM>-values to form a modified Reed Muller generating matrix;
encoding (<NUM>) the information bit vector using the modified Reed Muller generating matrix to form a codeword; and
transmitting (<NUM>) the codeword without transmitting a pilot signal or demodulation reference signal for the codeword.