Samsung Electronics Co., Ltd.

University of Notre Dame Du Lac

Arrowhead Center, Inc.

Homayoon Hatami

Jung Hyun Bae

Jungwon Lee

Seyed Mohsen Hosseinian

Hamid Saber

David G Mitchell

Daniel Costello

Thomas Fuja

Mohammad Vahid Jamali

Hikmet Yildiz

A method of enabling communication between a user equipment (UE) and a non-terrestrial network (NTN), is described. The UE may be able to calculate a timing advance compensation. The timing advance compensation may be a differential or full timing advance compensation. An offset value, K, may be indicated to the UE. The Kvalue may be used for timing relationships.

Methods for timing advance indication and timing relationships indication for non-terrestrial networks

A modified version of the min-sum algorithm ('MSA') which can lower the error floor performance of quantized LDPC decoders. A threshold attenuated min-sum algorithm (“TAMSA”) and/or threshold offset min-sum algorithm (“TOMSA”), which selectively attenuates or offsets a check node log-likelihood ratio (“LLR”) if the check node receives any variable node LLR with magnitude below a predetermined threshold, while allowing a check node LLR to reach the maximum quantizer level if all the variable node LLRs received by the check node have magnitude greater than the threshold. Embodiments of the present invention can provide desirable results even without knowledge of the location, type, or multiplicity of such objects and can be implemented with only a minor modification to existing decoder hardware.

Threshold-based min-sum algorithm to lower the error floors of quantized low-density parity-check decoders

A processing circuit implements: an encoder configured to: supply k symbols of original data to a neural product encoder including M neural encoder stages, a j-th neural encoder stage including a j-th neural network configured by j-th parameters to implement an (n,k) error correction code (ECC), where nis a factor of n and kis a factor of k; and output n symbols representing the k symbols of original data encoded by an error correcting code; or a decoder configured to supply n symbols of a received message to a neural product decoder including neural decoder stages grouped into a l pipeline stages, an i-th pipeline stage of the neural product decoder including M neural decoder stages, a j-th neural decoder stage comprising a j-th neural network configured by j-th parameters to implement an (n,k) ECC; and output k symbols decoded from the n symbols of the received message.

Product autoencoder for error-correcting via sub-stage processing

A system and a method may include a receiver circuit configured to receive an encoded codeword over a channel from an encoder neural network of an encoder, and a decoder circuit, including a decoder neural network, configured to decode the encoded codeword, and generate a list of decoded message words, the list of the decoded message words including a plurality of candidate message words representing the message word.

Autoencoders with list decoding for reliable data transmission over noisy channels and methods thereof

A symmetric interleaver for a Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN) encoder and a circular padding mode are disclosed. The interleaver interleaves elements of an input block to form an output block in which an output neighborhood of elements for each element of the output block is symmetric to an input neighborhood of elements for each element of the input block. A position of an element of the input block is interleaved based on an index i of the position times a parameter δ modulo K in which the parameter δ is relatively prime with K. A test loss function may be used to train the encoder that includes a Binary Cross Entropy (BCE) loss function plus a function that minimizes a number of codeword pairs based on a Euclidean distance. The RNN encoder may be implemented as part of a Turbo Autoencoder (TurboAE) encoder.

Interleaver design and pairwise codeword distance distribution enhancement for turbo autoencoder

A system and method for random access procedures in a non-terrestrial network. In some embodiments, the method includes calculating, by a user equipment (UE), a timing advance based on location information of the UE and on an ephemeris of a non-terrestrial network node. The method may further include randomly selecting a random value from a plurality of values, and sending, at a transmission time, by the UE, to the non-terrestrial network node, a random access (RA) message, which may include a signature. The transmission time may differ from a nominal transmission time by an amount based on the random value, the nominal transmission time being based on the timing advance, or the signature may differ from a nominal signature by a cyclic shift based on the random value.

Growing community of inventors

San Diego, CA, United States of America

Homayoon Hatami