JP6998890B2 - Coding and decoding of control signaling with sectioned redundancy check - Google Patents

Description

Priority Claims Under Section 119 of the US Patent Act This application is incorporated herein by reference in its entirety, U.S. Provisional Patent Applications Nos. 62 / 344,031 and 2016, filed June 1, 2016. Claiming the priority and interests of US Provisional Patent Application No. 62 / 346,291 filed June 6, 2017, claiming the priority of US Patent Application No. 15 / 607,161 filed May 26, 2017. Is.

Some aspects of the techniques described below relate generally to wireless communication, and more particularly to methods and devices for convolution coding / tailbiting convolution coding with a sectional redundancy check.

In all modern wireless communication link transmitters, the bit sequence of output from the error correction code can be mapped to a sequence of complex modulation symbols. These symbols can then be used to create waveforms suitable for transmission over wireless channels. In particular, as the data rate increases, the decoding performance on the receiver side can be a limiting factor for the achievable data rate.

The following summarizes some aspects of the present disclosure to provide a basic understanding of the techniques described. This summary is not an extensive overview of all the intended features of this disclosure, nor does it identify any major or important element of any aspect of this disclosure, and is the scope of any or all aspects of this disclosure. It does not define. Its sole purpose is to present, in the form of a summary, some concepts of one or more aspects of the present disclosure as a prelude to a more detailed description presented later.

Some aspects of the present disclosure provide techniques and devices for convolution coding / tailbiting convolution coding with sectioned redundancy checks. The embodiments enable and provide fast and efficient coding techniques for error detection for the overall payload and additional error detection capability for sectioned payloads with sectioned redundancy checks. can. Sectional redundancy checks are intended to provide additional insights (to error symptoms) that allow coding / decoding for improved performance. A sectioned CRC, also known as a multiple CRC segment or a CRC multiple segment, allows for additional granularity to the CRC information, resulting in improved code block error rate performance and / or reduced decoding complexity. The technique provides a new coding structure configuration that allows the use of error symptom insights to improve decoding performance and / or reduce decoding complexity.

Some aspects provide a method for wireless communication. The methods generally include a step to get the payload to be sent, a step to divide the payload into multiple payload sections, a step to derive redundancy check information for each payload section of the multiple payload sections, and a bit. It involves merging the redundancy check information for each payload section with multiple payload sections to form a sequence, and generating code words by encoding the bit sequence using an encoder.

Some aspects provide a device for wireless communication. The device generally obtains the payload to be transmitted, divides the payload into multiple payload sections, derives redundancy inspection information for each payload section of the multiple payload sections, and bits. It is configured to merge redundant check information for each payload section with multiple payload sections to form a sequence, and to generate code words by encoding a bit sequence using an encoder. Includes at least one processor. The device also generally includes memory coupled with at least one processor.

Some aspects provide a device for wireless communication. The device generally derives means for obtaining the payload to be transmitted, means for partitioning the payload into multiple payload sections, and redundant inspection information for each payload section of the multiple payload sections. A means for merging redundant inspection information for each payload section with multiple payload sections to form a bit sequence, and a code word generated by encoding the bit sequence using an encoder. Including means for.

Some aspects provide a non-temporary computer readable medium for wireless communication. Non-temporary computer-readable media generally obtains the payload to be transmitted, divides the payload into multiple payload sections, and derives redundant inspection information for each payload section of the multiple payload sections. , Code for merging redundant inspection information for each payload section with multiple payload sections to form a bit sequence, and for generating code words by encoding the bit sequence using an encoder. And include.

Some aspects provide a method for wireless communication. The method generally involves receiving a codeword containing multiple payload sections, decoding multiple payload sections of the codeword, and each decrypted payload section of the multiple payload sections. Includes steps to validate based on the redundancy check information corresponding to the section.

Some aspects provide a device for wireless communication. A device generally receives a codeword containing multiple payload sections, decodes multiple payload sections of the codeword, and each decrypted payload section of the multiple payload sections has its decrypted payload. Includes at least one processor configured to perform validation based on the redundancy check information corresponding to the section.

Some aspects provide a device for wireless communication. The device generally includes a means for receiving a codeword containing multiple payload sections, a means for decoding multiple payload sections of the codeword, and each decrypted payload section of the multiple payload sections. Includes means for verification based on the redundant inspection information corresponding to the decrypted payload section.

Some aspects provide a non-temporary computer readable medium for wireless communication. Non-temporary computer-readable media generally receive a code word containing multiple payload sections, decode multiple payload sections of the code word, and each decrypted payload section of the multiple payload sections. Includes code for performing validation based on the redundancy check information corresponding to the decrypted payload section.

Techniques can be embodied in methods, devices, and computer program products. Other embodiments, features, and embodiments of the invention will be apparent to those skilled in the art by considering the following description of certain exemplary embodiments of the invention with the accompanying figures. The features of the invention may be described for some of the following embodiments and figures, but all embodiments of the invention are one or more of the advantageous features described herein. Can be included. In other words, one or more embodiments may be described as having some advantageous features, one or more of which are also described herein in the book. It can be used according to various embodiments of the invention. Similarly, exemplary embodiments may be described below as embodiments of devices, systems, or methods, but such exemplary embodiments are implemented in various devices, systems, and methods. Please understand what you get.

In order to understand the above-mentioned features of the present disclosure in detail, the contents schematically described above may be described more concretely by referring to the embodiment in which a part thereof is shown in the attached drawings. .. However, as this description may apply to other equally valid embodiments, the accompanying drawings show only some typical embodiments of the present disclosure and thus limit the scope of the present disclosure. Note that it should not be considered.

It is a figure which shows the exemplary wireless communication system by some aspect of this disclosure. FIG. 3 is a block diagram of an access point and a user terminal according to some aspects of the present disclosure. FIG. 3 is a block diagram of an exemplary wireless device according to some aspects of the present disclosure. It is a block diagram which shows the decoder by some aspects of this disclosure. It is a block diagram which shows the decoder by some aspects of this disclosure. It is a figure which shows an example of convolution coding. It is a figure which shows an example of the Viterbi algorithm for decoding a convolution-coded bit stream by some embodiments. It is a figure which shows an example of the coding by a tail biting convolution code (TBCC) by some embodiments. It is a figure which shows an example of the Viterbi algorithm for decoding a TBCC coded bit stream by some embodiments. FIG. 6 illustrates an exemplary iterative process of the Viterbi algorithm for decoding a TBCC coded bitstream, according to some embodiments. It is a figure which shows the exemplary operation for wireless communication by some aspect of this disclosure. It is a figure which shows the exemplary interleaving / coupling pattern for the redundancy inspection information by some aspect of this disclosure. It is a figure which shows the exemplary operation for wireless communication by some aspect of this disclosure. FIG. 3 illustrates an exemplary four-state CC / TBCC with a redundancy check according to some aspects of the present disclosure. FIG. 3 illustrates an exemplary four-state CC / TBCC with a redundancy check according to some aspects of the present disclosure. FIG. 5 shows an encoder configured to perform extended TBCC list decoding according to aspects of the present disclosure. FIG. 3 shows a decoder configured to perform extended TBCC list decoding according to aspects of the present disclosure.

Aspects of the present disclosure provide a new coding structure. The structure provides and enables improved decryption performance and / or reduced decryption complexity using error symptom insights. This can occur, for example, by dividing the payload into multiple sections and deriving redundancy check information for each of the sections. Without changing the total number of redundancy check bits and payload bits, aspects of the present disclosure provide techniques to provide additional insight into decoding error symptoms. In doing so, certain advanced measures can achieve improved code block error rate performance and / or reduced decryption complexity while remaining unaffected by the total false positive rate. By enabling, improved encoder / decoder designs and techniques are obtained.

Illustrative Wireless Communication Systems The techniques described herein include frequency division multiple access (OFDM) networks, time division multiple access (TDMA) networks, frequency division multiple access (FDMA) networks, orthogonal FDMA (OFDMA) networks, and singles. It can be used for various wireless communication networks such as carrier FDMA (SC-FDMA) networks and code division multiple access (CDMA) networks. The terms "network" and "system" are often used interchangeably. CDMA networks may implement wireless technologies such as Universal Terrestrial Radio Access (UTRA) and CDMA2000. UTRA includes wideband CDMA (W-CDMA) and low chip rate (LCR). CDMA2000 covers the IS-2000, IS-95, and IS-856 standards. The TDMA network may implement wireless technologies such as the Global System for Mobile Communications (GSM®). OFDMA networks include advanced UTRA (E-UTRA), IEEE802.11, IEEE802.16 (eg WiMAX (Worldwide Interoperability for Microwave Access)), IEEE802.20, Flash-OFDM®, etc. Wireless technology may be implemented. UTRA, E-UTRA, and GSM® are part of the Universal Mobile Telecommunications System (UMTS). Long Term Evolution (LTE) and Long Term Evolution Advanced (LTE-A) are the upcoming releases of UMTS using E-UTRA. UTRA, E-UTRA, GSM®, UMTS, and LTE are described in a document from an organization named "3rd Generation Partnership Project" (3GPP). CDMA2000 is described in a document from an organization named "3rd Generation Partnership Project 2" (3GPP2). CDMA2000 is described in a document from an organization named "3rd Generation Partnership Project 2" (3GPP2). These various radio technologies and standards are known in the art. For clarity, some aspects of this technique are described below for LTE and LTE-A.

The teachings herein may be incorporated into various wired or wireless devices (eg, nodes) (eg, may be implemented within or performed by the device). In some embodiments, the node comprises a wireless node. Such wireless nodes may provide connectivity or connectivity to a network (eg, a wide area network such as the Internet or a cellular network) over a wired or wireless communication link, for example. In some embodiments, the wireless node implemented according to the teachings herein may include an access point or access terminal.

Access points (“AP”) are node B, wireless network controller (“RNC”), e-node B, base station controller (“BSC”), base transceiver station (“BTS”), base station (“BS”). , Transceiver function (“TF”), radio router, radio transceiver, basic service set (“BSS”), extended service set (“ESS”), radio base station (“RBS”), or any other term. , Realized as them, or may be known as either of them. In some implementations, the access point may include a set-top box kiosk, a media center, or any other suitable device configured to communicate over wireless or wired media.

An access terminal (“AT”) is an access terminal, subscriber station, subscriber unit, mobile station, remote station, remote terminal, user terminal, user agent, user device, user device, user station, or any other term. May include, be realized as them, or are known as them. In some embodiments, the access terminal is a cellular phone, cordless phone, session initiation protocol ("SIP") phone, wireless local loop ("WLL") station, mobile information terminal ("PDA"), wireless connection function. It may be equipped with a handheld device, a station (“STA”), or any other suitable processing device connected to a wireless modem. Accordingly, one or more aspects taught herein are telephones (eg, cellular phones or smartphones), computers (eg, laptops), portable communication devices, portable computing devices (eg, personal digital assistants), and more. Tablets, entertainment devices (eg music or video devices, or satellite radios), television displays, flip cams, security video cameras, digital video recorders (DVRs), global positioning system devices, sensors, industrial equipment, medical devices Incorporated into portable devices, wearables, mammalian transplant devices, vehicles or vehicle components, drones, Internet of Things devices, or any other suitable device configured to communicate over wireless or wired media. obtain.

Referring to FIG. 1, one aspect of a multiple access wireless communication system is shown. In one aspect of the present disclosure, the wireless communication system from FIG. 1 can be a wireless mobile broadband system based on Orthogonal Frequency Division Multiplexing (OFDM). The access point 100 (AP) can contain multiple antenna groups, one antenna group contains antennas 104 and 106, another antenna group contains antennas 108 and 110, and another antenna group contains antennas 112 and 114. include. In Figure 1, only two antennas are shown for each antenna group, but more or less antennas may be used for each antenna group. The access terminal 116 (AT) may be communicating with the antennas 112 and 114, which transmit information to the access terminal 116 via the forward link 120 and access via the reverse link 118. Receive information from terminal 116. The access terminal 122 may be communicating with the antennas 106 and 108, which transmit information to the access terminal 122 via the forward link 126 and from the access terminal 122 via the reverse link 124. Receive information. In FDD systems, communication links 118, 120, 124, and 126 can use different frequencies for communication. For example, the forward link 120 may use a different frequency than that used by the reverse link 118.

Each group of antennas and / or areas designed to communicate with them are often referred to as access point sectors. In one aspect of the disclosure, each antenna group may be designed to communicate with an access terminal within a sector of the area covered by the access point 100.

For communication over forward links 120 and 126, the transmit antenna of access point 100 may utilize beamforming to improve the signal-to-noise ratio of forward links for different access terminals 116 and 122. can. Also, by using beamforming to send to randomly distributed access terminals through its coverage, the access point is more adjacent than it sends to all its access terminals through a single antenna. Interference with the access terminal in the cell is reduced.

FIG. 2 shows a wireless communication system, eg, a transmitter system 210 (also known as an access point / base station) and a receiver system 250 (eg, as an access terminal) in MIMO system 200 in which aspects of the present disclosure can be performed. Also known), a block diagram of one aspect is shown. In the transmitter system 210, traffic data for some data streams is supplied from the data source 212 to the transmit (TX) data processor 214.

In one aspect of the present disclosure, each data stream can be transmitted via its own transmit antenna. The TX data processor 214 formats, codes, interleaves, and provides the coded data for the traffic data in each data stream based on the particular coding scheme selected for that data stream.

The coded data per data stream can be multiplexed with pilot data using OFDM techniques. Pilot data is a known data pattern that is generally processed in a known manner and can be used in the receiver system to estimate the channel response. The multiplexing pilot and coded data per data stream are then given a particular modulation scheme (eg, BPSK, QPSK, m-QPSK, or m-) selected for that data stream to provide the modulation symbol. Modulated (ie, symbol mapping) based on QAM). The data rate, coding, and modulation for each data stream can be determined by instructions executed by processor 230.

Modulation symbols for all data streams are then provided to the TX MIMO processor 220, which can further process the modulation symbols (for example, for OFDM). The TX MIMO processor 220 then provides N _T modulation symbol streams to N _T transmitters (TMTRs) 222a-222t. In some aspects of the disclosure, the TX MIMO processor 220 applies beamforming weights to the symbol of the data stream and to the antenna at which the symbol originates.

Each transmitter 222 receives and processes its own symbol stream to supply one or more analog signals and further tunes (eg, amplifies, filters, and upconverts) the analog signals to create a MIMO channel. It supplies a modulated signal suitable for transmission via. Next, the N _T modulated signals from the transmitters 222a to 222t are transmitted from the _NT antennas 224a to 224t, respectively.

In the receiver system 250, the transmitted modulated signal may be received by N _R antennas 252a-252r, and the received signal from each antenna 252 may be provided to the respective receiver (RCVR) 254a-254r. .. Each receiver 254 tunes (eg, filters, amplifies, and downconverts) its received signal, digitizes the tuned signal, gives a sample, and processes those samples to accommodate them. May give a "receive" symbol stream.

