# US 2006/0155493 A1 · Method for determining the envelope curve of a modulated signal

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2006/0155493 A1
- Document ID: US20060155493A1
- Status: Published application
- Kind: A1
- Application number: 10/525,638
- Filed: 2003-08-07
- Published: 2006-07-13
- Earliest claimed: 2002-09-12
- Assignees: Rohde & Schwarz GmbH & Co. KG
- Inventors: Martin Hofmeister
- Web page: https://patentgrep.com/patent/US20060155493A1

## CPC

- H04N 5/455: Demodulation-circuits
- H04L 1/206: {for modulated signals}
- H04N 17/00: Diagnosis, testing or measuring for television systems or their details
- H04B 17/10: of transmitters
- H04N 5/38: Transmitter circuitry {for the transmission of television signals according to analogue transmission standards} (H04N5/14 takes precedence)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04B: TRANSMISSION

## Abstract

The invention relates to a method for determining the envelope curve of a modulated input signal (5) with the following method steps: generation of digital samples (An) by digital sampling (1) of the input signal (5), generation of Fourier-transformed samples (Bn) by Fourier transformation of the digital samples (An), generation of sideband-cleaned, Fourier-transformed samples (B′n) by removing the range with negative frequencies or the range with positive frequencies from the Fourier-transformed samples (Bn), generation of inverse-transformed samples (Cn) by inverse Fourier transformation (4) of the sideband-cleaned, Fourier-transformed samples (B′n) and formation of the absolute value of the inverse-transformed samples (Cn).

## Claims

### Claim 1

Method for determining the envelope curve of a modulated input signal, comprising the steps of:
generating digital samples by digital sampling a modulated input signal,
generating Fourier-transformed samples by Fourier transforming the digital samples,
generating sideband-cleaned, Fourier-transformed samples by removing a range with negative frequencies or a range with positive frequencies from the Fourier-transformed samples,
generating inverse-transformed samples by inverse Fourier transforming the sideband-cleaned, Fourier-transformed samples and
forming values of the absolute value of the inverse-transformed samples.

### Claim 2 (depends on 1)

Method according to claim 1, comprising removing a level component at a zero frequency in addition to the range with the negative or positive frequencies in order to generate the sideband-cleaned, Fourier-transformed samples.

### Claim 3 (depends on 1)

Method according to claim 1 , comprising processing the inverse-transformed samples further only in such a limited range that a cyclic continuation, which is caused by the Fourier transform and inverse Fourier transform, is suppressed.

### Claim 4 (depends on 1)

Method according to claim 1, comprising logarithmizing the values of the absolute value relative to an effective value of the inverse-transformed samples.

### Claim 5 (depends on 4)

Method according to claim 4, comprising displaying the frequency distribution of the logarithmized values as a function of the logarithmized level complementary cumulative distribution function diagram.

### Claim 6 (depends on 1)

Digital storage medium with electronically readable control signals which can cooperate with a programmable computer or digital signal processor to implement the method according to claim 1.

### Claim 7 (depends on 1)

Computer program product with a program code stored on a machine-readable carrier in order to implement all the steps according to claim 1 when the program is run on a computer or a digital signal processor.

### Claim 8 (depends on 1)

Computer program with program code in order to implement all the steps according to claim 1 when the program is run on a computer or a digital signal processor.

### Claim 9 (depends on 1)

Computer program with program code in order to be able to implement all the steps according to claim 1 when the program is stored on a machine readable data carrier.
