Embodiments of the present invention relate to the field of communications, and provide a decoding method and a decoder, which are used to reduce decoding complexity. The method includes: receiving a to-be-decoded signal; performing region decision on the to-be-decoded signal according to a region decision rule formed by S region decision formulas, to acquire a region decision result; acquiring N constellation points according to the decision result, where the N constellation points are separately constellation points that are in the N subsets and that are closest to the to-be-decoded signal; acquiring N non-encoded bits corresponding to the N constellation points, and branch metrics between the to-be-decoded signal and the N constellation points; and performing Viterbi decoding based on the branch metrics and the N non-encoded bits, and outputting a decoding result corresponding to the to-be-decoded signal. The present invention is applicable to a signal decoding scenario.

A device and method for wirelessly communicating over a transmission channel with one or more wireless devices. The device comprises a wireless network interface and a controller. The controller is configured to receive a wireless signal via the wireless network interface, if strength of the received signal is greater than a first threshold, determine that the channel is busy, and, if the strength of the received signal is not greater than the first threshold, but is greater than a second threshold that is lower than the first threshold, determine whether the received signal is intended for the device and if so, determine that the channel is busy.

Provided are a partial pseudo-randomization processing method, a corresponding apparatus, a device and a storage medium. The method includes performing pseudo-randomization processing on part of N bits b.sub.1, b.sub.2, . . . , b.sub.N to generate new N bits d.sub.1, d.sub.2, . . . , d.sub.N; and encoding the d.sub.1, d.sub.2, . . . , d.sub.N.

A method, a computer-readable medium, and an apparatus for V2V, V2X, or D2D communication may be a transmitting device configured to determine a source ID for communication over a link, to determine a destination ID for the communication over the link based on a type of the communication. The transmitting device may be further configured to transmit at least one control message over the link, where the control message(s) indicate the source ID and the destination ID. In certain aspects, a receiving device may be configured to receive the control message over the link, where the control message indicates the source ID and the destination ID. The receiving device may be configured to receive a data message over the link and to determine whether to attempt to decode the data message received over the link based on the source ID and the destination ID indicated in the control message.

The present invention is designed to reduce the delay time to transmit delivery acknowledgment information as feedback in response to data channels. According to one aspect of the present invention, a receiving device has a receiving section that receives one or more code blocks mapped per given number of symbols, in a slot in which a data signal is scheduled, and a control section that controls the transmission of delivery acknowledgment information in response to the data signal in the slot, based on the decoding results of the code blocks mapped per given number of symbols.

Digital communications systems employ Forward Error Correction (FEC) for robustness against fading, noise and interference. FEC is designed to support different code rates to meet different requirements. Different code rates may be achieved by performing puncturing or repetition operation. At the receiver the decoding may be performed on the baseline code rate to enable common decoder module. To enable this capability, the input to the decoder of the error correcting code must be initialized to zeros for the bit positions corresponding to bits that are not transmitted. For high throughput systems, it is not efficient to initialize particular bit positions to zero. A method and apparatus are disclosed for joint Rate Matching and deinterleaving that enable the decoder to begin the decoding operation on the received bits without explicitly initializing the punctured bit positions to zero.

Methods, systems, and computer program products for decoding a received data signal in a communication system by iteratively constructing a decoding tree, each node of said decoding tree corresponding to a component of a symbol of said data signal, and being associated with a metric, the construction of the decoding tree implementing at least one iteration of the following steps, for a current node of the tree stored in the top of a stack: generating (102) a reference child node of said current node from said vector representing the received data signal, from the reference child node, generating (106) a first neighbor child node by subtracting a positive integer parameter from the value of the reference node, and a second neighbor child node by adding said positive integer parameter to the value of the reference child node; storing (108) in said stack three child nodes deriving from the reference child node and from said first and second neighbor child nodes, each child node being stored in the stack in association with node information comprising a predetermined metric, the nodes in the stack being ordered by increasing values of metrics; removing (109) the current node from said stack; selecting (111) the top node of said stack as the new current node;
wherein said method further comprises determining an estimation of said data signal from the node information stored in said stack.

Techniques are presented for mapping a digital data sequence into a signal point sequence for transmission. The signal point sequence belongs to a set of possible signal point sequences. In one example, a digital data sequence is received. Forbidden branch flags that forbid certain signal points in the possible signal points sequences are applied. The signal point sequence is selected from a subset of all the possible signal point sequences based on the digital data sequence. The subset is defined by the forbidden branch flags.

A method includes determining the number of CCEs for channel estimation and the number of times of blind-decoding related to multiple search space sets that the terminal needs to monitor during one slot, when the determined number of times of the blind-decoding exceeds a blind-decoding limit or the determined number of the CCEs exceeds a channel estimation limit, dropping at least one PDCCH candidate among PDCCH candidates in the multiple search space sets, and attempting to detect a PDCCH signal based on the remaining PDCCH candidates which have not been dropped. The terminal switches between the multiple search space sets in a round-robin scheme while dropping the PDCCH candidate until both the blind-decoding limit and the channel estimation limit are reached. The terminal is capable of communicating with at least one of another terminal, a terminal related to an autonomous driving vehicle, a base station or a network.

An improved layered decoding method for a low density parity check (LDPC) code and a device therefor are disclosed. Disclosed is the layered decoding method for an LDPC code, capable of determining whether decoding is successful by performing a syndrome check on each check node at every variable node update. In addition, the syndrome check can be performed by using reduced variable nodes, thereby reducing decoding power consumption and decoding time consumption.