The RX data processor 260 then receives N _{R of received symbol streams from N R of} receivers 254 and processes them according to receiver processing techniques to produce N _T of "decrypted" symbol streams. offer. The RX data processor 260 then demodulates, deinterleaves, and decodes each detected symbol stream to restore the traffic data in the data stream. The processing by the RX data processor 260 may complement the processing performed by the TX MIMO processor 220 and the TX data processor 214 in the transmitter system 210.

Processor 270 periodically determines which precoding matrix should be used. Processor 270 creates a reverse link message with a matrix index section and a rank value section. The reverse link message may contain various types of information about the communication link and / or the received data stream. The reverse link message is then processed by the TX data processor 238, which also receives traffic data from several data streams from the data source 236, modulated by the modulator 280, tuned by the transmitters 254a-254r, and the transmitter system. It will be sent back to 210.

In the transmitter system 210, the modulated signal from the receiver system 250 is received by the antenna 224, tuned by the receiver 222, demodulated by the demodulator 240, processed by the RX data processor 242, and processed by the receiver system 250. Extract the reverse link message sent by. Processor 230 then determines which precoding matrix should be used to determine the beamforming weights, and then processes the extracted message.

FIG. 3 shows various components that may be used in the wireless device 302 that may be utilized within the wireless communication system 1 of FIG. The wireless device 302 is an example of a device that may be configured to perform the various methods described herein. For example, in some cases, as described in more detail below, a wireless communication device may obtain a payload to be transmitted, divide the payload into multiple payload sections, and each of the sections. Codewords are derived by deriving the redundancy check information for a section, merging the redundancy check information for each section with multiple sections to form a bit sequence, and encoding the bit sequence using an encoder. It can be configured to do what it produces. In other cases, as described in more detail below, wireless devices typically receive a codeword containing multiple payload sections, decode multiple payload sections of the codeword, and multiple. Each decrypted payload section of the payload section may be configured to validate based on the redundancy check information corresponding to the decrypted payload section. According to some embodiments, the wireless device 302 can be either the access point 100 from FIG. 1 or the access terminals 116, 122.

The wireless device 302 may include a processor 304 that controls the operation of the wireless device 302. Processor 304 may also be referred to as a central processing unit (CPU). Memory 306, which can include both read-only memory (ROM) and random access memory (RAM), provides instructions and data to processor 304. A portion of memory 306 may include non-volatile random access memory (NVRAM). The processor 304 generally executes a logical operation and an arithmetic operation based on a program instruction stored in the memory 306. The instructions in memory 306 may be executable to implement the methods described herein.

The wireless device 302 may also include a housing 308 which may include a transmitter 310 and a receiver 312 to allow transmission and reception of data between the wireless device 302 and a remote location. The transmitter 310 and receiver 312 may be combined with the transceiver 314. A single or multiple transmit antennas 316 may be attached to the housing 308 and may be electrically coupled to the transceiver 314. The wireless device 302 may also include multiple transmitters, multiple receivers, and multiple transceivers (not shown).

The wireless device 302 may also include a signal detector 318 that may be used to detect and quantify the level of the signal received by the transceiver 314. The signal detector 318 can detect signals such as total energy, energy per subcarrier per symbol, power spectral density and other signals. The wireless device 302 may also include a digital signal processor (DSP) 320 for use in processing the signal.

In addition, the wireless device may also include an encoder 322 for use in encoding the signal for transmission and a decoder 324 for use in decoding the received signal. According to some embodiments, the encoder 322 may perform coding according to some embodiments presented herein (eg, by performing operation 1100 shown in FIG. 11). The additional details of the encoder 322 are described in more detail below. According to some embodiments, the decoder 324 may perform decoding according to some embodiments presented herein (eg, by performing operation 1300 shown in FIG. 11). The additional details of the decoder 324 are described in more detail below.

Various components of the wireless device 302 can be coupled together by a bus system 326, which can include a power bus, a control signal bus, and a status signal bus in addition to the data bus. Processor 304 may be configured to access instructions stored in memory 306 in order to perform connectionless access in accordance with aspects of the present disclosure discussed below.

FIG. 4 shows a portion of a radio frequency (RF) modem 404 that can be configured to provide a coded message for wireless transmission. In one example, the encoder 406 in a base station (eg, AP100 and / or 210) (or an access terminal on a reverse path, such as 116 and / or 250) receives message 402 for transmission. Message 402 may include data and / or coded audio or other content for the receiving device. Encoder 406, which may correspond to encoder 322 of wireless device 302, is generally the appropriate modulation and coding scheme (MCS) selected based on the configuration specified by base station 100/210 or another network entity. ) To encode the message.

In some cases, the encoder 406 may encode the message using the techniques described below (eg, by performing operation 1100 shown in FIG. 11). For example, in some cases, as described in more detail below, the encoder 406 gets the payload to be transmitted, divides the payload into multiple payload sections, and provides redundancy check information for each section of the multiple sections. A code word (eg, a coded bitstream 408) may be generated by deriving and merging the redundancy check information for each section with multiple sections to form a bit sequence and encoding the bit sequence. ..

According to the embodiment, the coded bitstream 408 generated by the encoder 406 is then fed to the mapper 410 which produces the sequence of the Tx symbol 412, which is modulated, amplified and otherwise by the Tx chain 414. It can be processed to generate an RF signal 416 for transmission through the antenna 418.

Figure 5 shows an RF modem 510 that can be configured to receive and decode signals transmitted wirelessly, including coded messages (eg, messages encoded using the tailbiting convolution code described below). Shows a part of. In various examples, the modem 510 that receives the signal may be present at the access terminal, at the base station, or at any other suitable device or means for performing the functions described. The antenna 502 supplies the access terminal (eg, access terminals 116, 122 and / or 250) with an RF signal 416 (ie, the RF signal generated in FIG. 4). The RF chain 506 can process and demodulate the RF signal 416 and provide a sequence of symbols 508 to the demapper 512, which produces a bitstream 514 representing a coded message.

The decoder 516, which may correspond to the decoder 324 of the wireless device 302, then m-bits from a bitstream encoded using a coding scheme (eg, TBCC coding scheme, Polar code coding scheme, etc.). Can be used to decrypt the information string of. The decoder 516 may include a Viterbi decoder, an algebraic decoder, a butterfly decoder, or another suitable decoder. In one example, the Viterbi decoder uses a known Viterbi algorithm to find the sequence of signaling states (Viterbi path) that is most likely to correspond to the received bitstream 514. Bitstream 514 can be decoded based on LLR statistical analysis calculated for bitstream 514. In one example, the Viterbi decoder can compare and select the exact Viterbi pathway that defines the sequence of signaling states using the likelihood ratio test to generate the LLR from the bitstream 514. The likelihood ratio of the likelihood ratio (eg, LLR) for each candidate Viterbi route is used to determine which route is most likely to reveal the sequence of symbols that produced the bitstream 514. Likelihood ratio tests that compare logarithms can be used to statistically compare multiple candidate Viterbi pathways. The decoder 516 then bitstreams based on the LLR to determine message 518 containing data and / or coded audio or other content transmitted from the base station (eg AP100 and / or 210). 514 can be decrypted. The decoder may decode the bitstream 514 according to the aspects of the present disclosure presented below (eg, by performing operation 1300 shown in FIG. 13). For example, in some cases, the decoder receives a codeword containing multiple sections, decodes the multiple sections of the codeword, and each of the multiple sections based on the redundancy check information corresponding to the decoded section. The decrypted section may be verified.

According to some embodiments, the convolution coding algorithm can be used to encode a stream of bits (eg, described with respect to FIG. 4) to generate a coded word. FIG. 6 shows an example of convolution coding in which a stream of information bits is encoded. As shown, coding starts with a known bit sequence (eg, 000 in this example), and each coded bit can be generated as a function of the previous bit. The same known bit sequence is added at the end, as shown in FIG.

As shown in FIG. 7, the encoded codeword can be decoded using the trellis structure. In a trellis structure, each stage in the trellis has one of several states (eg, eight states if each bit is encoded based on the previous 3 bits). Each transition from one state to the other is a function of the previous bit, and the "new" payload bit is encoded. In the illustrated example, the first bit is "1", so the transition is from the state "000" in the first stage to the state "001" in the second stage (then the second stage). The "001" state in the stage is up to "011" in the third stage, and so on. Therefore, there are only a finite number of valid decoding paths through the trellis. This is because the validity of the decoding path is a function of the bits used for coding (ie, the previous bit and the "new" bit to be coded). Figure 7 shows a trellis structure with eight states, which can have any number of states depending on how many "previous bits" are used to encode the "new" payload bit. Please understand that it may be included.

As described above and shown in FIG. 7, both start and end states are known and are facts that can be utilized during decoding (eg, a decoding path through a trellis that does not start and end in a known state). Can all be considered ineligible). For example, referring to Figure 7, assuming that the start state is known to be [000] (for example, as shown), all decryption paths that do not end in the end state of [000] are automatic. Can be considered ineligible. For example, a decryption path with a start state of [000] and an end state of [111] can be considered ineligible.

Figure 8 shows an example of encoding a stream of bits using a tailbiting convolution code (TBCC). The TBCC algorithm is so named because the "tail" end of the bit is attached to the beginning of the coded bitstream, for example as shown. Therefore, in this case, the start and end states are the same (as in Figure 7), but the state is not fixed (rather, it depends on the value of the tail bit). In the illustrated example, the value of the tail bit (and therefore the start and end states) is "010". Therefore, as shown by the solid line in FIG. 9, since the first bit is "1", the transition is from the start state "010" in the first stage to the state "101" in the second stage (). Then, the "101" state in the second stage is up to "011" in the third stage, and so on. Using the TBCC decoding trellis, any decoding path that does not start and end in the same state (although initially unknown) can be considered ineligible, as shown in Figure 9. For example, again assume that the start state is "010". However, in this example shown by the solid line in FIG. 9, the start state (ie, "010") does not match the end state (eg, "001"). Therefore, this decoding path can be considered ineligible.

As shown in Figure 10, one algorithm for decoding a TBCC-coded codeword goes through a series of iterations. For example, in the first iteration, the decoder (eg, decoders 324 and / or 516) may start building a decryption trellis with each state starting with equal weights. At the end of the trellis build (eg, after the last iteration), the decoders 324 and / or 516 identify the number of best states and then perform a backtrace output over a range of steps for the decode bits. The decoding path can be selected based on the metrics generated during these iterations (eg, path metrics, tailbyte checking, etc.) to derive the decoding bits.

Illustrative Polar Codes As mentioned above, Polar codes can be used to encode a stream of bits for transmission. Polar code is a first demonstrably capacity-achieving coding scheme with near-linear coding and decoding complexity (within block length). Polar code is widely considered as a candidate for error correction in next-generation wireless systems. Polar code has many desirable properties, such as deterministic configurations (for example, based on the fast Hadamard transform), very low and predictable error floors, and simple continuous elimination (SC) based decoding. Have.

The Polar code is a linear block code of length N = 2 ⁿ , and their generator matrix is a matrix.

Constructed using the nth power of Kronecker, marked by G ⁿ . For example, equation (1) shows the generator matrix obtained for n = 3.

According to some embodiments, the codeword can be generated (eg, by BS) by using a generator matrix to encode some input bits (eg, information bits). For example, given some bits u = (u ₀ , u ₁ , ..., u _N-1 ), the resulting codeword vector x = (x ₀ , x ₁ , ..., x _{N- 1} ) can be generated by encoding the input bits using the generator matrix G. The resulting codeword can then be rate matched (eg, using the techniques described herein), transmitted by the base station via a wireless modem, and received by the UE.

Bit u ₀ ^i-1 when the received vector is decoded (eg, by the UE) using a decoder such as a serial erase (SC) decoder or a serial erase list (SCL) decoder (eg, decoder 516). All estimated bits, u _i , have a given error probability, assuming that is correctly decoded and it tends to be 0 or 0.5. Moreover, the ratio of the estimated bit to the low error probability tends to be the capacity of the underlying channel. The Polar code sends information using the most reliable K bits, for example, as described below, while setting or freezing the remaining (NK) bits to a given value, such as 0. Utilizes a phenomenon called channel polarization.

For very large N, the Polar code translates the channel into N parallel "virtual" channels for N information bits. When C is the capacity of the channel, there are almost N * C channels that are completely noisy, and there are N (1-C) channels that are completely noisy. The basic polar coding scheme is then to freeze (ie, not transmit) the information bits that should be transmitted along a completely noisy channel, and to transmit information only along a complete channel. Accompany. For small to moderate N, this polarization is not perfect in the sense that there may be some channels (ie, transitioning channels) that are neither completely useless nor noiseless. Depending on the percentage of the transition, these channels during the transition are either frozen or used for transmission.

Illustrative Coding and Decoding of Control Signaling with Sectional Redundancy Checks Use Convolution Coding (CC) and / or Tail Biting Convolution Coding (TBCC) to encode a stream of control signaling bits for transmission. In legacy communication standards, Cyclic Redundancy Check (CRC) is generally a pre-encoded control to help detect errors in the decoded payload corresponding to the stream of pre-encoded control signaling bits. Included in the stream of signaling bits. For example, given a stream of pre-encoded bits, the CRC can be calculated based on the stream of pre-encoded bits known as the global CRC and attached to the end of the stream of pre-encoded bits. A stream of pre-encoded bits containing a global CRC is then followed by a specific coding scheme (eg, Low Density Parity Check (LDPC), Polar Code, Tail Biting Convolution Code (TBCC), Convolution Code (CC), etc.) and It can be encoded using the transmitted coding code word. On the receiving end, the receiver receives the codeword, decodes it (eg, according to the specific coding scheme used to encode the codeword), and the codeword is based on the contained CRC. It can be checked for proper decryption.

N-bit cyclic redundancy checks can naturally give the expected false positive rate at 2 ^ -N. However, other than the decryption error detection provided by the global CRC (ie, one CRC for the payload) (for block retransmissions in the hybrid automated repeat request (H-ARQ) process, for example), legacy techniques. Accidentally decrypted the same number of "E" s, sparsely distributed throughout the decrypted codeword, with "E" erroneously decoded bits limited to a particular section of the codeword. It cannot give additional insight into the error symptoms of transmission, such as showing it as a bit in opposition.

Thus, without changing the total number of redundancy check bits and payload bits, aspects of the present disclosure are such that certain advanced measures (eg, trellis path pruning) are not affected by the total false positive rate. Improved code block error rate To provide additional insight into the decoding error symptom of control signaling, which may provide convenience to the decoder by making it possible to achieve performance and / or reduced decoding complexity. Present the technique. That is, an aspect of the present disclosure is, for example, decoding performance by partitioning a payload (eg, control signaling, data, etc.) into multiple payload sections and deriving redundancy check information for each of the control signaling payload sections. Provides a new code structure that can be improved and / or reduced in decryption complexity with the use of error symptom insights.

FIG. 11 shows an exemplary operation 1100 for wireless communication to improve decoding performance and / or reduce decoding complexity. These techniques can be applied to wireless transmissions such as control signaling and / or data signaling in various scenarios as needed. According to some embodiments, the operation 1100 is performed by any suitable wireless transmitting device such as a base station (eg AP100, 210), a user terminal (eg AT116, 250), and / or a wireless device 302. obtain. Operation 1100 is shown for illustration purposes, but may be ordered or augmented in various ways as needed.

