# US 2023/0054828 A1 · Methods of using phases to reduce bandwidths or to transport data with multimedia codecs using only magnitudes or amplitudes. > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2023/0054828 A1 - Document ID: US20230054828A1 - Status: Published application - Kind: A1 - Application number: 17/407,620 - Filed: 2021-08-20 - Published: 2023-02-23 - Earliest claimed: 2021-08-20 - Inventors: GEORGES SAMAKE - Web page: https://patentgrep.com/patent/US20230054828A1 ## CPC - H04L 27/2639: {Modulators using other transforms, e.g. discrete cosine transforms, Orthogonal Time Frequency and Space [OTFS] or hermetic transforms} - G10L 19/0212: {using orthogonal transformation} - H03M 7/3059: {Digital compression and data reduction techniques where the original information is represented by a subset or similar information, e.g. lossy compression} - H03M 7/3068: {Precoding preceding compression, e.g. Burrows-Wheeler transformation} - H04B 1/713: using frequency hopping - H04L 27/2615: {Reduction thereof using coding} - H04L 27/2634: {Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation} - H03M 7/4037: {Prefix coding} - H04B 1/707: using direct sequence modulation - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING - H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C) - H04B: TRANSMISSION ## Abstract Multimedia codecs (compression methods), based only on FFT (Fast Fourier Transform) have been recently proposed. These codecs use the largest points (foreground) and the most energetic bands (background). Medium quality versions are based on the largest local peaks only. The phases can be ignored with the largest local peaks or in the background. Alternatively, sine and cosine amplitudes can be used. This invention describes methods for giving utility to the reintroduced phases, in particular: local peaks are grouped to have a very narrow bandwidth, with the phases containing the displacements of these peaks, and we transport data and the points of the foreground in the phases of the background. High speed communications are supported using techniques similar to OFDM (Orthogonal Frequency-Division Multiplexing). These processes are intended to be used in particular with connected objects and in the physical layers of computer networks. ## Claims ### Claim 1 A method of additional processing applied to multimedia codecs, audio, image and video compression methods, based solely on FFT, Fast Fourier Transform, using the largest points, the foreground, and the most energetic bands, the background, being able to use only a local peaks field with or without phases, and being able to ignore the phases in the background, comprising: adding phases and using them to transport the values of the displacements of the local points and peaks in order to reduce the bandwidths; adding phases in the background and using them to transport the points of the foreground in order to reduce the crest factor. ### Claim 2 (depends on 1) The method of claim 1, wherein generating a very narrow bandwidth signal with the local points and peaks ignoring the phases comprises: associating new phases to the points; grouping the points so as to have a very narrow bandwidth; putting the displacements or the original positions of the points in the associated phases; synthesizing a new, relatively low-frequency, time-domain signal using an inverse FFT. ### Claim 3 (depends on 1) The method of claim 1, wherein taking into account the actual phases in the FFT sense of the local points and peaks, comprises: transforming the magnitudes and phases into sine amplitudes and cosine amplitudes; considering these amplitudes as magnitudes with sign; generating two separate low-frequency signals, each signal being considered as a signal without phase, and transmitting these signals; recovering the FFT phases from the received amplitudes. ### Claim 4 (depends on 1) The method of claim 1, wherein transporting the foreground data and additional pure data in the background bands comprises: leaving the points at their place, even if there are some null points due in particular to the absence of the points of the foreground; ignoring the phases in the FFT sense or taking only the sign of the phases in the bands; transporting the data directly into the reintroduced phases associated with the points. ### Claim 5 (depends on 1) The method of claim 1, wherein transmitting the entire frame with background bands comprises distributing the bins of the bands between several frequencies or several subcarriers, as in OFDM (Orthogonal Frequency-Division Multiplexing), and making a single inverse FFT. ### Claim 6 (depends on 1) The method of claim 1, wherein using the frequency hopping spread spectrum comprises varying the starting frequency of the low frequency signal, and wherein using the direct sequence spread spectrum comprises using all the background bands simultaneously, with possible spacings between the bands. ### Claim 7 (depends on 1) The method of claim 1, wherein transporting the foreground points into the reintroduced background phases comprises the transport of the values of the magnitudes, positions and phases, or the values of the sine amplitudes, cosine amplitudes and positions. ### Claim 8 (depends on 1) The method of claim 1, wherein implementing the virtual decimation in the background bands comprises: using the non-decimable points to contain the magnitudes and the possible phases of the codec; using the phases and possibly the magnitudes of the decimable points to contain the data; ensuring that the magnitudes of the decimable points are not greater than those calculated. ### Claim 9 (depends on 1) The method of claim 1, wherein transporting UNB (Ultra Narrow Bandwith) frames as OFDM FFT bins, instead of with analog or digital modulations, comprises: considering the magnitudes and the phases containing the displacements of the points as OFDM FFT bins, and placing them in OFDM subcarriers; using a known crest factor reduction technique, or simply optimizing the phase oppositions, or duplicating the symbols on other subcarriers, with or without interlacing, and optimizing the phase oppositions. ### Claim 10 (depends on 1) The method of claim 1, wherein creating and transmitting UNB frames and wherein moving back to the starting domain comprises using transforms as DCT (Discrete Cosine Transform), MDCT (Modified Discrete Cosine Transform), and real DWT (Discrete Wavelet Transform). ### Claim 11 (depends on 1) The method of claim 1, further comprising modeling the output of the RLE (Run-Length Encoding) encoding, wherein the modeling of the output of the RLE encoding as a FFT codec comprises matching the values to be repeated to the magnitudes and matching the number of repetitions, up to a certain limit, to the phases. ### Claim 12 (depends on 1) The method of claim 1, further comprising modeling the output of the Huffman encoding, wherein the modeling of the output of the Huffmane encoding as a FFT codec comprises: matching the less frequent points each using the most bits to the foreground points; matching the most frequent points each using the fewest bits to the background points; matching the number of repetitions, up to a limit, to the phases with the foreground points; matching the number of repetitions, up to a limit, to the phases with the background points, or ignoring the repetitions in the background.