Abstract: Innovations in range asymmetric number system (“RANS”) coding and decoding are described herein. Some of the innovations relate to hardware implementations of RANS decoding that organize operations in two phases, which can improve the computational efficiency of RANS decoding. Other innovations relate to adapting RANS encoding/decoding for different distributions or patterns of values for symbols. For example, RANS encoding/decoding can adapt by switching a default symbol width (the number of bits per symbol), adjusting symbol width on a fragment-by-fragment basis for different fragments of symbols, switching between different static probability models on a fragment-by-fragment basis for different fragments of symbols, and/or selectively flushing (or retaining) the state of a RANS decoder on a fragment-by-fragment basis for different fragments of symbols. In many cases, such innovations can improve compression efficiency while also providing computationally efficient performance.
Type:
Application
Filed:
December 15, 2021
Publication date:
April 7, 2022
Applicant:
Microsoft Technology Licensing, LLC
Inventors:
Derek E. GLADDING, Sudharsan GOPALAKRISHNAN, Shaileshkumar D. KUMBHANI, Hsu-Kuei LIN
Abstract: Innovations in range asymmetric number system (“RANS”) coding and decoding are described herein. Some of the innovations relate to hardware implementations of RANS decoding that organize operations in two phases, which can improve the computational efficiency of RANS decoding. Other innovations relate to adapting RANS encoding/decoding for different distributions or patterns of values for symbols. For example, RANS encoding/decoding can adapt by switching a default symbol width (the number of bits per symbol), adjusting symbol width on a fragment-by-fragment basis for different fragments of symbols, switching between different static probability models on a fragment-by-fragment basis for different fragments of symbols, and/or selectively flushing (or retaining) the state of a RANS decoder on a fragment-by-fragment basis for different fragments of symbols. In many cases, such innovations can improve compression efficiency while also providing computationally efficient performance.
Type:
Application
Filed:
June 28, 2019
Publication date:
December 31, 2020
Applicant:
Microsoft Technology Licensing, LLC
Inventors:
Derek E. GLADDING, Sudharsan GOPALAKRISHNAN, Shaileshkumar D. KUMBHANI, Hsu-Kuei LIN
Abstract: Innovations in range asymmetric number system (“RANS”) coding and decoding are described herein. Some of the innovations relate to hardware implementations of RANS decoding that organize operations in two phases, which can improve the computational efficiency of RANS decoding. Other innovations relate to adapting RANS encoding/decoding for different distributions or patterns of values for symbols. For example, RANS encoding/decoding can adapt by switching a default symbol width (the number of bits per symbol), adjusting symbol width on a fragment-by-fragment basis for different fragments of symbols, switching between different static probability models on a fragment-by-fragment basis for different fragments of symbols, and/or selectively flushing (or retaining) the state of a RANS decoder on a fragment-by-fragment basis for different fragments of symbols. In many cases, such innovations can improve compression efficiency while also providing computationally efficient performance.
Type:
Grant
Filed:
June 28, 2019
Date of Patent:
January 25, 2022
Assignee:
Microsoft Technology Licensing, LLC
Inventors:
Derek E. Gladding, Sudharsan Gopalakrishnan, Shaileshkumar D. Kumbhani, Hsu-Kuei Lin
Abstract: A downlink channel estimation method based on a co-prime array in asymmetric massive MIMO architecture is provided. First, an uplink and downlink asymmetric receiving and transmitting system model based on a co-prime array is established, and a deviation of the frequency domain direction caused by array broadband signals is observed; then, uplink receiving is performed to estimate an uplink channel, and channel parameters such as the number of paths, the angle of arrival and the path gain are recovered; and finally, a downlink channel is reconstructed based on the channel parameters recovered according to the uplink channel. By means of the high angular resolution of the co-prime array, the problem that a recovered uplink channel cannot be directly used for pre-coding of a downlink channel is solved.
Type:
Application
Filed:
August 16, 2022
Publication date:
October 31, 2024
Applicant:
NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS
Inventors:
Jun ZHANG, Jiacheng LU, Shu CAI, Hairong WANG, Wenjun LV, Hongbo ZHU
Abstract: In an arrangement of the disclosed systems, devices, and methods, a codeword encoded with a first number of check symbols is received and asymmetrically processed according to a second number of check symbols, where the second number of check symbols is less than the first number of check symbols, to produce an error locator polynomial and an error evaluator polynomial. A derivative of the error locator polynomial is produced by outputting a first polynomial term and a second polynomial term, wherein the second polynomial term is a constant. The derivative of the error locator polynomial is produced using a variable finite-field multiplier and without use of a divider.