Various implementation configurations can be used to implement operation 1100. For example, a wireless transmitting device may include one or more components as shown in FIGS. 2 and 3. These components may be configured to perform the operations described herein. For example, the antenna 224, receiver / transmitter 222, TX data processor 214, processor 230, and / or memory 232 of the access point 210 shown in FIG. 2 may perform the operations described herein. As an addition or alternative, the antenna 252, receiver / transmitter 254, TX data processor 238, modulator 280, processor 270, and / or memory 272 of the access terminal 250 shown in FIG. 2 operate as described herein. Can be done. As an addition or alternative, one or more of the processor 304, memory 306, transceiver 314, DSP320, encoder 322, decoder 324, and / or antenna 316 shown in FIG. 3 performs the operations described herein. Can be configured as

In general, operation 1100 represents a set of actions for efficient wireless communication. Operation 1100 begins with getting the payload to be sent at 1102. In 1104, the wireless transmit device can divide the payload into multiple payload sections. Separation can involve segmenting one structure of information into sections, and the number and size of sections may vary as required. In 1106, the wireless transmitting device derives redundancy check information for each payload section of the plurality of payload sections. In 1108, the wireless transmission device merges the redundancy check information associated with each payload section or for each payload section with multiple payload sections. By merging them, a bit sequence representing the aggregated merged redundancy check information can be generated. Also, merging may include combining bits in various ways as needed, so that the final result obtained represents the information entered in the merge function. In 1110, the wireless transmitting device generates a codeword by encoding a bit sequence using an encoder. Although not shown, operation 1100 may also include a wireless transmitting device that transmits a codeword to a wireless receiving device for decryption.

Separation as described above can occur in a variety of ways. As mentioned above, the payload (which does not always contain CRC / parity information) can initially be segmented into N payload sections by the wireless transmitting device. N payload sections can vary and vary in size, range, detail, priority, importance, ranking, and so on. By partitioning, a series of information for forming the "P" (ie, payload) sequence {P0, P1, ..., PN-1} can be obtained. In some current preferred embodiments, the payload may include control information bits / signaling. In still other embodiments, the payload may include other types of signaling or data as needed. In short, embodiments provide a flexible configuration for length and location for a sectioned CRC that allows dynamic and on-the-fly adjustments in the desired scenario.

The partitioned information bits can be used as the basis for deriving error correction or redundancy check information. Derivation can generally involve using information bits (ie, one set of information) in some way to create or retrieve other information (ie, another second set of information). According to some embodiments, each payload section can then be used by the wireless transmission device to independently derive the redundancy check information corresponding to that payload section. According to some embodiments, the redundancy check information is a wireless receiving device during decoding to determine if a section of codeword is properly decoded, for example, as described in more detail below. For example, it can be used by a separate wireless device 302).

In some cases, the redundancy check information may include an error detection code. This can be included as a "sectioned" CRC, also known as a sectioned decoded redundancy check (SDRC). In other cases, the redundancy check information may include one or more parity bits, for example, as described in more detail below. In other cases, the redundancy check information is most likely one or more through the trellis stage of the list decoder, known as the Sectional in-trellis redundancy check (SITRC). / May contain information available by the list decoder to determine the exact decoding path.

According to some embodiments, the wireless transmission device may derive redundancy check information. This is an independent method (eg, section) corresponding to each section of the P sequence to form the "C" (eg CRC) sequence {C0, C1, ..., CN-1} of the redundancy check information. It can be executed with the expression CRC, parity bit information, etc.). According to aspects, the redundancy check information derived for each section may contain one or more bits and may be of equal or unequal length. That is, in some cases, the redundancy check information derived for the first section (eg, P0) has the same number of bits as the redundancy check information derived for the second section (eg, P1). It may contain or may contain a different number of bits.

In addition, in some cases, the wireless transmit device may derive a global CRC for the full payload, for example as shown in FIG. The global CRC may cover each section of the multi-sectional payload (ie, P sequence). The global CRC can be included within the C sequence according to some embodiments. In some cases, the global CRC can be derived from a multi-section payload combined with a section CRC.

In addition, according to some embodiments, other variants of the sectioned redundancy check information are possible. For example, in some cases, the sectioned coverage of redundancy check information is such that {C0} in the C sequence covers {P0} in the P sequence, C1 in the C sequence covers {P0, P1} in the P sequence, and so on. It can be defined to be similar.

Moreover, in some cases, deriving redundancy check information can be performed for any number of "X" s in the payload section. For example, according to a determined rate and specific type of traffic or desired reliability of traffic. For example, for ultra-reliable low-latency communications (URLLC) and / or mission-critical (MiCr) type traffic, for example, more than Internet browsing-related traffic (for example, payload reliability). It is desirable to have redundant check information that is frequently derived (to ensure) and inserted into the URLLC / MiCr payload. Thus, the wireless transmit device may determine the rate for deriving / inserting redundancy check information within a section of the payload, for example based on the type of traffic or the desired reliability of the traffic / payload. In some examples, it is desirable to omit or not utilize the CRC segment information.

According to some embodiments, there are many advantages to using the techniques described herein. For example, the advantage of having sectioned redundancy check information used in the scheme described above (eg, covering the corresponding section of the payload) is wireless (eg, receiving a codeword containing sectioned redundancy check information). The decoder of the receiving device is able to determine if the individual sections of the codeword have been correctly received / decoded. It can only determine that the codeword contains only a single 16-bit global CRC and the decoder incorrectly received / decoded the entire payload when the global CRC failed. It is the opposite of other cases. Knowledge of whether a particular section of codeword was improperly received / recoded accordingly is that the wireless receiving device sends a request to the wireless sending device to retransmit a particular section of codeword. It may be possible to do. In addition, the sectioned redundancy check information allows the decoder to optionally perform additional processing / handling based on its knowledge of passing / failing several sections of the payload.

According to some embodiments, the wireless transmit device can be payload sectioned (eg, P-sequence) and sectioned and applicable by applying merge functions with bit sequence configurations such as insert, interleaving, and concatenation. If so, a bit sequence containing global redundancy check information (eg, C sequence) can be derived. Other merge functions can also be used as needed to carry out the creation of representative merged CRC information.

According to some embodiments, merging (eg, interleaving / concatenating / inserting) can be performed according to one or more different patterns. For example, as shown in 1202, the first section P0 of the payload is concatenated with the corresponding sectioned redundancy check information (eg C ₀ ) for the first section of the payload to form a new sequence. The first section of the payload and its corresponding sectioned redundancy check information may then be the second section of the payload (eg P ₁ ) and its corresponding sectioned redundancy check information (eg C ₁ ). ) May be concatenated, and so on. In some cases (eg, in 1206), the global redundancy check information section (eg, global CRC) may be concatenated at the end of this new sequence.

According to the embodiment, the size of the CRC information can change, and therefore, as an example, the size of the sectioned redundancy check information may also change. In some cases, this variation in size may be based on whether a global redundancy check information section is included. For example, in the case of a global redundancy check information section, the sectioned redundancy check information (eg C ₀ and C ₁ ) may contain more bits if the global redundancy check information section is included. Further, in some cases, the size of each redundancy check information section may vary from section to section. For example, in some cases, C ₀ may be greater than or less than C ₁ (ie, it may contain more or less bits). In addition, in some cases, the size of the redundancy check information section corresponding to the section of the payload may be zero (for example, this section of the payload has no redundancy check information).

