Nothing Special   »   [go: up one dir, main page]

CN101827059A - Digital signal transmission method and system based on multi-carrier pseudorandom sequence - Google Patents

Digital signal transmission method and system based on multi-carrier pseudorandom sequence Download PDF

Info

Publication number
CN101827059A
CN101827059A CN 201010129099 CN201010129099A CN101827059A CN 101827059 A CN101827059 A CN 101827059A CN 201010129099 CN201010129099 CN 201010129099 CN 201010129099 A CN201010129099 A CN 201010129099A CN 101827059 A CN101827059 A CN 101827059A
Authority
CN
China
Prior art keywords
sequence
mrow
carrier
msup
optimal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN 201010129099
Other languages
Chinese (zh)
Other versions
CN101827059B (en
Inventor
王军
杨昉
何丽峰
杜邓宝
杨知行
王昭诚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CN 201010129099 priority Critical patent/CN101827059B/en
Publication of CN101827059A publication Critical patent/CN101827059A/en
Application granted granted Critical
Publication of CN101827059B publication Critical patent/CN101827059B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to digital signal transmission method and system based on a multi-carrier pseudorandom sequence. The method comprises the steps of: carrying out coding and modulation treatment on data to be transmitted to generate a data block to be transmitted; carrying out framing on the data block to be transmitted and a selected multi-carrier pseudorandom sequence to obtain a data frame to be transmitted; and carrying out digital-to-analogue conversion and RF (Radio Frequency) modulation treatment on the data frame to be transmitted and sending. The method and system can obtain the needed multi-carrier pseudorandom sequence used as data assistance with the least time and provides more accurate and reliable parameter estimation for digital signal transmission.

Description

Digital signal transmission method and system based on multi-carrier pseudorandom sequence
Technical Field
The invention relates to the technical field of digital information transmission, in particular to a digital signal transmission method and system based on a multi-carrier pseudorandom sequence.
Background
In digital communication systems, accurate and reliable parameter estimation is critical for data recovery. Common parameter estimation methods include blind estimation and Data Aided (DA) parameter estimation. The data-aided parameter estimation has the advantages of accurate estimation, rapidness, reliability, simple realization and the like, and is widely applied to a digital communication system.
A Training Sequence (TS) is auxiliary data, and a known Sequence is added to a transmission signal, and various transmission parameters can be estimated by the known Sequence at a receiving end. Common training sequences are PN (Pseudo-Noise) sequences, Golay sequences, Legendre sequences, CAZAC (Constant Amplitude zero auto-Correlation) sequences, and the like. These sequences generally have good autocorrelation properties and are simple to generate, and thus are widely used. Frequency domain Pilot (Pilot) is also a common auxiliary data, and known data is transmitted according to a certain pattern in the frequency domain of the transmitted signal, and can be used for estimating system parameters at the receiving end as well.
The maximum linear feedback shift register sequence (m sequence for short) is one of pseudo-random sequences and has many excellent properties (see the Cao Shi just, Qian Asian's modern communication principle, Beijing, Qinghua university Press, 1992). One typical application of m-sequences is TDS-OFDM (time domain orthogonal frequency division multiplexing digital transmission) technology, which has been adopted by the national standard for terrestrial digital television in china (GB20600-2006, frame structure, channel coding and modulation for digital television terrestrial broadcast transmission systems). TDS-OFDM adopts training sequence to fill protection interval, and frame header is composed of time domain binary m sequence and its cyclic extension, and can be used for quick synchronization and channel estimation.
Compared with the time domain binary sequence, the frequency domain binary sequence (Chinese patent: frequency domain channel estimation method based on binary all-pass sequence guard interval filling, Qinghua university, publication No. CN101102114) is easier to use for channel estimation. Fang Yang et al have demonstrated that frequency domain constant modulus sequences can achieve optimal Channel Estimation results (see "Transmission sequence Design for Low Complexity Channel Estimation in TransmitDiversability TDS-OFDM System", IEICE Transactions on Communications, vol. E92-B, No.6, pp.230g-2311, June 2009 for more details). Because only +1 and-1 exist in the frequency domain, the receiving end can complete channel estimation without division operation, thereby greatly reducing the complexity of a channel estimation module.
The sequence obtained by discrete Fourier transform of the frequency domain sequence is called a multi-carrier pseudo random sequenceIn the Multi-Carrier Pseudo-Noise (PN-MC), the Multi-Carrier Pseudo-random sequence is a binary sequence with excellent properties in the discrete fourier transform domain, and simultaneously inherits the advantages of Multi-Carrier communication. In practical application, it is generally desirable that the multi-carrier pseudorandom sequence has good power peak-to-average ratio property, autocorrelation property and the like. If the search is carried out by the traversal method, the multi-carrier pseudorandom sequence with the length of N coexists 2NOne possible sequence, the search quantity is O (2)N). Taking the length of 256 sequences as an example, the search amount reaches 1077In the order of magnitude, current computers are not possible to implement at all.
Disclosure of Invention
Technical problem to be solved
The technical problem to be solved by the invention is as follows: the required multi-carrier pseudo-random sequence is obtained in a minimum time as data assistance to provide more accurate and reliable parameter estimation for digital signal transmission.
(II) technical scheme
In order to achieve the purpose, the invention adopts the following technical scheme.
The invention provides a digital signal transmission method based on a multi-carrier pseudorandom sequence, which comprises the following steps:
s1, coding and modulating data to be transmitted to generate a data block to be transmitted;
s2, framing the data block to be transmitted and the selected multi-carrier pseudorandom sequence to obtain a data frame to be transmitted;
and S3, performing digital-to-analog conversion and radio frequency modulation processing on the data frame to be transmitted and transmitting the data frame.
The framing method in step S2 includes: filling a guard interval of the data block to be transmitted with at least one of the multi-carrier pseudorandom sequences; or using at least one multi-carrier pseudo random sequence as a preamble sequence of the data block to be transmitted.
The multi-carrier pseudorandom sequence is a sequence obtained by performing inverse discrete Fourier transform on a binary sequence.
The method for selecting the multi-carrier pseudo-random sequence comprises the following steps:
s2.1 order the discrete Fourier transform of the multi-carrier pseudorandom sequence to sequence C, divide said sequence C into K segments, in turn denoted C1,C2,...,CKThe values of the initialization sequence C are all 0, wherein the length of the multi-carrier pseudorandom sequence is N, and K is any positive integer smaller than N;
s2.2 let i equal 1, C1At { alpha1,α2Taking values in the sequence C ' to obtain a new sequence C ', performing N-point discrete Fourier inverse transformation on the new sequence C ' to obtain a multi-carrier pseudorandom sequence, calculating a parameter to be examined of the multi-carrier pseudorandom sequence according to an optimal sequence selection criterion, and traversing all possible C1Obtaining the multi-carrier pseudo-random sequence with the optimal parameter to be inspected, and recording the corresponding sequence C1Wherein i is more than or equal to 1 and less than or equal to K, | alpha1|=|α2|;
S2.3 let i ═ i +1, sequence C fixed1,C2,...,Ci-1,CiAt { alpha1,α2Taking value in the place, and taking value of C1,C2,...,Ci-1,CiInserting sequence C to form new sequence C ', performing N-point discrete Fourier inverse transformation on the new sequence C' to obtain multi-carrier pseudo-random sequence, calculating the parameter to be examined of the multi-carrier pseudo-random sequence according to the optimal sequence selection criterion, and traversing all possible CiObtaining the multi-carrier pseudo-random sequence with the optimal parameter to be inspected, and recording the corresponding CiAnd an optimal parameter P to be examined0
S2.4 successively re-traversing the first i sequences and fixing C1-CiRemoving C injAll sequences except for, go through all possible CjIf the obtained optimal parameter to be examined is better than P0Then the optimal parameter to be examined and the corresponding sequence C are updatedjWherein j is more than or equal to 1 and less than or equal to i;
s2.5 if i ═ K, then step S2.6 is performed, otherwise, step S2.3 is returned to;
s2.6 selecting C currently1,C2,...,CKSplicing into a binary sequence with the length of N, carrying out N-point discrete Fourier inverse transformation on the binary sequence, and outputting the obtained multi-carrier pseudo-random sequence as a selected multi-carrier pseudo-random sequence.
The multi-carrier pseudorandom sequence is a sequence obtained by expanding or truncating an m sequence and then performing inverse discrete Fourier transform.
Wherein the expansion method comprises the following steps: cyclic extension, copying the end several bit symbols of the m sequence to the front of the m sequence; or zero padding expansion, wherein a plurality of zero symbols are respectively padded at the front end and the tail end of the m sequence; or insert zero-symbol extensions in the sequence according to a known pattern.
The method for selecting the multi-carrier pseudo-random sequence comprises the following steps:
s2.1' selecting the length of the multi-carrier pseudo-random sequence as N, determining the order K of the m sequence to meet the requirement
Figure GSA00000059525300041
Or
Figure GSA00000059525300042
Wherein,
Figure GSA00000059525300043
and
Figure GSA00000059525300044
respectively representing a down rounding and an up rounding;
s2.2' sequentially selecting a generator polynomial and an initial phase of the m sequence to generate an m sequence;
s2.3', mapping the generated m sequence into a binary phase shift keying symbol, and expanding or truncating to form a symbol sequence with the length of N;
s2.4' performing N-point discrete Fourier inverse transformation on the symbol sequence to obtain a multi-carrier pseudorandom sequence with the length of N;
s2.5 'according to an optimal sequence selection criterion, calculating a parameter to be checked of the multi-carrier pseudorandom sequence obtained in the step S2.4', and recording the multi-carrier pseudorandom sequence and the parameter value to be checked;
s2.6 ' judging whether all the generating polynomials and all the initial phases are traversed, if so, executing the step S2.7 ', otherwise, returning to execute the step S2.2 ';
s2.7' according to the optimal sequence selection criterion, selecting the optimal parameter to be examined from all the obtained parameters to be examined, and outputting the corresponding multi-carrier pseudo-random sequence as the selected multi-carrier pseudo-random sequence.
Wherein the optimal sequence selection criterion comprises:
the minimum criterion of the peak-to-average power ratio, the parameter to be considered is the PAPR of the sequence, and the PAPR of the sequence c (n) is:
<math><mrow><mi>PAPR</mi><mo>=</mo><munder><mi>max</mi><mrow><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mrow></munder><mrow><mo>(</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>/</mo><mfrac><mn>1</mn><mi>N</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo>|</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo><mo>;</mo></mrow></math> or
The maximum criterion of partial quality factor of aperiodic autocorrelation, the parameter to be examined is partial quality factor F of aperiodic autocorrelation of sequencepartPartial quality factor F of the aperiodic autocorrelation of the sequence c (n)partThe method comprises the following steps:
<math><mrow><msub><mi>F</mi><mi>part</mi></msub><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mo>-</mo><mn>3</mn><mo>,</mo><mo>-</mo><mn>2</mn><mo>,</mo><mo>-</mo><mn>1,1,2,3</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is a non-periodic autocorrelation of the sequence c (n), and
<math><mrow><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mfenced open='{' close=''><mtable><mtr><mtd><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn><mo>-</mo><mi>n</mi></mrow></munderover><mi>c</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>&CenterDot;</mo><msup><mi>c</mi><mo>*</mo></msup><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mtd></mtr><mtr><mtd><msup><mi>R</mi><mo>*</mo></msup><mrow><mo>(</mo><mo>-</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mo>-</mo><mi>N</mi><mo>&lt;</mo><mi>n</mi><mo>&lt;</mo><mn>0</mn></mtd></mtr></mtable></mfenced><mo>;</mo></mrow></math> or
The maximum criterion of the quality factor of the aperiodic autocorrelation of the discrete fourier transform, the parameter to be considered is the quality factor of the aperiodic autocorrelation of the sequence, and the quality factor MF of the aperiodic autocorrelation of the sequence (c), (n) is:
<math><mrow><mi>MF</mi><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>&NotEqual;</mo><mn>0</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is the aperiodic autocorrelation of sequence c (n); or
The maximum criterion of the ratio of the quality factor of the non-periodic autocorrelation part to the peak-to-average power ratio is as follows: p ═ Fpartthe/PAPR; or
The maximum ratio of the non-periodic autocorrelation quality factor of the discrete fourier transform to the peak-to-average power ratio is determined as follows: p ═ MF/PAPR; or
The maximum product criterion of the quality factor of the aperiodic autocorrelation part and the aperiodic autocorrelation quality factor of the discrete Fourier transform is as follows: p ═ FpartMF; or
Power peak-to-average ratio, aperiodic autocorrelation part quality factor and aperiodic autocorrelation quality factor compromise criterion of discrete Fourier transform, wherein the parameter to be considered is P ═ FpartMF/PAPR, choose the multicarrier pseudorandom sequence with the maximum P.
The invention also provides a digital signal transmission system based on the multi-carrier pseudo-random sequence, which comprises: the coding modulation module is used for coding and modulating data to be transmitted to generate a data block to be transmitted; the sequence generation module generates a required multi-carrier pseudo-random sequence; the framing module is used for framing the data block to be transmitted and the selected multi-carrier pseudorandom sequence to obtain a data frame to be transmitted; and the back-end processing module is used for carrying out digital-to-analog conversion and radio frequency modulation processing on the data frame to be transmitted and sending the data frame.
(III) advantageous effects
The method and the system are based on the multi-carrier pseudorandom sequence, the sequence has good peak-to-average ratio characteristic, has good autocorrelation property in both a time domain and a discrete Fourier transform domain, and can provide accurate and reliable channel estimation for digital signal transmission; in addition, according to the optimal sequence selection method in the method, the sequences with the optimal actually-required properties can be quickly obtained through less search quantity, and the search quantity is only O (M & 2)N/M) M is the number of segments into which the sequence is divided; according to the method, a multi-carrier pseudo-random sequence can be constructed by expanding or truncating a binary m sequence and then carrying out inverse discrete Fourier transform, and a sequence with optimal property is selected from all m sequence sets, so that the search amount is greatly reduced, the multi-carrier pseudo-random sequence with better property can be obtained, and various advantages of the m sequence are inherited; the multi-carrier pseudorandom sequence obtained by the method can be applied to various transmission systems as a training sequence, and reliable and accurate parameter estimation is provided.
Drawings
Fig. 1 is a flow chart of a method for transmitting a digital signal based on a multi-carrier pseudo-random sequence according to an embodiment of the present invention;
fig. 2 is a flowchart of a method for optimally selecting a multi-carrier pseudo random sequence in a method for transmitting digital signals based on the multi-carrier pseudo random sequence according to an embodiment of the present invention;
fig. 3 is a flowchart of a method for constructing and selecting a multi-carrier pseudorandom sequence based on m-sequence set in a method for transmitting a digital signal based on a multi-carrier pseudorandom sequence according to an embodiment of the present invention;
FIG. 4 is a block diagram of a digital signal transmission system based on a multi-carrier pseudorandom sequence in accordance with one embodiment of the present invention;
fig. 5(a) is a time domain module value of a PN-MC sequence with a length of 256 under the optimal criterion of power peak-to-average ratio obtained by the optimal selection method for segmentation in embodiment 1;
fig. 5(b) is a non-periodic autocorrelation result of a PN-MC sequence with a length of 256 under the optimal criterion of power peak-to-average ratio obtained by the optimal selection method for segmentation in embodiment 1;
fig. 5(c) is a non-periodic autocorrelation result of a PN-MC sequence discrete fourier transform with a length of 256 under the optimal criterion of power peak-to-average ratio obtained by the optimal selection method for segmentation in embodiment 1;
FIG. 6 is a diagram showing a signal frame structure according to embodiment 1;
FIG. 7(a) is the time domain modulus of the PN-MC sequence with length 512 under the optimal criterion of the peak-to-average power ratio in example 2;
FIG. 7(b) is the result of non-periodic autocorrelation of PN-MC sequence with length 512 under the optimal criterion of peak-to-average power ratio in example 2;
FIG. 7(c) is the result of aperiodic autocorrelation of discrete Fourier transform of PN-MC sequence with length 512 under the optimal criterion of peak-to-average power ratio in example 2;
FIG. 8(a) is the time domain modulus of a PN-MC sequence with length of 128 under the criterion of optimal autocorrelation quality partial factor in example 2;
FIG. 8(b) is the result of non-periodic autocorrelation of PN-MC sequence with length of 128 under the criterion of optimal autocorrelation quality partial factor in example 2;
FIG. 8(c) is the result of aperiodic autocorrelation of the discrete Fourier transform of PN-MC sequence with length of 128 under the criterion of optimal autocorrelation quality partial factor in example 2;
FIG. 8(d) is a partial amplification result of the PN-MC sequence of FIG. 8(b) near the correlation peak of the aperiodic autocorrelation result;
FIG. 9 is a diagram showing a signal frame structure according to embodiment 2;
fig. 10 is a schematic diagram of a signal frame structure in embodiment 3.
Detailed Description
The digital signal transmission method and system based on multi-carrier pseudo random sequence (PN-MC sequence) proposed by the invention are described in detail with reference to the accompanying drawings and embodiments.
As shown in fig. 1, a method for transmitting a digital signal based on a multi-carrier pseudo random sequence according to an embodiment of the present invention includes the steps of:
s1, carrying out coding, modulation and other processing on data to be transmitted to generate a data block to be transmitted;
the data block to be transmitted may be a single-carrier data block, a multi-carrier data block, and a generalized data block, that is, a data block formed by a single-carrier data block or a multi-carrier data block and a guard interval thereof, or a combination of one or more data blocks.
S2, framing the data block to be transmitted and the selected PN-MC sequence to obtain a data frame to be transmitted;
methods of framing include, but are not limited to: filling a guard interval of a data block to be transmitted with one or more PN-MC sequences; one or more PN-MC sequences are used as preamble sequences for the data blocks to be transmitted.
And S3, carrying out digital-to-analog conversion, radio frequency modulation and other back-end processing on the data frame to be transmitted and sending the data frame.
The PN-MC sequence is obtained by performing inverse discrete Fourier transform on any binary sequence. In order to obtain a PN-MC sequence with optimal properties by a small amount of search, as shown in fig. 2, a PN-MC sequence selection method includes the steps of:
s2.1, the length of the selected PN-MC sequence is N, and the discrete Fourier transform is segmented and initialized, specifically: recording the discrete Fourier transform of PN-MC sequence to sequence C, dividing the sequence C with length N into K segments, and recording them in turnTo C1,C2,...,CKThe initialized C sequence has all values of 0, preferably, C1,C2,...,CK-1The lengths of the two pieces of the rubber are L,CKthe length is N- (K-1) L,
Figure GSA00000059525300082
represents rounding down;
s2.2, recording i as 1, traversing the first segment sequence, and selecting a criterion according to the most ordered sequence to obtain the first segment sequence with the optimal parameters to be examined; the method specifically comprises the following steps: let sequence C1At { alpha1,α2Taking values in the sequence to obtain a new sequence C ', performing N-point discrete Fourier inverse transformation on the new sequence C' to obtain a PN-MC sequence, calculating a parameter to be examined of the sequence according to an optimal sequence selection criterion, and traversing all possible C1Obtaining the PN-MC sequence with the optimal parameter to be examined, and recording the corresponding sequence C1Wherein i is more than or equal to 1 and less than or equal to K, | alpha1|=|α2|;
S2.3, recording i as i +1, fixing the previous i-1 segment sequence for i > 1, traversing the ith segment sequence to obtain the ith end sequence with the optimal parameter to be examined, and recording the optimal parameter value to be examined; the method specifically comprises the following steps: for the ith (i > 1) segment sequence CiThe fixed sequence C1,C2,...,Ci-1Let CiAt { alpha1,α2Taking value in the place, and taking value of C1,C2,...,Ci-1,CiInserting sequence C to form new sequence C ', performing N-point discrete Fourier inverse transformation on the new sequence C' to obtain PN-MC sequence, calculating the parameter to be examined of the sequence according to the optimal sequence selection criterion, and traversing all possible CiObtaining the optimal PN-MC sequence of the parameter to be examined, and recording the corresponding CiAnd an optimal parameter P to be examined0
S2.4 sequentially re-traversing the previous i sequences and updating the optimal parameters to be examined and pairsThe corresponding sequence; the method specifically comprises the following steps: fixed C1-CiRemoving C injAll sequences except for, go through all possible CjIf the obtained optimal parameter to be examined is better than P0Then the corresponding sequence C is updatedjAnd the optimal parameter to be examined, wherein j is more than or equal to 1 and less than or equal to i;
s2.5 if i ═ K, then step S2.6 is performed, otherwise, step S2.3 is returned to;
s2.6, ending the search and selecting the currently selected C1,C2,...,CKSplicing into a binary sequence with the length of N, carrying out N-point discrete Fourier inverse transformation on the binary sequence, and outputting the obtained PN-MC sequence as a selected PN-MC sequence.
In addition, the PN-MC sequence can also be a sequence obtained by expanding or truncating the m sequence and then performing inverse discrete Fourier transform. At this time, in order to obtain a PN-MC sequence with optimal properties, as shown in fig. 3, the method for selecting a PN-MC sequence includes the steps of:
s2.1' selecting the length of the PN-MC sequence as N, determining the order K of the m sequence to satisfy
Figure GSA00000059525300091
Or
Figure GSA00000059525300093
Wherein,
Figure GSA00000059525300094
and
Figure GSA00000059525300095
respectively representing a down rounding and an up rounding;
s2.2' sequentially selecting a generator polynomial and an initial phase of the m sequence to generate an m sequence;
s2.3', mapping the generated m sequence into a binary phase shift keying symbol, and expanding or truncating to form a symbol sequence with the length of N;
extensions include, but are not limited to: cyclic extension, namely copying a plurality of bit symbols at the tail of the sequence to the front of the sequence; or zero padding extension, namely respectively padding a plurality of zero symbols at the front end and the tail end of the sequence; or by inserting zero symbols in the sequence according to a known pattern.
S2.4' performing N-point discrete Fourier inverse transformation on the symbol sequence to obtain a PN-MC sequence with the length of N;
s2.5 'according to the optimal sequence selection criterion, calculating the parameter to be checked of the PN-MC sequence obtained in the step S2.4', and recording the PN-MC sequence and the parameter value to be checked;
s2.6 ' judging whether all the generating polynomials and all the initial phases are traversed, if so, executing the step S2.7 ', otherwise, returning to execute the step S2.2 ';
and S2.7' finishing the search, selecting the optimal parameter to be examined from all the obtained parameters to be examined according to the optimal sequence selection criterion, and outputting the corresponding multi-carrier pseudo-random sequence as the selected multi-carrier pseudo-random sequence.
The optimal sequence selection criteria mentioned in the two methods for selecting PN-MC sequences include, but are not limited to:
the parameter to be considered is a Peak-to-Average Power Ratio (PAPR) of the sequence, and the PAPR of the sequence (c) (n) is:
<math><mrow><mi>PAPR</mi><mo>=</mo><munder><mi>max</mi><mrow><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mrow></munder><mrow><mo>(</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>/</mo><mfrac><mn>1</mn><mi>N</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo>|</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo><mo>;</mo></mrow></math>
partial quality Factor maximum criterion of aperiodic autocorrelation, and the parameter to be examined is Partial quality Factor (Partial Merit Factor) F of aperiodic autocorrelation of the sequencepartPartial quality factor F of the aperiodic autocorrelation of the sequence c (n)partThe method comprises the following steps:
<math><mrow><msub><mi>F</mi><mi>part</mi></msub><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mo>-</mo><mn>3</mn><mo>,</mo><mo>-</mo><mn>2</mn><mo>,</mo><mo>-</mo><mn>1,1,2,3</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is a non-periodic autocorrelation of the sequence c (n), and
<math><mrow><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mfenced open='{' close=''><mtable><mtr><mtd><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn><mo>-</mo><mi>n</mi></mrow></munderover><mi>c</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>&CenterDot;</mo><msup><mi>c</mi><mo>*</mo></msup><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mtd></mtr><mtr><mtd><msup><mi>R</mi><mo>*</mo></msup><mrow><mo>(</mo><mo>-</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mo>-</mo><mi>N</mi><mo>&lt;</mo><mi>n</mi><mo>&lt;</mo><mn>0</mn></mtd></mtr></mtable></mfenced><mo>;</mo></mrow></math> or
The maximum criterion of the quality factor of the aperiodic autocorrelation of the discrete fourier transform, the parameter to be considered is the quality factor of the aperiodic autocorrelation of the sequence, and the quality factor MF of the aperiodic autocorrelation of the sequence (c), (n) is:
<math><mrow><mi>MF</mi><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>&NotEqual;</mo><mn>0</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is the aperiodic autocorrelation of sequence c (n);
or compromise the three criteria in the three parameters of the power peak-to-average ratio, the autocorrelation part quality factor and the discrete Fourier transform autocorrelation quality factor:
the maximum criterion of the ratio of the quality factor of the non-periodic autocorrelation part to the peak-to-average power ratio is as follows: p ═ Fpartthe/PAPR; or
The maximum ratio of the non-periodic autocorrelation quality factor of the discrete fourier transform to the peak-to-average power ratio is determined as follows: p ═ MF/PAPR; or
The maximum product criterion of the quality factor of the aperiodic autocorrelation part and the aperiodic autocorrelation quality factor of the discrete Fourier transform is as follows: p ═ FpartMF; or
Power peak-to-average ratio, aperiodic autocorrelation part quality factor and aperiodic autocorrelation quality factor compromise criterion of discrete Fourier transform, wherein the parameter to be considered is P ═ FpartMF/PAPR, choose the multicarrier pseudorandom sequence with the maximum P.
As shown in fig. 4, the digital signal transmission system based on multi-carrier pseudo random sequence according to an embodiment of the present invention comprises: the encoding modulation module is used for encoding, modulating and the like the data to be transmitted to generate a data block to be transmitted; the sequence generation module generates a required multi-carrier pseudo-random sequence; the framing module is used for framing the data block to be transmitted and the selected PN-MC sequence to obtain a data frame to be transmitted; and the post-processing module is used for performing post-processing such as digital-to-analog conversion, radio frequency modulation and the like on the data frame to be transmitted and sending the data frame.
Example 1
This embodiment specifically describes a method for selecting a PN-MC sequence in the method of the present invention and a method for transmitting digital signals based on the optimal PN-MC sequence, taking a PN-MC with a length of 256 as an example. The PN-MC sequence is obtained by performing inverse discrete Fourier transform on any binary sequence with the value of +/-1, and the time domain power peak-to-average ratio criterion is taken as an optimal sequence selection criterion, and the method specifically comprises the following steps:
s101, selecting the length N of a PN-MC sequence to be 256, dividing the discrete Fourier transform C of the PN-MC into 16 equal segments, and recording the 16 segments as C1,C2,......,C16Each length L is 16, and all elements of the initialization C sequence take values of 0;
s102, recording i as 1, and ordering sequence C1Taking value in +/-1 to obtain new sequence C ', making 256-point discrete Fourier inverse transform on the sequence C' to obtain PN-MC sequence, calculating power peak-to-average ratio of said PN-MC sequence, and traversing all possible C1Finding out the PN-MC sequence with the minimum peak-to-average power ratio, and recording the corresponding sequence C1
S103. for i > 1, for the ith segment sequence CiThe fixed sequence C1,...,Ci-1Sequence C ofiTaking values in { +/-1 }, adding C1,...,Ci-1,CiInserting C to form a new sequence C', obtaining PN-MC sequence through 256-point discrete Fourier inverse transformation, calculating power peak-to-average ratio of the PN-MC sequence, and traversing all possible CiSearching the PN-MC sequence with the minimum power peak-to-average ratio and recording the corresponding sequence CiAnd minimum power peak-to-average ratio (PAPR)0
And S104, sequentially traversing the previous i sequences again and updating. Fixed C1~CiRemoving C inj(1. ltoreq. j. ltoreq. i) all sequences, traverse CjAll possible values, if the obtained optimal parameter value is better than P0Then the corresponding sequence C is updatedjAnd an optimum parameter value P0
S105, if i is 16, executing step S106, otherwise, returning i +1 to step S103;
s106, ending the search and outputting the optimal PN-MC sequence. C searched currently1,C2,......,CKSplicing into a binary sequence with the length of 256, and performing 256-point discrete Fourier inverse transformation to output as the optimal PN-MC sequence.
The PN-MC sequence with a length of 256 obtained by the above-described piecewise optimization method is shown in table 1, the time domain modulus thereof is shown in fig. 5(a), the aperiodic autocorrelation result is shown in fig. 5(b), and the aperiodic autocorrelation result of the discrete fourier transform is shown in fig. 5 (c). PN-MC sequences of lengths 128 and 192 can be obtained in the same way, the results of which are shown in table 1.
TABLE 1 PN-MC sequence with lowest power peak-to-average ratio obtained by piecewise optimization method
Length of sequence Peak to average power ratio Discrete Fourier transform of PN-MC sequence (where 1 represents +1 and 0 represents-1)
128 1.8664 10100001011010011101100111001010110011011101001110000001001101011100000100101100011001001011101001001111110011110110100000011010
192 1.9409 1100000110111111101100101100110011101110001101101011
11010001010110001011101100011011110111001011100101111011111111100101000111011100110010100000100000100010011011001011110011010110100000011010
256 2.0324 0011011010101001100001100001110010000100000100011110100100010000100100000101001011111110110101101010011111111101011100010001011101100001101001101101010100001110010110101111111101001111010001000001111100000010011101100011111010100111000100111100100111000110
The digital signal transmission method applying the PN-MC sequence with the optimal power peak-to-average ratio comprises the following specific steps:
s1, encoding and constellation mapping data to be transmitted to generate a single carrier data block;
s2, inserting 1 PN-MC sequence with the optimal power peak-to-average ratio and the length of 512 into the guard interval of the single carrier data block to form a signal frame with the guard interval filled with a training sequence, wherein the structure of the signal frame is shown in FIG. 6;
and S3, post-processing the signal frame in the step S2 and sending out the signal frame.
Example 2
The embodiment specifically describes the structure and selection method of PN-MC sequence under the criterion of optimal autocorrelation quality factor of discrete fourier transform, and the digital signal transmission method of PN-MC sequence based on optimal autocorrelation quality factor of discrete fourier transform, taking PN-MC sequence with length of 256 as an example. The PN-MC selection method under the autocorrelation quality factor optimal criterion of the discrete Fourier transform comprises the following specific steps:
s201, selecting the length of a PN-MC sequence to be 256, and the order of an m sequence to be 8;
s202, selecting a generating polynomial and an initial phase generated by an 8-order m sequence, wherein the 8-order m sequence has 16 generating polynomials and 255 initial phases, and constructing an m sequence (PN (k)) }with the length of 255 according to the generating polynomial and the initial phase0 254
S203.m sequence is modulated by Binary Phase Shift Keying (BPSK) and is circularly expanded by 1 bit to form a sequence (C (k)) with the length of 2560 255
S204.{C(k)}0 255Obtaining a sequence PN-MC sequence { C (n) }through 256-point discrete Fourier inverse transformation0 255
c(n)=IDFT256(C(k)),n=0,1,...,255
Wherein IDFT256(. cndot.) represents a 256-point discrete Fourier inverse transform.
S105, calculating the non-periodic autocorrelation of the discrete Fourier transform c (n) of the PN-MC sequence;
<math><mrow><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mfenced open='{' close=''><mtable><mtr><mtd><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mn>255</mn><mo>-</mo><mi>n</mi></mrow></munderover><mi>c</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>&CenterDot;</mo><msup><mi>c</mi><mo>*</mo></msup><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mn>256</mn></mtd></mtr><mtr><mtd><msup><mi>R</mi><mo>*</mo></msup><mrow><mo>(</mo><mo>-</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mo>-</mo><mn>256</mn><mo>&lt;</mo><mi>n</mi><mo>&lt;</mo><mn>0</mn></mtd></mtr></mtable></mfenced></mrow></math>
from R (n) the autocorrelation quality factor of the sequence c (n) can be calculated,
<math><mrow><mi>MF</mi><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>&NotEqual;</mo><mn>0</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
s206, judging whether all the generator polynomials and all the initial phases have been traversed or not, if not, returning to S202, and if so, jumping to S207;
and S207, selecting the PN-MC sequence with the maximum autocorrelation quality factor of the discrete Fourier transform as the optimal sequence under the autocorrelation quality factor optimal criterion of the discrete Fourier transform and outputting the optimal sequence.
The optimal PN-MC sequence of length 256 selected according to the above procedure corresponds to two m-sequences as shown in table 2. TABLE 2 DFT autocorrelation Q-optimal PN-MC sequences
Figure GSA00000059525300143
x9+x8+x7+x5+x3+x2 1100011100
TABLE 3 optimal power peak-to-average ratio PN-MC sequence
Length of sequence Minimum power peak-to-average ratio m sequence generator polynomial Initial phase
128 2.1250 x6+x5+x2+1 1001001
256 2.3556 x7+x5+x4+x2+1 11000111
512 2.4668 x8+x6+x5+x2+x1+1 010101111
1024 2.6318 x9+x7+x5+x3+x1+1 0101000110
TABLE 4 PN-MC sequence with optimal quality factor for the autocorrelation part
Length of sequence Maximum autocorrelation partial quality factor m sequence generator polynomial Initial phase
128 2733 x6+1 0000010
256 9000 x7+x3+x2+x1+1 11000100
512 35056 x8+x6+x5+x3 001001000
1024 127710 x9+x6+x2+1 0110000111
Comparing table 1 and table 3, it can be seen that the results of the search limited to m-sequences are worse than those of the search in all possible sequences, but the search is less, and at the same time some excellent properties of m-sequences can be inherited.
In table 3, the time domain modulus, the aperiodic autocorrelation and the aperiodic autocorrelation of the discrete fourier transform of the optimal PN-MC sequence with length 512 are shown in fig. 7(a) -7(c), respectively.
The time domain modulus, the aperiodic autocorrelation of the discrete fourier transform, and the local amplification near the correlation peak of the optimal PN-MC sequence with length 128 in table 4 are shown in fig. 8(a) -8(c), respectively.
The digital signal transmission method of the PN-MC with the optimal autocorrelation quality factor by applying the discrete Fourier transform comprises the following specific steps:
s1, encoding data to be transmitted, constellation mapping and OFDM modulation are carried out, and an OFDM data block is generated;
s2, inserting 2 same optimal PN-MC sequences with the length of 256 into a guard interval of an OFDM data block to form a signal frame of which the guard interval is filled with a training sequence, wherein the structure of the signal frame is shown in FIG. 9;
and S3, post-processing the signal frame in the S2 and sending out the signal frame.
Example 3
This embodiment takes PN-MC with length 420 as an example, and specifies the optimal sequence selection method when multiple criteria are considered together. For example, the PN-MC sequence is expected to have low time-domain power peak-to-average power ratio and good autocorrelation of discrete fourier transform, a parameter a to be examined may be defined as MF/PAPR, and the PN-MC with the largest a is selected as the optimal sequence; or the PN-MC sequence is expected to have good autocorrelation in both the time domain and the discrete fourier transform domain, and the parameter B to be examined can be defined as MF · FpartAnd selecting the PN-MC sequence with the maximum B as an optimal sequence. The method comprises the following steps of constructing a PN-MC sequence with the length of 420 by zero padding and expansion of an m sequence by taking low time domain power peak-to-average ratio and good discrete Fourier transform autocorrelation as an optimal sequence selection criterion, wherein the steps specifically comprise:
s301, selecting the length of a PN-MC sequence to be 420, and selecting the order of an m sequence to be 8;
s302, sequentially selecting a generator polynomial and an initial phase of the m sequence; constructing m-sequence { PN (k) }with length of 255 according to the generator polynomial and the initial phase0 254
S303.m sequence is BPSK modulated and then is processed at the front end and the endThe tails complement 82 and 83 symbols of 0, respectively, to obtain a sequence of length 420 { C (k) }0 419
S304.{C(k)}0 419Obtaining a sequence { C (n) }through 420-point discrete Fourier inverse transformation0 419
c(n)=IDFT420(C(k)),n=0,1,...,419
Wherein IDFT420(. cndot.) represents a 420-point discrete Fourier inverse transform.
S305, calculating the PAPR of the sequence c (n) and the quality factor MF of the non-periodic autocorrelation of the sequence C (k), defining A as MF/PAPR, and calculating the A value of PN-MC;
s306, judging whether all generating polynomials and all initial phases of the 8-order m sequence have been traversed currently, if so, jumping to the step 307, otherwise, returning to the step 302;
and S307, selecting the PN-MC sequence with the maximum parameter A as the optimal sequence under the optimal implementation criterion and outputting the optimal sequence.
The optimal PN-MC sequences with the length of 420 searched by the steps are two in total, and the generator polynomial and the initial phase corresponding to the m sequence are x respectively7+x4+x2+1,11101001,x7+x6+x4+x211111000, the power peak-to-average ratio is 2.6797 and the autocorrelation quality factor of the discrete fourier transform is 3.5685.
The digital signal transmission method applying the optimal PN-MC comprises the following specific steps:
s1, encoding, constellation mapping and OFDM modulation are carried out on data to be transmitted to generate an OFDM data block, and the last L symbols of the OFDM data block are copied to the front of the data block to form a CP-OFDM (cyclic prefix OFDM) data block;
s2, inserting 4 same self-correlation part quality optimal PN-MC sequences with the length of 420 into the front of M CP-OFDM data blocks to serve as a leading sequence of a signal frame, wherein the structure of the signal frame is shown in figure 10;
and S3, post-processing the signal frame in the step S2 and sending out the signal frame.
Example 4
In this embodiment, a PN-MC with a length of 420 is constructed by m-sequence truncation, and the optimal sequence selection criteria include low time-domain power peak-to-average power ratio, large aperiodic autocorrelation part quality factor, and large aperiodic autocorrelation quality factor of discrete fourier transform, and specifically include the following steps:
s401, selecting the length of a PN-MC sequence as 420, and selecting the order of an m sequence as 9;
s402, sequentially selecting a generator polynomial and an initial phase of the m sequence; constructing m-sequence (PN (k)) with length 511 according to the generator polynomial and the initial phase0 510
The m sequence is BPSK modulated, and the first 420 symbols are intercepted to obtain a sequence (C (k)) with the length of 4200 419
S404.{C(k)}0 419Obtaining a sequence { C (n) }through 420-point discrete Fourier inverse transformation0 419
c(n)=IDFT420(C(k)),n=0,1,...,419
Wherein IDFT420(. cndot.) represents a 420-point discrete Fourier inverse transform.
S405, calculating the PAPR of the power peak-to-average power ratio (PAPR) of the sequence c (n) and a partial quality factor F of the non-periodic autocorrelationpartAnd C (k) an aperiodic autocorrelation quality factor MF, defining the parameter A ═ MF · FpartThe PAPR calculates the parameter A value of the PN-MC;
s406, judging whether all generating polynomials and all initial phases of the 9-order m-sequence have been traversed currently, if so, jumping to S407, otherwise, returning to S402;
and S407, selecting the PN-MC sequence with the maximum parameter A as the optimal sequence under the optimal implementation criterion and outputting the optimal sequence.
The generator polynomial of m sequence corresponding to the optimal PN-MC sequence with the length of 420 searched by the steps is x8+x7+x5+x4+x2+x1The initial phase is 100100001, the power peak-to-average ratio is 2.3525, the autocorrelation portion quality factor is 996.2265, and the autocorrelation quality factor of the discrete fourier transform is 2.6164.
Example 5
In this embodiment, a PN-MC with a length of 420 is constructed in a spreading manner in which zero symbols are filled in an m-sequence according to a known pattern, and the lowest peak-to-average power ratio of the time domain is used as an optimal sequence selection criterion, which specifically includes the following steps:
s501, selecting the length of a PN-MC sequence to be 420, and selecting the order of an m sequence to be 8;
s502, sequentially selecting a generator polynomial and an initial phase of the m sequence, and constructing the m sequence { PN (k) }with the length of 255 according to the generator polynomial and the initial phase0 254
S503.m sequence is BPSK modulated, a known pattern is taken, the m sequence after BPSK modulation is inserted into a null symbol with the length of 420, and the sequence with the length of 420 { C (k) }is obtained0 419I.e. by
<math><mrow><mi>C</mi><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow><mo>=</mo><mfenced open='{' close=''><mtable><mtr><mtd><mn>1</mn><mo>-</mo><mn>2</mn><mo>&CenterDot;</mo><mi>PN</mi><mrow><mo>(</mo><msup><mi>S</mi><mrow><mo>-</mo><mn>1</mn></mrow></msup><mrow><mo>(</mo><mi>k</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mi>k</mi><mo>&Element;</mo><mi>S</mi></mtd></mtr><mtr><mtd><mn>0</mn><mo>,</mo></mtd><mtd><mi>k</mi><mo>&NotElement;</mo><mi>S</mi></mtd></mtr></mtable></mfenced><mo>;</mo></mrow></math>
Wherein S is a subscript set of m sequences inserted into empty symbols, and is denoted by S-1(k) N satisfies k s (n).
S504.{C(k)}0 419Obtaining a sequence { c (n) }through 420-point discrete Fourier inverse transformation0 419
c(n)=IDFT420(C(k)),n=0,1,...,419
Wherein IDFT420(. cndot.) represents a 420-point discrete Fourier inverse transform.
S505, calculating the PAPR of the sequence c (n), and recording c (n) and the corresponding PAPR;
s506, judging whether all generating polynomials and all initial phases of the 8-order m-sequence have been traversed currently, if so, jumping to the step 607, otherwise, returning to the step 602;
and S507, selecting the PN-MC sequence with the minimum PAPR as the optimal sequence under the optimal criterion of the implementation and outputting the optimal sequence.
The above embodiments are only for illustrating the invention and are not to be construed as limiting the invention, and those skilled in the art can make various changes and modifications without departing from the spirit and scope of the invention, therefore, all equivalent technical solutions also belong to the scope of the invention, and the scope of the invention is defined by the claims.

Claims (9)

1. A method for transmitting a digital signal based on a multi-carrier pseudorandom sequence, the method comprising the steps of:
s1, coding and modulating data to be transmitted to generate a data block to be transmitted;
s2, framing the data block to be transmitted and the selected multi-carrier pseudorandom sequence to obtain a data frame to be transmitted;
and S3, performing digital-to-analog conversion and radio frequency modulation processing on the data frame to be transmitted and transmitting the data frame.
2. The method for transmitting a digital signal based on multi-carrier pseudo random sequence according to claim 1, wherein the framing method in step S2 comprises:
filling a guard interval of the data block to be transmitted with at least one of the multi-carrier pseudorandom sequences; or
And using at least one multi-carrier pseudo-random sequence as a leader sequence of the data block to be transmitted.
3. The method for transmitting a digital signal based on a multi-carrier pseudo-random sequence as claimed in claim 2, wherein said multi-carrier pseudo-random sequence is a sequence obtained by inverse discrete fourier transform of a binary sequence.
4. A method for transmitting a digital signal based on a multi-carrier pseudo-random sequence according to claim 3, characterized in that said method for selecting a multi-carrier pseudo-random sequence comprises the steps of:
s2.1 order the discrete Fourier transform of the multi-carrier pseudorandom sequence to sequence C, divide said sequence C into K segments, in turn denoted C1,C2,...,CKThe values of the initialization sequence C are all 0, wherein the length of the multi-carrier pseudorandom sequence is N, and K is any positive integer smaller than N;
s2.2 let i equal 1, C1At { alpha1,α2Taking values in the sequence C ' to obtain a new sequence C ', performing N-point discrete Fourier inverse transformation on the new sequence C ' to obtain a multi-carrier pseudorandom sequence, calculating a parameter to be examined of the multi-carrier pseudorandom sequence according to an optimal sequence selection criterion, and traversing all possible C1Obtaining the multi-carrier pseudo-random sequence with the optimal parameter to be inspected, and recording the corresponding sequence C1Wherein i is more than or equal to 1 and less than or equal to K, | alpha1|=|α2|;
S2.3 let i ═ i +1, sequence C fixed1,C2,...,Ci-1,CiAt { alpha1,α2Taking value in the place, and taking value of C1,C2,...,Ci-1,CiInsert intoThe sequence C forms a new sequence C ', N-point discrete Fourier inverse transformation is carried out on the new sequence C' to obtain a multi-carrier pseudorandom sequence, parameters to be checked of the multi-carrier pseudorandom sequence are calculated according to an optimal sequence selection criterion, and all possible sequences C are traversediObtaining the multi-carrier pseudo-random sequence with the optimal parameter to be inspected, and recording the corresponding CiAnd an optimal parameter P to be examined0
S2.4 successively re-traversing the first i sequences and fixing C1-CiRemoving C injAll sequences except for, go through all possible CjIf the obtained optimal parameter to be examined is better than P0Then the optimal parameter to be examined and the corresponding sequence C are updatedjWherein j is more than or equal to 1 and less than or equal to i;
s2.5 if i ═ K, then step S2.6 is performed, otherwise, step S2.3 is returned to;
s2.6 selecting C currently1,C2,...,CKSplicing into a binary sequence with the length of N, carrying out N-point discrete Fourier inverse transformation on the binary sequence, and outputting the obtained multi-carrier pseudo-random sequence as a selected multi-carrier pseudo-random sequence.
5. The method for transmitting a digital signal based on a multi-carrier pseudo-random sequence as claimed in claim 2, wherein the multi-carrier pseudo-random sequence is a sequence obtained by spreading or truncating an m-sequence and performing inverse discrete fourier transform.
6. The method for multi-carrier pseudorandom sequence based digital signal transmission as claimed in claim 5, wherein said spreading method comprises:
cyclic extension, copying the end several bit symbols of the m sequence to the front of the m sequence; or
Zero padding expansion, wherein a plurality of zero symbols are respectively padded at the front end and the tail end of the m sequence; or
Zero-symbol extensions are inserted in the sequence according to a known pattern.
7. The method for multi-carrier pseudorandom sequence based digital signal transmission as claimed in claim 6, wherein said multi-carrier pseudorandom sequence selection method comprises the steps of:
s2.1' selecting the length of the multi-carrier pseudo-random sequence as N, determining the order K of the m sequence to meet the requirementOr
Figure FSA00000059525200022
Wherein,
Figure FSA00000059525200023
and
Figure FSA00000059525200024
respectively representing a down rounding and an up rounding;
s2.2' sequentially selecting a generator polynomial and an initial phase of the m sequence to generate an m sequence;
s2.3', mapping the generated m sequence into a binary phase shift keying symbol, and expanding or truncating to form a symbol sequence with the length of N;
s2.4' performing N-point discrete Fourier inverse transformation on the symbol sequence to obtain a multi-carrier pseudorandom sequence with the length of N;
s2.5 'according to an optimal sequence selection criterion, calculating a parameter to be checked of the multi-carrier pseudorandom sequence obtained in the step S2.4', and recording the multi-carrier pseudorandom sequence and the parameter value to be checked;
s2.6 ' judging whether all the generating polynomials and all the initial phases are traversed, if so, executing the step S2.7 ', otherwise, returning to execute the step S2.2 ';
s2.7' according to the optimal sequence selection criterion, selecting the optimal parameter to be examined from all the obtained parameters to be examined, and outputting the corresponding multi-carrier pseudo-random sequence as the selected multi-carrier pseudo-random sequence.
8. The method for multi-carrier pseudorandom sequence based digital signal transmission according to claim 4 or 7, wherein said optimal sequence selection criterion comprises:
the minimum criterion of the peak-to-average power ratio, the parameter to be considered is the PAPR of the sequence, and the PAPR of the sequence c (n) is:
<math><mrow><mi>PAPR</mi><mo>=</mo><munder><mi>max</mi><mrow><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mrow></munder><mrow><mo>(</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>/</mo><mfrac><mn>1</mn><mi>N</mi></mfrac><munderover><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn></mrow></munderover><mo>|</mo><msup><mi>c</mi><mn>2</mn></msup><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo><mo>;</mo></mrow></math> or
The maximum criterion of partial quality factor of aperiodic autocorrelation, the parameter to be examined is partial quality factor F of aperiodic autocorrelation of sequencepartPartial quality factor F of the aperiodic autocorrelation of the sequence c (n)partThe method comprises the following steps:
<math><mrow><msub><mi>F</mi><mi>part</mi></msub><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>n</mi><mo>=</mo><mo>-</mo><mn>3</mn><mo>,</mo><mo>-</mo><mn>2</mn><mo>,</mo><mo>-</mo><mn>1,1,2,3</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is a non-periodic autocorrelation of the sequence c (n), and
<math><mrow><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mfenced open='{' close=''><mtable><mtr><mtd><munderover><mi>&Sigma;</mi><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>N</mi><mo>-</mo><mn>1</mn><mo>-</mo><mi>n</mi></mrow></munderover><mi>c</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>&CenterDot;</mo><msup><mi>c</mi><mo>*</mo></msup><mrow><mo>(</mo><mi>i</mi><mo>+</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mn>0</mn><mo>&le;</mo><mi>n</mi><mo>&lt;</mo><mi>N</mi></mtd></mtr><mtr><mtd><msup><mi>R</mi><mo>*</mo></msup><mrow><mo>(</mo><mo>-</mo><mi>n</mi><mo>)</mo></mrow><mo>,</mo></mtd><mtd><mo>-</mo><mi>N</mi><mo>&lt;</mo><mi>n</mi><mo>&lt;</mo><mn>0</mn></mtd></mtr></mtable></mfenced><mo>;</mo></mrow></math> or
The maximum criterion of the quality factor of the aperiodic autocorrelation of the discrete fourier transform, the parameter to be considered is the quality factor of the aperiodic autocorrelation of the sequence, and the quality factor MF of the aperiodic autocorrelation of the sequence (c), (n) is:
<math><mrow><mi>MF</mi><mo>=</mo><msup><mi>R</mi><mn>2</mn></msup><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow><mo>/</mo><munder><mi>&Sigma;</mi><mrow><mi>N</mi><mo>&NotEqual;</mo><mn>0</mn></mrow></munder><msup><mrow><mo>|</mo><mi>R</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>|</mo></mrow><mn>2</mn></msup></mrow></math>
wherein R (n) is the aperiodic autocorrelation of sequence c (n); or
The maximum criterion of the ratio of the quality factor of the non-periodic autocorrelation part to the peak-to-average power ratio is as follows: p ═ Fpartthe/PAPR; or
The maximum ratio of the non-periodic autocorrelation quality factor of the discrete fourier transform to the peak-to-average power ratio is determined as follows: p ═ MF/PAPR; or
The maximum product criterion of the quality factor of the aperiodic autocorrelation part and the aperiodic autocorrelation quality factor of the discrete Fourier transform is as follows: p ═ FpartMF; or
Peak-to-average power ratio, aperiodic autocorrelationPartial quality factor and non-periodic autocorrelation quality factor compromise criterion of discrete Fourier transform, wherein the parameter to be considered is P ═ FpartMF/PAPR, choose the multicarrier pseudorandom sequence with the maximum P.
9. A digital signal transmission system based on a multi-carrier pseudorandom sequence, the system comprising:
the coding modulation module is used for coding and modulating data to be transmitted to generate a data block to be transmitted;
the sequence generation module generates a required multi-carrier pseudo-random sequence;
the framing module is used for framing the data block to be transmitted and the selected multi-carrier pseudorandom sequence to obtain a data frame to be transmitted;
and the back-end processing module is used for carrying out digital-to-analog conversion and radio frequency modulation processing on the data frame to be transmitted and sending the data frame.
CN 201010129099 2010-03-18 2010-03-18 Digital signal transmission method and system based on multi-carrier pseudorandom sequence Active CN101827059B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010129099 CN101827059B (en) 2010-03-18 2010-03-18 Digital signal transmission method and system based on multi-carrier pseudorandom sequence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010129099 CN101827059B (en) 2010-03-18 2010-03-18 Digital signal transmission method and system based on multi-carrier pseudorandom sequence

Publications (2)

Publication Number Publication Date
CN101827059A true CN101827059A (en) 2010-09-08
CN101827059B CN101827059B (en) 2013-01-30

Family

ID=42690772

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010129099 Active CN101827059B (en) 2010-03-18 2010-03-18 Digital signal transmission method and system based on multi-carrier pseudorandom sequence

Country Status (1)

Country Link
CN (1) CN101827059B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103763084A (en) * 2014-01-13 2014-04-30 宁波大学 Anti-fading wireless signal transmission method for digital broadcast single frequency network
CN107408998A (en) * 2015-04-09 2017-11-28 三菱电机株式会社 Transmitters and receivers
CN107846376A (en) * 2017-12-20 2018-03-27 四川九洲电器集团有限责任公司 A kind of radio communication frame synchornization method and system based on pseudo-random sequence
CN113315542A (en) * 2021-06-10 2021-08-27 恒盟海外科技有限公司 Physical layer of pseudo-random phase sequence spread spectrum communication system
WO2022242707A1 (en) * 2021-05-21 2022-11-24 中兴通讯股份有限公司 Data transmission method and apparatus, electronic device, and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1599002A1 (en) * 2000-04-26 2005-11-23 Alcatel Method to generate a pseudo random sequence of multi carrier data symbols, and related transmitter and receiver
US20080008081A1 (en) * 2006-07-06 2008-01-10 Gigle Semiconductor Inc. Adaptative multi-carrier code division multiple access
CN101272368A (en) * 2007-03-19 2008-09-24 中兴通讯股份有限公司 Method and device for stacking pseudorandom sequence on OFDM signal
CN101364831A (en) * 2007-08-09 2009-02-11 清华大学 Method for channel estimation
CN101527596A (en) * 2008-03-07 2009-09-09 索尼株式会社 Wireless system of novel front synchronization code using emergency frames

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1599002A1 (en) * 2000-04-26 2005-11-23 Alcatel Method to generate a pseudo random sequence of multi carrier data symbols, and related transmitter and receiver
US20080008081A1 (en) * 2006-07-06 2008-01-10 Gigle Semiconductor Inc. Adaptative multi-carrier code division multiple access
CN101272368A (en) * 2007-03-19 2008-09-24 中兴通讯股份有限公司 Method and device for stacking pseudorandom sequence on OFDM signal
CN101364831A (en) * 2007-08-09 2009-02-11 清华大学 Method for channel estimation
CN101527596A (en) * 2008-03-07 2009-09-09 索尼株式会社 Wireless system of novel front synchronization code using emergency frames

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103763084A (en) * 2014-01-13 2014-04-30 宁波大学 Anti-fading wireless signal transmission method for digital broadcast single frequency network
CN107408998A (en) * 2015-04-09 2017-11-28 三菱电机株式会社 Transmitters and receivers
CN107408998B (en) * 2015-04-09 2019-05-14 三菱电机株式会社 Transmitters and receivers
CN107846376A (en) * 2017-12-20 2018-03-27 四川九洲电器集团有限责任公司 A kind of radio communication frame synchornization method and system based on pseudo-random sequence
CN107846376B (en) * 2017-12-20 2020-05-15 四川九洲电器集团有限责任公司 Wireless communication frame synchronization method and system based on pseudo-random sequence
WO2022242707A1 (en) * 2021-05-21 2022-11-24 中兴通讯股份有限公司 Data transmission method and apparatus, electronic device, and storage medium
CN113315542A (en) * 2021-06-10 2021-08-27 恒盟海外科技有限公司 Physical layer of pseudo-random phase sequence spread spectrum communication system

Also Published As

Publication number Publication date
CN101827059B (en) 2013-01-30

Similar Documents

Publication Publication Date Title
CN106973026B (en) Preamble symbol receiving method
EP1974516B1 (en) Method of generating code sequence and method of transmitting signal using the same
CN101641924B (en) Sequence generating method for efficient detection and method for transmitting and receiving signals using the same
CN101536336B (en) Method and apparatus for fast cell search
CN101621491B (en) Receiver and method for receiving digital signal
US10284406B2 (en) Method and apparatus for generating code sequence in a communication system
CN105991500B (en) The method of reseptance and device of leading symbol
KR100689552B1 (en) Method and apparatus for searching cell in a wireless communication system
CN105743624A (en) Generation method for preamble symbol and receiving method
CN112039810B (en) Method for generating frequency domain OFDM symbol and method for generating preamble symbol
CN106685883B (en) Preamble symbol receiving apparatus
CN105516045A (en) OFDM (Orthogonal Frequency-Division Multiplexing) training sequence construction method and synchronization method
CN101827059A (en) Digital signal transmission method and system based on multi-carrier pseudorandom sequence
CN109600334B (en) OFDM synchronization method and device for bandwidth satellite communication system and readable storage medium
CN1980114A (en) Channel estimation emitting-receiving device and method
KR20100086402A (en) Apparatusn and method for tarnsmitting and receiving uplink sounding signal in a broadband wireless communication system
US6414936B1 (en) Method of estimating carrier frequency offset in an orthogonal frequency division multiplexing system
CN100454917C (en) Method of frequency deviation estimation based on heterogeneous spacing frequency domain training sequence
CN111490957A (en) Method and device for generating leader sequence in time domain
KR101265619B1 (en) Structure Of Hybrid Synchronization Channel Method and Apparatus For Transmitting Signal Applying And Analyzing The Sequence Using The Same
KR101306710B1 (en) Method for adding additional information to a sequence for synchronization channel
CN116208458A (en) OFDM synchronization method in high-speed environment
KR20080063643A (en) Apparatus for frequency offset estimation and method thereof
KR20080004703A (en) Appratus and method for channel estimataion in wireless cellular communication system
KR20080018625A (en) Method for adding additional information to a sequence for synchronization

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant