H04L2025/03789

SCRAMBLING OF PHYSICAL CHANNELS AND REFERENCE SIGNALS IN WIRELESS COMMUNICATION NETWORKS

Radio network nodes, wireless devices, and related methods are provided in which a pseudo-random sequence initialization value, which is used during the generation of pseudo-random and/or scrambling sequences, is based, at least in part, on a first identifier, wherein the first identifier is equal to a first parameter if the first parameter has been configured and if a second identifier corresponds to a wireless-device-specific identifier.

Scrambling of physical channels and reference signals in wireless communication networks

Radio network nodes, wireless devices, and related methods are provided in which a pseudo-random sequence initialization value, which is used during the generation of pseudo-random and/or scrambling sequences, is based, at least in part, on a first identifier, wherein the first identifier is equal to a first parameter if the first parameter has been configured and if a second identifier corresponds to a wireless-device-specific identifier.

Efficient sphere detector algorithm for large antenna communication systems using graphic processor unit (GPU) hardware accelerators

A method of detecting a symbol transmitted over a communication channel in a multiple input-multiple output communication system. The method includes receiving a plurality of symbols transmitted over a communication channel of a multiple input-multiple output communication system. A sphere radius is initialized based on attributes of the communication channel. A first matrix of possible transmitted signals is defined as well as a second matrix of received symbols. The matrix of possible transmitted signals is searched using a breadth-first search (BFS). Each level of the search tree is analyzed utilizing matrix multiplication to determine selected symbols satisfying the initialized sphere radius. A maximum likelihood solution is of the transmitted symbols is derived based on the selected symbols.

SCRAMBLING OF PHYSICAL CHANNELS AND REFERENCE SIGNALS IN WIRELESS COMMUNICATION NETWORKS

Radio network nodes, wireless devices, and related methods are provided in which a pseudo-random sequence initialization value, which is used during the generation of pseudo-random and/or scrambling sequences, is based, at least in part, on a first identifier, wherein the first identifier is equal to a first parameter if the first parameter has been configured and if a second identifier corresponds to a wireless-device-specific identifier.

EFFICIENT SPHERE DETECTOR ALGORITHM FOR LARGE ANTENNA COMMUNICATION SYSTEMS USING GRAPHIC PROCESSOR UNIT (GPU) HARDWARE ACCELERATORS

A method of detecting a symbol transmitted over a communication channel in a multiple input-multiple output communication system. The method includes receiving a plurality of symbols transmitted over a communication channel of a multiple input-multiple output communication system. A sphere radius is initialized based on attributes of the communication channel. A first matrix of possible transmitted signals is defined as well as a second matrix of received symbols. The matrix of possible transmitted signals is searched using a breadth-first search (BFS). Each level of the search tree is analyzed utilizing matrix multiplication to determine selected symbols satisfying the initialized sphere radius. A maximum likelihood solution is of the transmitted symbols is derived based on the selected symbols.

Efficient sphere detector algorithm for large antenna communication systems using graphic processor unit (GPU) hardware accelerators

A method of detecting u symbol transmitted over a communication channel in a multiple input-multiple output communication system. The method includes receiving a plurality of symbols transmitted over a communication channel of a multiple input-multiple output communication system. A sphere radius is initialized based on attributes of the communication channel. A first matrix of possible transmitted signals is defined as well as a second matrix of received symbols. The matrix of possible transmitted signals is searched using a breadth-first search (BFS). Each level of the search tree is analyzed utilizing matrix multiplication to determine selected symbols satisfying the initialized sphere radius. A maximum likelihood solution is of the transmitted symbols is derived based on the selected symbols.

Packet detection in point-to-point wireless communication networks

Methods, apparatuses, and systems for packet detection in a point-to-point wireless communication network is disclosed. One method includes receiving, by a receiving node, a plurality of packets, adjusting, by an adjustable gain amplifier of the receiving node, a power level of the received plurality of packets, controlling, by a gain control module, a gain of the adjustable gain amplifier, thereby controlling the power level of the received plurality of packets, monitoring the controlled gain of the gain control module over a period of time, identifying a timing of reception of interfering packets based on the monitoring of the controlled gain of the gain control module over the period of time, and adjustably controlling, by the gain control module, the gain of the adjustable gain amplifier based on the identified timing of reception of the interfering packets.

Code division multiaccess (CDMA) communications system and method with low probability of intercept, low probability of detect (LPI/LPD)
10756781 · 2020-08-25 · ·

A code division multiaccess (CDMA) communications system with low probability of intercept, low probability of detect (LPI/LPD) includes at least one data dictionary stored on a storage device of a sender subsystem and a recipient subsystem. The at least one data dictionary includes at least one data predetermined start time and date, at least one data predetermined end time and date based on a mission length or a predetermined wrap time and date, a CDMA chip rate, and a complex zero-mean independent and identically distributed (iid) sequence where each complex number in the complex zero-mean iid sequence represents a CDMA chip stored on the storage device of the sender subsystem and the recipient subsystem. The system includes a tangible, non-transitory, machine-readable medium comprising machine-executable instructions which, when executed by at least one processor of a machine, cause the at least one processor to: receive a message, convert the message to symbols with corresponding phasors, determine a date and time to send the message, look up a data spreading vector for each corresponding phasor by providing a mutually agreed number of chips per phasor stored on the storage device of the sender subsystem and the recipient subsystem and by matching the date and time the message is to be sent to the at least one data predetermined start time and date and the at least one data predetermined end time and date. Each data spreading vector is multiplied by its corresponding phasor to create a data spread vector for each data spreading vector. The sender subsystem is configured to sequentially transmit each chip of each data spread vector as a signal.

Method for implementing turbo equalization compensation, turbo equalizer and system

Embodiments of the present application relate to a method for implementing Turbo equalization compensation. The equalizer divides a first data block into n data segments, where D bits in two adjacent data segments in the n data segments overlap, performs recursive processing on each data segment in the n data segments, before the recursive processing, merges the n data segments to obtain a second data block; and performs iterative decoding on the second data block, to output a third data block, where data lengths of the first data block, the second data block, and the third data block are all 1/T of a code length of a LDPC convolutional code.

Circuits for efficient detection of vector signaling codes for chip-to-chip communication
10560293 · 2020-02-11 · ·

In a detection circuit, inputs correspond to received indications of vector signaling code words received by a first integrated circuit from a second integrated circuit. With four inputs, the circuit compares a first pair to obtain a first difference result and compares a second pair, disjoint from the first pair, to obtain a second difference result. The first and second difference results are then summed to form an output function. A system might use a plurality of such detection circuits to arrive at an input word. The circuit can include amplification, equalization, and input selection with efficient code word detection. The vector signaling code can be a Hadamard matrix code encoding for three input bits. The circuit might also have frequency-dependent gain, a selection function that directs one of the summation function result or the first difference result to the output function, variable gain, and/or a slicer.