In some cases, the interleaving / concatenation pattern may be pre-defined for the merge sequence. This can include scenarios where the corresponding sectioned redundancy check information does not follow immediately after the payload section (eg, C ₀ does not follow immediately after P ₀ ). Interleaving / concatenation patterns can be advantageous in some cases, as a single error symptom can affect up to K consecutive bits in the receiver. Therefore, it may be advantageous to separate P ₀ and its corresponding C ₀ so that a single error symptom does not span both P ₀ and C ₀ .

In some cases, the payload section can be dealt with in various ways to form a new or merged sequence. For example, each section of the payload may be concatenated together to form a sectioned payload section (eg, P ₀ to P _N-1 ), and the sectioned redundancy check information for each section is the sectioned payload section. It may be concatenated at the end of. For example, as shown in 1204, this shows the resulting merge sequence formed from the individualized treatment of sections. In some cases (eg at 1208), the global CRC may be concatenated at the end of this new sequence.

With respect to interleaving / concatenated patterns (eg, as described above), some selection of patterns can produce a separation in the sequence between P _k and C _k for a given k. This separation may be essential for redundant check information error detection due to the relationship between the code constraint length and the typical bit length of one single error symptom. In other words, the interleaving / concatenation pattern may be based on the relationship between the code constraint length and the defined error symptom bit length. For example, the TBCC constraint length may have the property that a single error event does not extend beyond the decode bit constraint length. This is because the decoder's linear feedback shift register memory can be "flashed out" for that single error that exceeds the constraint length. Therefore, in some cases, redundancy check information of size "C" (eg, CRC) can guarantee the detection of one or more decoding errors that do not exceed the "C" bits in total. However, in some cases, error detection is not guaranteed for errors that exceed the "C" bit in total.

The number of bits used for sectioned redundancy check information (eg, sectioned CRC) can be the same in some configurations as in legacy cases. This may include, for example, the case of having only a global CRC and no sectioned CRC. For example, in legacy cases, the global CRC can contain 16 bits. Here, for the exemplary concatenation shown in 1208, assuming that the number of sections for the pre-encoded data or CRC is 2 (ie, 2 sections), then the two section expression CRC (eg C ₀ , C ₁ ) may contain 6 bits and a single global CRC (eg CRC _Global ) may contain 4 bits. Therefore, the total number of bits used for a section expression / global CRC is still 16 bits.

According to some embodiments, the resulting merged sequence of bits (ie, the merged P and C sequences) is then subjected to a wireless transmission device using an encoder (eg, the encoder shown in Figure 5). It can be encoded into one single codeword. According to aspects, the encoders are merged using a convolution code (CC) coding method, a tailbiting convolution code (TBCC) coding method, or any other suitable coding method (eg Polar code). The bit sequence can be encoded.

The codeword can then be transmitted by the wireless transmitting device over the wireless medium and received by the wireless receiving device for decryption, eg, as described below.

FIG. 13 illustrates an exemplary operation 1300 for wireless communication according to some aspects of the present disclosure, eg, for improving decoding performance and / or reducing decoding complexity. According to some embodiments, the operation 1300 is performed by any suitable wireless receiving device, such as a base station (eg AP100, 210), an access terminal (eg AT116, 250), and / or a wireless device 302. obtain.

The wireless receiving device may include one or more components shown in FIGS. 2 and 3, which may be configured to perform the operations described herein. For example, the antenna 224, receiver / transmitter 222, TX data processor 214, processor 230, and / or memory 232 of the access point 210 shown in FIG. 2 may perform the operations described herein. As an addition or alternative, the antenna 252, receiver / transmitter 254, TX data processor 238, modulator 280, processor 270, and / or memory 272 of the access terminal 250 shown in FIG. 2 operate as described herein. Can be done. As an addition or alternative, one or more of the processor 304, memory 306, transceiver 314, DSP320, encoder 322, decoder 324, and / or antenna 316 shown in FIG. 3 performs the operations described herein. Can be configured as

According to some embodiments, the motion 1300 may complement the motion 1100. For example, operation 1100 may be performed by a wireless transmitting device to generate (and transmit) codeword, and operation 1300 may be performed by a wireless receiving device to receive and decode codeword.

Operation 1300 begins at 1302 by receiving a codeword containing multiple payload sections. At 1304, the wireless receiving device decodes multiple payload sections of codeword. In 1306, the wireless receiving device validates each decrypted payload section of the plurality of payload sections based on the redundancy check information corresponding to the decrypted payload section.

As mentioned above, the redundancy check information may include error correction code such as sectioned CRC derived for different sections of the payload. According to some embodiments, the wireless receiving device decodes a received codeword containing multiple sections, and each section of the decoded codeword is correctly decoded based on the sectioned CRC for each section. Can be verified. In addition, in some cases, the wireless receiving device may validate the decrypted codeword based on the global CRC contained within the codeword.

As mentioned above, in some cases, the redundancy check information includes parity information (eg, a single parity bit). This information can be derived from at least one of state information or route information. The state or route information can be based on the trellis stage of the list decoder in the wireless receiving device.

In some cases, the wireless receiving device may decode the received codeword based on a technique called sectioned intrellis redundancy check (SITRC), where the SITRC goes through the trellis stage of the wrist decoder in the wireless receiving device. Use the information in the codeword (ie, redundancy check information) to determine one or more of the most probable / accurate decryption paths in the codeword section.

According to some embodiments, generating a codeword with redundant check information including SITRC information can be similar to generating a codeword with SDRC information (ie, sectioned CRC). One difference is that the sectioned CRC is a sectioned path or state-derived logic for each section of the codeword (ie, information for determining one or more of the most probable / accurate decoding paths). Can be replaced with. In other words, the redundancy check information for the SITRC may include a sectioned path or state derivation logic for each section of the codeword.

FIG. 14 shows four states of CC / TBCC with SITRC derived from the final memory state, according to some aspects of the present disclosure. For example, as shown in Figure 14, SITRC lists for the first section during decryption of a section of codeword, for example, as shown in 1402 (eg, by using the decryption technique described above). It may involve a wireless receiving device that determines the list of possible decoding paths through the trellis step of the decoder. The wireless receiving device then lists the most probable / accurate decryption paths for the first section, based on redundancy check information (eg sectioned paths or state derivation logic), as shown, for example in 1404. A list of possible decryption routes may be pruned to determine. For example, if a particular decryption path in the list of possible decryption paths for a particular section of the payload fails to satisfy the redundancy check information (for example, fails the CRC), this particular decryption path. Can be pruned (eg, discarded).

According to some embodiments, the list of most probable / accurate decoding paths (eg, those that satisfy the redundancy check information / pass the CRC) are then decrypted by decoding the codeword. Can be used to verify. In some cases, the trellis quality of the list decoder can be improved by allowing decryption path candidates that pass these CRCs to utilize the resources available within the trellis (eg, states and stages). For example, suppose an intermediate section of the payload fails its section expression CRC, and adjacent preceding and subsequent sections both pass their respective section expression CRC. Now, according to the aspect, with the knowledge and conviction that two adjacent sections have passed their section expression CRC, the intermediate failing section may be, for example, the start and end states of the failing intermediate section. By using the state information for the passed sections, the knowledge of the state of those CRC-passed sections can be directly utilized. Accordingly, in some cases, the decoder may use this information to attempt to re-decrypt the middle section of the fail.

In some cases, during decryption, the wireless receiving device has no possible decoding path for a particular section of codeword (for example, all decoding paths are pruned from the list of possible decoding paths). If determined, the wireless receiving device may finish decryption early. This is because no decryption path results in a codeword that is properly decoded. According to aspects, this early termination reduces decoding complexity and power consumption. This is because the decoder does not have to try to decode the codeword that would eventually be undecodable because there are no decoding paths left.

