# US 11,451,418 B2 · Communication system of high capacity > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,451,418 B2 - Document ID: US11451418B2 - Status: Granted - Kind: B2 - Application number: 17/607,151 - Filed: 2020-06-03 - Published: 2022-05-26 - Granted: 2022-09-20 - Earliest claimed: 2019-06-07 - Applicants: Michel Fattouche - Inventors: Michel Fattouche - Web page: https://patentgrep.com/patent/US11451418B2 ## CPC - H04L 25/03159: {operating in the frequency domain (H04L25/03165, H04L25/03178 take precedence)} - H04L 27/00: Modulated-carrier systems - H04B 1/0032: {with analogue quadrature frequency conversion to and from the baseband (quadrature modulators and demodulators per se H03D3/007, H03C3/40)} - H04B 7/0452: Multi-user MIMO systems - H04L 25/0328: {with interference cancellation circuitry (adaptations for interference cancellation within a sequence estimator H04L25/03305; interference related aspects of direct sequence spread spectrum H04B1/7097; interference related aspects of frequency hopping spread spectrum H04B1/715; see also H04B1/10)} - H04L 25/03343: {Arrangements at the transmitter end} - H04W 80/02: Data link layer protocols - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - H04B: TRANSMISSION - H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72) ## Abstract It is an objective of the current disclosure to design a novel communications system capable of offering improvement in channel capacity compared to current communications systems. To this end, the disclosure teaches how to add new information to a select number of Degrees of Freedom (DOF), through three design steps. All three steps aim to design the system such that the minimum required average received Signal-to-Noise Ratio (SNR) is reduced for a given desired capacity and for a given specified mask. The first design step identifies the select number of DOF required for achieving the desired capacity. The second design step enhances the contribution of the selected DOF by matching them to the specified mask. This step aims to have the transmitted signal comply with the specified mask. The third design step randomizes the DOF using a pseudo-random phase. This step aims to reduce the required average received SNR. ## Claims ### Claim 1 A method for transmitting frames of information across a communications channel, the method comprising; a first conversion operation for converting the frames of information into a discrete-time Time-Limited signal where the frames of information are contained in a plurality of Finite Access Time (FAT) Degrees Of Freedom (DOF); a second conversion operation for converting the discrete-time Time-Limited signal into a continuous-time signal; and a transmission operation for transmitting the continuous-time signal across the communications channel. ### Claim 2 (depends on 1) The method in claim 1, in which the first conversion operation uses a matrix that is designed such that the plurality of FAT DOF is selected as per Design Step I of a Mask-Matched Time-Limited method with FAT DOF (MTF). ### Claim 3 (depends on 2) The method in claim 2, in which the matrix is Block Toeplitz. ### Claim 4 (depends on 2) The method in claim 2, in which the matrix is further designed such that the selected plurality of FAT DOF is enhanced as per Design Step II of the MTF. ### Claim 5 (depends on 4) The method in claim 4, in which the matrix is further designed such that the selected and enhanced plurality of FAT DOF is randomized as per Design Step III of the MTF. ### Claim 6 (depends on 5) The method in claim 5, in which each column of the matrix is the result of adding a plurality of sub-columns; with the first sub-column corresponding to a function with a Degree of Differenciability (DOD) larger than zero. ### Claim 7 (depends on 6) The method in claim 6, in which the second sub-column corresponds to a function with a DOD equal to zero. ### Claim 8 (depends on 7) The method in claim 7, in which the elements of the second sub-column are independent pseudo-random variables. ### Claim 9 (depends on 8) The method in claim 8, in which the first sub-column is the result of performing a linear convolution operation between a plurality of pulses, each pulse with a DOD larger than zero. ### Claim 10 (depends on 9) The method in claim 9, in which the first pulse is the result of performing a circular convolution operation between a first sub-pulse with a DOD larger than zero; and a second sub-pulse with a DOD equal to zero. ### Claim 11 A An apparatus for transmitting frames of information across a communications channel, the apparatus comprising a first converter for converting the frames of information into a discrete-time Time-Limited signal where the frames of information are contained in a plurality of Finite Access Time (FAT) Degrees Of Freedom (DOF); a second converter for converting the discrete-time Time-Limited signal into a continuous-time signal; and a transmitter for transmitting the continuous-time signal across the communications channel. ### Claim 12 (depends on 11) The apparatus in claim 11, in which the first converter uses a matrix that is designed such that the plurality of FAT DOF is selected as per Design Step I of a Mask-Matched Time-Limited method with FAT DOF (MTF). ### Claim 13 (depends on 12) The apparatus in claim 12, in which the matrix is Block Toeplitz. ### Claim 14 (depends on 12) The apparatus in claim 12, in which the matrix is further designed such that the selected plurality of FAT DOF is enhanced as per Design Step II of the MTF. ### Claim 15 (depends on 14) The apparatus in claim 14, in which the matrix is further designed the selected and enhanced plurality of FAT DOF is randomized as per Design Step III of the MTF. ### Claim 16 (depends on 15) The apparatus in claim 15, in which each column of the Matrix is the result of adding a plurality of sub-columns; with the first sub-column corresponding to a function with a Degree of Differenciability (DOD) larger than zero. ### Claim 17 (depends on 16) The apparatus in claim 16, in which the second sub-column corresponds to a function with a DOD equal to zero. ### Claim 18 (depends on 17) The apparatus in claim 17, in which the elements of the second sub-column are independent pseudo-random variables. ### Claim 19 (depends on 18) The apparatus in claim 18, in which the first sub-column is the result of performing a linear convolution operation between a plurality of pulses, each pulse with a DOD larger than zero. ### Claim 20 (depends on 19) The apparatus in claim 19, in which the first pulse is the result of performing a circular convolution operation between a first sub-pulse with a DOD larger than zero; and a second sub-pulse with a DOD equal to zero.