According to some embodiments, such a SITRC is a pre-defined function such as sectioned payload CC / TBCC memory state or trellis route information, eg, section_payload_memory_state_or_trellis_path_info, as shown in Figure 14. Can be achieved by taking input from.

FIG. 15 shows a four-state CC / TBCC with SITRC derived from a 2-bit CRC (X2 + X1 + 1) over trellis path bits, according to some aspects of the present disclosure. For example, during decoding of the payload section of a codeword, the wireless receiving device may determine a list of possible decoding paths through the trellis step of the list decoder for the first section, as shown, for example in 1402. The wireless receiving device then prunes the list of possible decryption routes based on the state or route information for that payload section in order to determine the list of most likely / accurate decryption routes for that payload section. obtain. As mentioned above, the wireless receiving device may finish decoding early if there is no decoding path remaining to withstand pruning (eg, all decoding paths are pruned).

According to some aspects, the main advantage of SITRC over SDRC is related to the application of CRC data. For example, decoders benefit in that their knowledge of redundancy checks can be applied directly during decoder trellis construction by quantitatively reflecting redundancy checks in the state metrics used to decode codewords. Obtainable. This allows the decoder to make an effort to always find the number of most probable / accurate route candidates before deriving the decoded bits. However, the SDRC requires a complete decryption procedure before the decrypted redundancy check can be applied.

According to aspects, SDRC offers some benefits when used with Polar code. For example, polar decryption (SC / SCL) is performed sequentially on the information bits (u0, u1, u2, ...) (described above), and the decrypted information bits with the lower index are higher. It can be derived and inspected faster than the decoded information bits with the index. According to the embodiment, in order to support multiple information priorities by applying SDRC in Polar code, the payload section and its corresponding sectioned CRC may cover higher priority information. , Other sections of the payload (and their corresponding CRC) may cover lower priority information. For example, a payload often consists of multiple parameter fields, which may or may not have equal priority with respect to timing of application. Assuming that each parameter field also has a corresponding sectioned CRC, decrypting the first section of the payload and ensuring that its corresponding CRC passes and then decoding the second section of the payload. The decryption result for the first section of the payload may already be used by other modem modules just before it starts. Such a priority scheme is possible for Polar code when the decryption is highly sequential.

According to aspects, the application of such sectioned CRC (eg, in Polar code) includes enhanced mobile broadband (eMBB) and specific downlink control (DCI) such as resource block (RB) allocation. The information is more time-critical as it is required for demodulation reference signal (DMRS) channel estimation / equalization at the demodulator front end (DEM Front), while other DCI fields (modulation and coding schemes (MSC) or New data indicators (NDI, etc.) are not very time critical as they are only used in the demodulator backend (DEM Back). Without sectioned CRC, such types of multiple priority signaling cannot be easily supported.

In some cases, certain sections of codeword cannot be properly decrypted. For example, during the validation process, the wireless receiving device may determine that one or more sections of the codeword were not properly decrypted based on the redundancy check information. In some cases, if the wireless receiving device determines that one or more sections of codeword have not been properly decrypted, the wireless receiving device will retransmit one or more of those improperly decrypted sections. A request may be sent (for example, to a wireless transmitting device). In other cases, the wireless receiving device uses the information that one or more sections were not properly decrypted in order to attempt decryption of one or more sections, and a more advanced decryption operation. May be executed. For example, a wireless receiving device may attempt to decode a codeword using a higher performance and more complex decoding algorithm (eg, a decoder with a larger list size).

In addition, although aspects of the present disclosure are described using sectioned redundancy check information by TBCC / CC coding schemes, the techniques presented above are also used in conjunction with other coding schemes such as Polar code. Please note that it is also good.

FIG. 16 shows an encoder 1600 configured to encode a payload according to aspects of the present disclosure. According to aspects, the encoder 1600 may include an encoder 322 and / or an encoder 406. As shown, the encoder 1600 comprises several electrical circuits configured to perform, for example, the operation 1100 shown in FIG. For example, encoder 1600 includes electrical circuit 1602 to obtain the payload to be transmitted. In addition, the encoder 1600 includes an electrical circuit 1604 for partitioning the payload into multiple payload sections. In addition, the encoder 1600 includes an electrical circuit 1606 for deriving redundancy check information for each of the plurality of payload sections. In addition, encoder 1600 includes electrical circuit 1608 for merging redundant inspection information for each payload section with multiple payload sections to form a bit sequence. In addition, the encoder 1600 includes an electrical circuit 1610 for generating codewords by encoding a bit sequence using the encoder.

FIG. 17 shows a decoder 1700 configured to decode codewords encoded using the techniques presented herein, according to aspects of the present disclosure. According to aspects, the decoder 1700 may include a decoder 324 and / or a decoder 516. As shown, the decoder 1700 comprises several electrical circuits configured to perform, for example, the operation 1300 shown in FIG. For example, decoder 1700 includes electrical circuit 1702 for receiving codewords containing multiple payload sections. In addition, the decoder 1700 includes an electrical circuit 1704 for decoding multiple payload sections of codeword. In addition, the decoder 1700 includes an electrical circuit 1706 for verifying each decoded payload section of a plurality of payload sections based on the redundancy inspection information corresponding to the decoded payload section.

The methods disclosed herein include one or more steps or actions to achieve the methods described. Method steps and / or actions may be interchanged with each other without departing from the claims. In other words, the order and / or use of a particular step and / or action may be modified without departing from the claims, unless a particular order of steps or actions is specified.

Those skilled in the art will appreciate that information and signals may be represented using any of a wide variety of techniques and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referred to throughout the above description are voltages, currents, electromagnetic waves, magnetic fields or particles, light fields or light particles, or theirs. It may be represented by any combination.

The various operations of the above method may be performed by any suitable means capable of performing the corresponding function. This means may include various hardware and / or software components and / or modules, including, but not limited to, circuits, application specific integrated circuits (ASICs), or processors.

For example, means to process, means to generate, means to obtain, means to partition, means to determine, means to derive, means to merge, means to verify. , The means for concatenating, the means for interleaving, the means for decoding, and the means for encoding are the TX data processor 214, the processor 230 and / or the RX data processor 242 of the access point 210 shown in FIG. , Or a processing system that may include one or more processors, such as the TX data processor 238, processor 270 and / or RX data processor 260 of the access terminal 250 shown in FIG. In addition, the means for transmitting and the means for receiving may include TMTR / RCVR222 of the access point 210 or TMTR / RCVR252 of the access terminal 250.

According to some embodiments, such means perform the corresponding function by implementing the various algorithms described above (eg, in hardware or by executing software instructions). It can be implemented by a processing system configured in.

Those skilled in the art will further appreciate that the various exemplary logical blocks, modules, circuits, and algorithmic steps described with respect to the disclosure herein may be implemented as electronic hardware, computer software, or a combination of both. .. To clearly illustrate this compatibility of hardware and software, various exemplary components, blocks, modules, circuits, and steps have been generally described above with respect to their functionality. Whether such functionality is implemented as hardware or software depends on the design constraints imposed on the particular application and the entire system. Those skilled in the art may implement the described functionality in various ways for each particular application, but such implementation decisions should not be construed as causing deviations from the scope of the present disclosure.

The various exemplary logic blocks, modules, and circuits described with respect to the disclosure herein are general purpose processors, digital signal processors (DSPs), application specific integrated circuits, designed to perform the functions described herein. May be implemented or implemented using an application specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, individual gate or transistor logic, individual hardware components, or any combination thereof. be. The general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. Processors are also implemented as a combination of computing devices (eg, a combination of DSP and microprocessor, multiple microprocessors, one or more microprocessors associated with a DSP core, or any other such configuration). You may.

The steps of methods or algorithms described with respect to the disclosure herein may be embodied directly in hardware, in software modules executed by a processor, or in combination thereof. Software modules reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disks, removable disks, CD-ROMs, or any other form of storage medium known in the art. In some cases. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and / or write information to the storage medium. In an alternative form, the storage medium may be integrated with the processor. Processors and storage media may reside in the ASIC. The ASIC may be present on the user terminal. Alternatively, the processor and storage medium may be present in the user terminal as separate components.

In one or more exemplary embodiments, the features described may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, a function may be stored on or transmitted through a computer-readable medium as one or more instructions or codes. Computer-readable media include both computer storage media and communication media, including any medium that facilitates the transmission of computer programs from one location to another. The storage medium may be any available medium accessible by a general purpose computer or a dedicated computer. As an example, but not limited to, such computer-readable media may instruct or structure RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or desired program code means. Can be used for transport or storage in the form of, and can include a general purpose computer or a dedicated computer, or any other medium accessible by a general purpose processor or a dedicated processor. Also, any connection is properly referred to as a computer-readable medium. For example, the software may use coaxial cables, fiber optic cables, stranded wires, digital subscriber lines (DSL), or wireless technologies such as infrared, wireless, and microwave to websites, servers, or other remotes. When transmitted from a source, wireless technologies such as coaxial cable, fiber optic cable, stranded, DSL, or infrared, wireless, and microwave are included in the definition of medium. The discs and discs used herein are compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), floppy disks. Includes (registered trademark) discs, and BLU-RAY® discs, where discs typically play data magnetically and discs use lasers. Play back the data optically. The above combinations should also be included within the scope of computer readable media.

As used herein, the phrase pointing to "at least one of" a list of items refers to any combination of those items, including a single member. As an example, "at least one of a, b, or c" is intended to include a, b, c, a-b, a-c, b-c, and a-b-c.

The previous description of the disclosure is provided to allow any person skilled in the art to make or use the disclosure. Various modifications of the present disclosure will be readily apparent to those of skill in the art, and the general principles defined herein may be applied to other variants without departing from the spirit or scope of the present disclosure. Accordingly, this disclosure is not limited to the examples and designs described herein, but should be given the broadest scope consistent with the principles and novel features disclosed herein.

100 access points (AP)
104 antenna
106 antenna
108 antenna
110 antenna
112 antenna
114 antenna
116 Access Terminal (AT)
118 Communication link, reverse link
120 communication links, forward links
122 Access terminal
124 Communication link, reverse link
126 Communication link, forward link
200 MIMO system
210 Transmitter system, access point
212 data source
214 transmit (TX) data processor
220 TX MIMO processor
222 Transmitter (TMTR), Receiver / Transmitter
222a Transmitter (TMTR)
222t transmitter (TMTR)
224a antenna
224t antenna
230 processor
232 memory
236 data source
238 TX data processor
240 demodulator
242 RX data processor
250 receiver system, access terminal
252a antenna
252r antenna
254 Receiver / Transmitter
254a transmitter
254r transmitter
260 RX data processor
270 processor
272 memory
280 modulator
302 wireless device
304 processor
306 memory
308 housing
310 transmitter
312 receiver
314 transceiver
316 transmit antenna
318 signal detector
320 Digital Signal Processor (DSP)
322 Encoder
324 decoder
326 Bus system
402 Message
404 Radio Frequency (RF) Modem
406 encoder
408 Coded Bitstream
410 Mapper
412 Tx symbol
414 Tx chain
416 RF signal
418 antenna
502 antenna
506 RF chain
508 symbol
510 modem
512 Demapper
514 bitstream
516 decoder
518 message
1100 operation
1300 operation
1600 encoder
1602 electrical circuit
1604 electrical circuit
1606 electrical circuit
1608 electrical circuit
1610 electrical circuit
1700 decoder
1702 electrical circuit
1704 electrical circuit
1706 electrical circuit

Claims (15)

It is a method of transmitting data wirelessly according to wireless technology.
Steps to get the payload to be sent, and
The step of dividing the payload into multiple payload sections,
For each of the plurality of payload sections, a step of deriving section-type redundancy check information covering the payload sections from the first payload section to the respective payload sections , and
A step of merging the sectioned redundancy check information with the plurality of payload sections to form a bit sequence for transmission.
A step of generating a single codeword by encoding the bit sequence with an encoder for transmission, and
A method comprising the step of transmitting the codeword according to the radio technique. The merging step comprises at least one of the steps of concatenating or interleaving each of the plurality of payload sections with the sectioned redundancy check information according to the pattern.
According to the pattern, the step of connecting each of the plurality of payload sections with the section-type redundancy check information is
The method of claim 1, comprising connecting the payload sections together to form a sectioned payload section and connecting the sectioned redundancy check information at the end of the sectioned payload section. A step of deriving a global error detection code covering the plurality of payload sections is further included, and a step of merging includes the step of combining the section type redundancy check information, the plurality of payload sections , and the global error detection code. The method of claim 1, including. The method of claim 1, wherein the sectioned redundancy check information comprises information that can be used by the list decoder to determine one or more correct decoding paths throughout the trellis step of the list decoder. Claim that the codeword is encoded using a tail-biting convolution code (TBCC) coding method, a convolution code (CC) coding method, or a Polar code coding method, and the payload contains control information. The method described in 1. The first aspect of claim 1, wherein the size of the section-type redundancy check information for the first payload section of the plurality of payload sections is different from the size of the section-type redundancy check information for the second payload section of the plurality of payload sections. the method of. It is a method of receiving data wirelessly according to wireless technology.
Following the steps of receiving codewords according to the wireless technology,
A step of decoding the codeword to obtain a bit sequence in which multiple payload sections and sectioned redundancy check information are merged .
A method comprising, for each payload section of a plurality of payload sections, a step of verifying sectioned redundancy check information covering the payload sections from the first payload section to each of said payload sections . The plurality of payload sections are interleaved and / or concatenated with sectioned redundancy check information according to a pattern.
Of the fact that each payload section of the plurality of payload sections is concatenated together to form a section-type payload section, and that the section-type redundancy check information is concatenated at the end of the section-type payload part. The method according to claim 7, which is one of the above. The method of claim 7, wherein the verification step comprises verifying all of the decrypted payload sections based on the global error detection code contained within the codeword. The plurality of sectioned redundancy check information includes information that can be used by the list decoder to determine one or more correct decoding paths through the trellis step of the list decoder used to decode the codeword. , The method of claim 7. The step of determining that the first payload section of the plurality of payload sections was not properly decrypted,
Using the step of sending a request to retransmit the first payload section , or the information that the first payload section was not properly decoded and had a larger decryption list size, said first. 7. The method of claim 7, further comprising at least one of the steps of performing an advanced decryption operation to attempt to decrypt the payload section of. The step to decrypt is
A list of possible decoding paths through the trellis step of the list decoder for the first payload section , with a step of determining for the first payload section of the plurality of payload sections of the codeword.
To determine the correct list of decryption routes for the first payload section, pruning the list of possible decryption routes based on the first section redundancy check information associated with the first payload section . Including steps to do
The steps to decode the first payload section , or all of the possible decryption routes to the first payload section , are pruned, at least in part, based on the list of correct decryption paths for the first payload section. The method of claim 7, wherein the method further comprises the step of terminating the decryption early. The codeword is encoded using a tailbiting convolution code (TBCC) coding method, a convolution code (CC) coding method, or a Polar code coding method, and the codeword contains control information. The method described in Section 7. A device for wireless communication, comprising means for performing the method according to any one of claims 1 to 13. A computer program having instructions for performing the method according to any one of claims 1 to 13 when executed on a computer.

Images