CN107645364B - Complementary encoding method and device, complementary decoding method and device, OvXDM system - Google Patents
Complementary encoding method and device, complementary decoding method and device, OvXDM system Download PDFInfo
- Publication number
- CN107645364B CN107645364B CN201610592255.0A CN201610592255A CN107645364B CN 107645364 B CN107645364 B CN 107645364B CN 201610592255 A CN201610592255 A CN 201610592255A CN 107645364 B CN107645364 B CN 107645364B
- Authority
- CN
- China
- Prior art keywords
- segment
- domain
- superposed
- complementary
- tail
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
Description
技术领域technical field
本申请涉及信号处理领域,尤其涉及一种互补编码方法及装置、互补译码方法及装置、OvXDM系统。The present application relates to the field of signal processing, and in particular to a complementary encoding method and device, a complementary decoding method and device, and an OvXDM system.
背景技术Background technique
重叠复用系统,不管是重叠时分复用(OvTDM,Overlapped Time DivisionMultiplexing)系统、重叠频分复用(OvFDM,Overlapped Frequency DivisionMultiplexing)系统还是重叠码分复用(OvCDM,Overlapped code DivisionMultiplexing)系统、时频二维重叠复用系统(OvHDM,Overlapped Hybrid DivisionMultiplexing)、空分重叠复用系统(Overlapped Space Division Multiplexing)在编码过程中进行叠加时呈平行四边形状,如图1所示,对于一个重叠复用次数为K的重叠复用系统,编码叠加过程中会有一段“首”和“尾”不是K次重叠,且对于一段长度为N的输入数字序列,经过重叠编码后长度变为N+K-1,其中未完全进行K次重叠的“首”和“尾”的长度都是K-1,由于有用信息流的长度为N,因此一般要么在发送端只发送长度为N的数据,例如将“尾”去掉,然后在接收端对已去掉“尾”的数据进行译码;要么在发送端发送完整的长度为N+K-1的数据,然后在接收端译码时对数据的“尾”不进行译码,上述的两种做法都会使得最后几个符号的误码率较高。Overlapping multiplexing system, whether it is overlapping time division multiplexing (OvTDM, Overlapped Time Division Multiplexing) system, overlapping frequency division multiplexing (OvFDM, Overlapped Frequency Division Multiplexing) system or overlapping code division multiplexing (OvCDM, Overlapped code Division Multiplexing) system, time-frequency Two-dimensional overlapping multiplexing system (OvHDM, Overlapped Hybrid Division Multiplexing) and space division overlapping multiplexing system (Overlapped Space Division Multiplexing) are in the shape of a parallelogram when superimposed in the encoding process, as shown in Figure 1. For an overlapping multiplexing For an overlapping multiplexing system of K, there will be a section of "first" and "tail" that do not overlap K times during the encoding and overlaying process, and for an input digital sequence with a length of N, the length becomes N+K-1 after overlapping encoding , where the lengths of the "header" and "tail" that have not been fully overlapped K times are both K-1. Since the length of the useful information flow is N, generally only data with a length of N is sent at the sending end, for example, " "Tail", and then decode the data with the "tail" removed at the receiving end; or send the complete data with a length of N+K-1 at the sending end, and then decode the "tail" of the data at the receiving end Without decoding, the above two methods will make the bit error rate of the last few symbols higher.
另外,由于重叠复用系统的重叠编码约束特性,使得译码过程中数据深度至少在4K~5K才会出现稳定的译码路径,因此这就要求发送的数据长度N较大,因为若N较小的话,由于“首”和“尾”不是完全的K次重叠,译码过程中稳定路径可能还没有出现,数据就已经译完了,这会造成系统的误码率大大提高;另一方面,若发送的数据长度N较大,虽然满足了稳定的译码路径要求,但是会使得译码输出时延变长,影响系统的处理时间。In addition, due to the overlapping coding constraints of the overlapping multiplexing system, a stable decoding path will only appear when the data depth is at least 4K to 5K in the decoding process. If it is small, since the "first" and "tail" are not completely overlapped K times, the stable path may not appear in the decoding process, and the data has already been decoded, which will greatly increase the bit error rate of the system; on the other hand, If the length N of the transmitted data is large, although the requirement of a stable decoding path is met, it will increase the decoding output delay and affect the processing time of the system.
发明内容Contents of the invention
为解决上述问题,本申请提供一种互补编码方法及装置、互补译码方法及装置、OvXDM系统。In order to solve the above problems, the present application provides a complementary encoding method and device, a complementary decoding method and device, and an OvXDM system.
根据本申请的第一方面,本申请提供互补编码方法,适用于OvXDM系统,包括以下步骤:According to the first aspect of the present application, the present application provides a complementary encoding method, which is applicable to the OvXDM system, comprising the following steps:
根据设计参数生成一个第一域内的初始包络波形;generating an initial envelope waveform in the first domain according to the design parameters;
根据重叠复用次数将所述初始包络波形在第一域上按预定的间隔进行移位,得到各固定间隔的移位包络波形;shifting the initial envelope waveform on the first domain at predetermined intervals according to the number of times of overlapping multiplexing, to obtain shifted envelope waveforms at fixed intervals;
将输入序列中的数字信号与各自对应的移位包络波形相乘,得到各调制包络波形;Multiply the digital signals in the input sequence with their corresponding shifted envelope waveforms to obtain each modulated envelope waveform;
将所述各调制包络波形在第一域上进行叠加,得到第一域上的复调制包络波形,其中所述复调制包络波形包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段;superimposing the modulation envelope waveforms on the first domain to obtain a complex modulation envelope waveform on the first domain, wherein the complex modulation envelope waveform includes an insufficiently superimposed first section, a fully superimposed main section, and An insufficiently superimposed tail section;
将所述复调制包络波形的首段叠加到尾段,或尾段叠加到首段,以产生互补的复调制包络波形,再进行后续处理。The first segment of the complex modulation envelope waveform is superimposed on the tail segment, or the tail segment is superimposed on the first segment to generate a complementary complex modulation envelope waveform, and then subsequent processing is performed.
根据本申请的第二方面,本申请提供互补译码方法,适用于OvXDM系统,包括以下步骤:According to the second aspect of the present application, the present application provides a complementary decoding method, which is applicable to the OvXDM system, comprising the following steps:
接收信号并对接收到的信号进行处理以得到第一域内的数字信号,其中所述第一域内的数字信号包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段;receiving a signal and processing the received signal to obtain a digital signal in a first domain, wherein the digital signal in the first domain includes an insufficiently superimposed first segment, a sufficiently superimposed body segment, and an insufficiently superimposed tail segment;
将所述第一域内的数字信号的首段叠加到尾段,或尾段叠加到首段,以产生互补的数字信号;superimposing the first segment of the digital signal in the first domain to the tail segment, or superimposing the tail segment to the first segment, to generate a complementary digital signal;
按照一定的译码算法对所述数字信号进行译码。The digital signal is decoded according to a certain decoding algorithm.
根据本申请的第三方面,本申请提供互补编码装置,适用于OvXDM系统,包括:According to the third aspect of the present application, the present application provides a complementary encoding device, which is suitable for the OvXDM system, including:
波形生成模块,用于根据设计参数生成一个第一域内的初始包络波形;A waveform generating module, configured to generate an initial envelope waveform in the first domain according to design parameters;
移位模块,用于根据重叠复用次数将所述初始包络波形在第一域上按预定的间隔进行移位,得到各固定间隔的移位包络波形;A shift module, configured to shift the initial envelope waveform on the first domain at predetermined intervals according to the number of times of overlapping multiplexing, to obtain shifted envelope waveforms at fixed intervals;
乘法模块,用于将输入序列中的数字信号与各自对应的移位包络波形相乘,得到各调制包络波形;The multiplication module is used to multiply the digital signals in the input sequence with their corresponding shifted envelope waveforms to obtain each modulated envelope waveform;
叠加模块,用于将所述各调制包络波形在第一域上进行叠加,得到第一域上的复调制包络波形,其中所述复调制包络波形包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段;A superimposition module, configured to superimpose the modulation envelope waveforms on the first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms include insufficiently superimposed first segments, sufficient Superimposed body segments and insufficiently superimposed tail segments;
互补模块,用于将所述复调制包络波形的首段叠加到尾段,或尾段叠加到首段,以产生互补的复调制包络波形。The complementary module is used for superimposing the first segment of the complex modulation envelope waveform to the tail segment, or superimposing the tail segment to the first segment, so as to generate a complementary complex modulation envelope waveform.
根据本申请的第四方面,本申请提供互补译码装置,适用于OvXDM系统,包括:According to the fourth aspect of the present application, the present application provides a complementary decoding device, which is suitable for the OvXDM system, including:
接收模块,用于接收信号并对接收到的信号进行处理以得到第一域内的数字信号,其中所述第一域内的数字信号包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段;The receiving module is used to receive the signal and process the received signal to obtain the digital signal in the first domain, wherein the digital signal in the first domain includes an insufficiently superimposed first section, a fully superimposed body section, and an insufficiently superimposed end of
互补模块,用于将所述第一域内的数字信号的首段叠加到尾段,或尾段叠加到首段,以产生互补的数字信号;a complementary module, configured to superimpose the first segment of the digital signal in the first domain to the tail segment, or the tail segment to the first segment, to generate a complementary digital signal;
译码模块,用于按照一定的译码算法对所述数字信号进行译码。The decoding module is used to decode the digital signal according to a certain decoding algorithm.
根据本申请的第五方面,本申请提供OvXDM系统,包括上述的互补编码装置,或者包括上述的互补译码装置。According to a fifth aspect of the present application, the present application provides an OvXDM system, including the above-mentioned complementary encoding device, or including the above-mentioned complementary decoding device.
本申请的有益效果是:The beneficial effect of this application is:
依上述实施的互补编码方法及装置、互补译码方法及装置、OvXDM系统,由于编码过程中将复调制包络波形的首段叠加到尾段,或尾段叠加到首段,以产生互补的复调制包络波形,或在译码过程中将所述第一域内的数字信号的首段叠加到尾段,或尾段叠加到首段,以产生互补的数字信号,从而使得被译码的数据都是经过完全重叠的,这样就不存在传统技术中最后几个符号的误码率较高的问题,同时并不要求数据的长度很大,即使数据的长度较短也可以得到稳定的译码路径,这就降低了译码处理时延,提高了系统处理时间精度和传输速度。According to the complementary encoding method and device, complementary decoding method and device, and OvXDM system implemented above, since the first segment of the complex modulation envelope waveform is superimposed to the tail segment, or the tail segment is superimposed to the first segment during the encoding process, to generate complementary complex modulation envelope waveform, or in the decoding process, the first segment of the digital signal in the first domain is superimposed to the tail segment, or the tail segment is superimposed to the first segment to generate a complementary digital signal, so that the decoded The data is completely overlapped, so there is no problem of high bit error rate of the last few symbols in the traditional technology, and the length of the data is not required to be large, and stable translation can be obtained even if the length of the data is short The code path reduces the decoding processing delay and improves the system processing time accuracy and transmission speed.
附图说明Description of drawings
图1为重叠复用系统中数据叠加示意图;Figure 1 is a schematic diagram of data superposition in an overlapping multiplexing system;
图2为本申请第一种实施例的互补编码方法的流程示意图;FIG. 2 is a schematic flowchart of a complementary encoding method in the first embodiment of the present application;
图3为本申请第一种实施例的互补编码装置的结构示意图;FIG. 3 is a schematic structural diagram of a complementary encoding device according to the first embodiment of the present application;
图4为本申请第二种实施例的互补译码方法的流程示意图;FIG. 4 is a schematic flowchart of a complementary decoding method according to a second embodiment of the present application;
图5为本申请第二种实施例的互补译码装置的结构示意图;FIG. 5 is a schematic structural diagram of a complementary decoding device according to a second embodiment of the present application;
图6为传统OvFDM系统的发射端的结构示意图;FIG. 6 is a schematic structural diagram of a transmitting end of a traditional OvFDM system;
图7(a)为传统OvFDM系统的信号接收端框图;Figure 7(a) is a block diagram of a signal receiving end of a traditional OvFDM system;
图7(b)为传统OvFDM系统接收信号检测框图Figure 7(b) is a block diagram of the traditional OvFDM system received signal detection
图8为本申请一实施例中OvFDM系统的互补叠加的示意图;FIG. 8 is a schematic diagram of complementary superposition of an OvFDM system in an embodiment of the present application;
图9为传统OvFDM系统的码树图;Fig. 9 is a code tree diagram of a traditional OvFDM system;
图10为传统OvFDM系统的节点状态转移图;Figure 10 is a node state transition diagram of a traditional OvFDM system;
图11为传统OvFDM系统的格状图;Fig. 11 is a trellis diagram of a traditional OvFDM system;
图12为本申请一例子中数据互补叠加的示意图;Fig. 12 is a schematic diagram of complementary superposition of data in an example of the present application;
图13为本申请一例子中对互补后的数据进行译码的检测示意图;Fig. 13 is a schematic diagram of detection of decoding complementary data in an example of the present application;
图14为传统OvTDM系统的发射端的结构示意图;FIG. 14 is a schematic structural diagram of a transmitting end of a traditional OvTDM system;
图15(a)为传统OvTDM系统预处理单元示意图;Figure 15(a) is a schematic diagram of a traditional OvTDM system preprocessing unit;
图15(b)为传统OvTDM系统序列检测单元的示意图;Figure 15(b) is a schematic diagram of a traditional OvTDM system sequence detection unit;
图16为本申请一实施例中OvTDM系统的互补叠加的示意图;FIG. 16 is a schematic diagram of complementary superposition of the OvTDM system in an embodiment of the present application;
图17为传统OvTDM系统的码树图;Figure 17 is a code tree diagram of a traditional OvTDM system;
图18为传统OvTDM系统的节点状态转移图;Figure 18 is a node state transition diagram of a traditional OvTDM system;
图19为传统OvTDM系统的格状图;Figure 19 is a trellis diagram of a traditional OvTDM system;
图20为本申请又一例子中数据互补叠加的示意图;Fig. 20 is a schematic diagram of data complementary superposition in another example of the present application;
图21为本申请又一例子中对互补后的数据进行译码的检测示意图。FIG. 21 is a schematic diagram of detection of decoding complementary data in another example of the present application.
具体实施方式detailed description
下面通过具体实施方式结合附图对本申请作进一步详细说明。The present application will be described in further detail below through specific embodiments in conjunction with the accompanying drawings.
本申请中使用OvXDM(Overlapped X Division Multiplexing)来指代重叠复用系统,其中,X可以表示时间T、频率F、码域C、空间S或混合H等,相应地,此时OvXDM系统为OvTDM系统、OvFDM系统、OvCDM系统、OvSDM系统或OvHDM系统。本申请的发明构思在于:将经过重叠复用编码的数据的“首”和“尾”在发送端或接收端进行叠加,以使得对数据按照一定的译码算法进行译码之前,全部数据符号都是经过了充分的叠加,从而一方面解决了在传统技术中最后几个符号的误码率较高的问题,大大降低了系统的误码率,另一方面可以不要求数据的长度很大,即使数据的长度较短也可以得到稳定的译码路径,这就降低了译码处理时延,提高了系统处理时间精度和传输速度。本申请公开了一种OvXDM系统,其包括下面的实施例一中公开的互补编码装置,或者,包括下面的实施例二中公开的互补译码装置。In this application, OvXDM (Overlapped X Division Multiplexing) is used to refer to the overlapping multiplexing system, where X can represent time T, frequency F, code domain C, space S or hybrid H, etc. Correspondingly, the OvXDM system at this time is OvTDM system, OvFDM system, OvCDM system, OvSDM system or OvHDM system. The inventive idea of this application is to superimpose the "head" and "tail" of the data encoded by overlapping multiplexing at the sending end or the receiving end, so that before the data is decoded according to a certain decoding algorithm, all data symbols All have been fully superimposed, so that on the one hand, the problem of high bit error rate of the last few symbols in the traditional technology is solved, and the bit error rate of the system is greatly reduced. On the other hand, the length of the data can not be required to be large , even if the length of the data is short, a stable decoding path can be obtained, which reduces the decoding processing delay and improves the system processing time precision and transmission speed. The present application discloses an OvXDM system, which includes the complementary encoding device disclosed in
实施例一Embodiment one
请参照图2,本实施例公开了一种适用于OvXDM系统的互补编码方法,包括步骤S01~S09。Please refer to FIG. 2 , this embodiment discloses a complementary coding method applicable to the OvXDM system, including steps S01-S09.
步骤S01、根据设计参数生成一个第一域内的初始包络波形。Step S01. Generate an initial envelope waveform in the first domain according to design parameters.
步骤S03、根据重叠复用次数将所述初始包络波形在第一域上按预定的间隔进行移位,得到各固定间隔的移位包络波形。Step S03 , shifting the initial envelope waveform on the first domain at predetermined intervals according to the number of times of overlapping multiplexing, to obtain shifted envelope waveforms at fixed intervals.
步骤S05、将输入序列中的数字信号与各自对应的移位包络波形相乘,得到各调制包络波形;Step S05, multiplying the digital signals in the input sequence with their corresponding shifted envelope waveforms to obtain each modulated envelope waveform;
步骤S07、将所述各调制包络波形在第一域上进行叠加,得到第一域上的复调制包络波形,其中所述复调制包络波形包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段。Step S07: Superimpose the modulation envelope waveforms on the first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms include the first segment that is not fully superimposed, the fully superimposed Body segments and tail segments that are not sufficiently superimposed.
步骤S09、将所述复调制包络波形的首段叠加到尾段,或尾段叠加到首段,以产生互补的复调制包络波形,再进行后续处理。Step S09 , superimposing the first segment of the complex modulation envelope waveform to the tail segment, or superimposing the tail segment to the first segment, to generate a complementary complex modulation envelope waveform, and then perform subsequent processing.
在一实施例中,OvXDM系统为OvFDM系统,相应地,此时第一域为频率域。在步骤S09中,对产生的互补复调制包络波形的后续处理,在一实施例,可以是通过例如傅氏反变换,将其变换为时间域的互补复调制包络波形以发送。In an embodiment, the OvXDM system is an OvFDM system, and correspondingly, the first domain at this time is the frequency domain. In step S09 , the subsequent processing of the generated complementary complex modulated envelope waveform may, in one embodiment, be transformed into a complementary complex modulated envelope waveform in the time domain by, for example, inverse Fourier transform for transmission.
在一实施例中,OvXDM系统为OvTDM系统,相应地,此时第一域为时间域。在步骤S09中,对产生的互补复调制包络波形的后续处理,在一实施例,将其发射出去。In an embodiment, the OvXDM system is an OvTDM system, and correspondingly, the first domain at this time is the time domain. In step S09, the subsequent processing of the generated complementary complex modulation envelope waveform, in one embodiment, transmits it.
相应地,请参照图3,本实施例还提出一种适用于OvXDM系统的互补编码装置,包括波形生成模块01、移位模块03、乘法模块05、叠加模块07、互补模块09,在一实施例中,还可以包括后续处理模块11。Correspondingly, referring to FIG. 3, this embodiment also proposes a complementary encoding device suitable for OvXDM systems, including a waveform generation module 01, a
波形生成模块01用于根据设计参数生成一个第一域内的初始包络波形。The waveform generation module 01 is used to generate an initial envelope waveform in the first domain according to design parameters.
移位模块03用于根据重叠复用次数将初始包络波形在第一域上按预定的间隔进行移位,得到各固定间隔的移位包络波形。The shifting
乘法模块05用于将输入序列中的数字信号与各自对应的移位包络波形相乘,得到各调制包络波形。The
叠加模块07用于将各调制包络波形在第一域上进行叠加,得到第一域上的复调制包络波形,其中所述复调制包络波形包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段。The
互补模块09用于将所述复调制包络波形的首段叠加到尾段,或尾段叠加到首段,以产生互补的复调制包络波形;The complementary module 09 is used to superimpose the first segment of the complex modulation envelope waveform to the tail segment, or the tail segment to the first segment to generate a complementary complex modulation envelope waveform;
后续处理模块11用于对所述互补的复调制包络波形进行后续处理。The
在一实施例中,当OvXDM系统为OvFDM系统,相应地,此时第一域为频率域。因此后续处理模块11对产生的互补复调制包络波形的后续处理,在一实施例,可以是通过例如傅氏反变换,将其变换为时间域的互补复调制包络波形以发送。In an embodiment, when the OvXDM system is an OvFDM system, correspondingly, the first domain is the frequency domain. Therefore, the subsequent processing of the generated complementary complex modulation envelope waveform by the
在一实施例中,OvXDM系统为OvTDM系统,相应地,此时第一域为时间域。后续处理模块11对产生的互补复调制包络波形的后续处理,在一实施例,将其发射出去。In an embodiment, the OvXDM system is an OvTDM system, and correspondingly, the first domain at this time is the time domain. The
实施例二Embodiment two
如图4所示,本实施例提出了一种适用于OvXDM系统互补译码方法,包括步骤S31~S35。As shown in FIG. 4 , this embodiment proposes a complementary decoding method suitable for the OvXDM system, including steps S31-S35.
步骤S31、接收信号并对接收到的信号进行处理以得到第一域内的数字信号,其中所述第一域内的数字信号包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段。Step S31, receiving a signal and processing the received signal to obtain a digital signal in the first domain, wherein the digital signal in the first domain includes an insufficiently superimposed first section, a fully superimposed main section, and an insufficiently superimposed tail part.
在一实施例中,OvXDM系统为OvFDM系统,相应地,第一域为频率域。在一实施例中,具体地,步骤S31中,先对接收信号在时间域形成符号同步;再对各个符号时间区间的信号进行数字处理,包括取样、量化,将之变为接收数字信号序列;然后对每个时间符号区间的接收数字信号序列进行傅氏变换以形成每个时间符号区间的实际接收信号频谱;再对各个时间符号区间的实际接收信号频谱在频率域以子载波频谱间隔分段得到实际接收信号分段频谱。In an embodiment, the OvXDM system is an OvFDM system, and accordingly, the first domain is a frequency domain. In one embodiment, specifically, in step S31, first form symbol synchronization for the received signal in the time domain; then perform digital processing on the signal in each symbol time interval, including sampling and quantization, and convert it into a received digital signal sequence; Then Fourier transform is performed on the received digital signal sequence of each time symbol interval to form the actual received signal spectrum of each time symbol interval; then the actual received signal spectrum of each time symbol interval is divided into subcarrier spectrum intervals in the frequency domain Obtain the segmented spectrum of the actual received signal.
在一实施例中,OvXDM系统为OvTDM系统,相应地,第一域为时间域。在一实施例中,具体地,步骤S31中,先对接收信号进行同步,包括载波同步、帧同步和符号时间同步等;再根据取样定理,对每一帧内的接收信号进行数字化处理;再对接收到的波形按照波形发送时间间隔切割。In an embodiment, the OvXDM system is an OvTDM system, and correspondingly, the first domain is a time domain. In one embodiment, specifically, in step S31, the received signal is first synchronized, including carrier synchronization, frame synchronization and symbol time synchronization, etc.; then according to the sampling theorem, the received signal in each frame is digitized; and then Cut the received waveform according to the waveform sending time interval.
步骤S33、将所述第一域内的数字信号的首段叠加到尾段,或尾段叠加到首段,以产生互补的数字信号。Step S33 , superimposing the first segment of the digital signal in the first domain to the last segment, or superimposing the last segment to the first segment, so as to generate a complementary digital signal.
步骤S35、按照一定的译码算法对所述数字信号进行译码。译码算法可以采用已有的或未来出现的译码算法,例如,译码算法可以是维特比译码算法和迭代译码算法等。Step S35, decoding the digital signal according to a certain decoding algorithm. The decoding algorithm may use an existing or future decoding algorithm, for example, the decoding algorithm may be a Viterbi decoding algorithm, an iterative decoding algorithm, and the like.
在一实施例中,OvXDM系统为OvFDM系统,相应地,第一域为频率域。In an embodiment, the OvXDM system is an OvFDM system, and accordingly, the first domain is a frequency domain.
在一实施例中,OvXDM系统为OvTDM系统,相应地,第一域为时间域。In an embodiment, the OvXDM system is an OvTDM system, and correspondingly, the first domain is a time domain.
在一实施例中,OvXDM系统为OvCDM系统,相应地,第一域为码分域。In an embodiment, the OvXDM system is an OvCDM system, and correspondingly, the first domain is a code division domain.
在一实施例中,OvXDM系统为OvSDM系统,相应地,第一域为空间域。In an embodiment, the OvXDM system is an OvSDM system, and accordingly, the first domain is a spatial domain.
在一实施例中,OvXDM系统为OvHDM系统,相应地,第一域为混合域In one embodiment, the OvXDM system is an OvHDM system, and accordingly, the first domain is a hybrid domain
相应地,如图5所示,本实施例还提出一种适用于OvXDM系统的互补译码装置,包括接收模块31、互补模块33和译码模块35。Correspondingly, as shown in FIG. 5 , this embodiment also proposes a complementary decoding device suitable for an OvXDM system, including a receiving
接收模块31用于接收信号并对接收到的信号进行处理以得到第一域内的数字信号,其中所述第一域内的数字信号包括未充分叠加的首段、充分叠加的主体段以及未充分叠加的尾段。The receiving
互补模块33用于将所述第一域内的数字信号的首段叠加到尾段,或尾段叠加到首段,以产生互补的数字信号。The
译码模块35用于按照一定的译码算法对所述数字信号进行译码。译码算法可以采用已有的或未来出现的译码算法,例如,译码算法可以是维特比译码算法和迭代译码算法等。The
下面再以两个实际的例子对上述实施例进行解释和说明。Next, the above-mentioned embodiment will be explained and illustrated with two practical examples.
第一个例子不妨以OvFDM系统来说明。The first example may wish to illustrate with the OvFDM system.
现有的OvFDM系统对数据的重叠呈平行四边形,编码后的数据前后各有一段“首段”和“尾段”,形状呈上三角和下三角状,刚好互补。我们将完成编码数据的“尾段”挪到“首段”的位置,或将“首段”挪到“尾段”的位置,即将下三角和上三角进行互补叠加,形成一个长方形状,可以称这种重叠为互补OvFDM系统。互补后的数据呈长方形状,每个数据都是K次的重叠,这样就解决了背景技术中现有技术存在的问题。The existing OvFDM system overlaps the data in a parallelogram shape, and there are a "first segment" and a "tail segment" before and after the encoded data, and the shape is an upper triangle and a lower triangle, which are just complementary. We move the "tail section" of the encoded data to the position of the "first section", or move the "first section" to the position of the "tail section", that is, the lower triangle and the upper triangle are complementary superimposed to form a rectangular shape, which can be We call this overlapping a complementary OvFDM system. The complementary data is in the shape of a rectangle, and each data is overlapped K times, thus solving the problems existing in the prior art in the background art.
编码过程如图6所示:The encoding process is shown in Figure 6:
(1)根据设计参数生成频谱内的初始包络波形H(f)。(1) Generate the initial envelope waveform H(f) in the frequency spectrum according to the design parameters.
(2)将(1)所设计的初始包络波形H(f)经特定载波频谱间隔ΔB移位后,形成其它各个频谱间隔为ΔB的子载波包络波形H(f-i×ΔB)。其中,频谱间隔为子载波频谱间隔△B,其中子载波频谱间隔△B=B/K,B为初始包络波形的带宽,K为重叠复用次数。在一实施例中,所述子载波频谱间隔△B大于或等于系统采样的倒数。(2) After the initial envelope waveform H(f) designed in (1) is shifted by a specific carrier spectrum interval ΔB, other subcarrier envelope waveforms H(f-i×ΔB) with spectrum intervals of ΔB are formed. Wherein, the spectrum interval is the subcarrier spectrum interval ΔB, wherein the subcarrier spectrum interval ΔB=B/K, B is the bandwidth of the initial envelope waveform, and K is the number of overlapping multiplexing. In an embodiment, the subcarrier spectrum interval ΔB is greater than or equal to the reciprocal of the system sampling.
(3)将所要发送的符号Xi分别与(2)生成的对应的各个子载波包络波形H(f-i×ΔB)相乘,得到经过各个子载波调制的调制包络波形XiH(f-i×ΔB)。(3) Multiply the symbol X i to be transmitted with the corresponding subcarrier envelope waveform H(fi×ΔB) generated in (2) to obtain the modulated envelope waveform X i H(fi ×ΔB).
(4)将(3)所形成的各个调制包络波形进行XiH(f-i×ΔB)叠加,形成复调制包络波形,复调制包络波形叠加过程可表示为: (4) Superimpose each modulation envelope waveform formed in (3) by X i H (fi×ΔB) to form a complex modulation envelope waveform. The complex modulation envelope waveform superposition process can be expressed as:
(5)将(4)生成的复调制包络波形进行离散傅氏反变换,最终形成时间域的复调制包络波形,发送信号可表示为:Signal(t)TX=ifft(S(f))。(5) Perform inverse discrete Fourier transform on the complex modulation envelope waveform generated in (4), and finally form the complex modulation envelope waveform in the time domain. The transmitted signal can be expressed as: Signal(t) TX = ifft(S(f) ).
以上为传统OvFDM系统的编码过程。(4)中的叠加过程,反映到数据的编码上,则如图1所示。对于一个符号长度为N的数据,经过上述调制和编码后,长度变为N+K-1,其具有一长度为K-1的未经过K次叠加的首段,还有一长度为K-1的未经过K次叠加的尾段。The above is the encoding process of the traditional OvFDM system. The superposition process in (4) is reflected in the coding of the data, as shown in Fig. 1 . For data with a symbol length of N, after the above modulation and encoding, the length becomes N+K-1, which has a length of K-1 without K-time superposition of the first segment, and a length of K-1 The tail segment of which has not undergone K times of stacking.
译码过程如图7所示:The decoding process is shown in Figure 7:
发送端将编码调制后的信号通过天线发射出去,信号在无线信道中传输,接收端对接收信号进行匹配滤波,由于接收到的信号是时域信号,因此需要先对时域信号进行傅氏变换转换为频域信号,再对信号进行译码处理,OvFDM系统中的傅氏反变换和傅氏变换都涉及采样点数的设置,两者的采样点数应保持一致,且取值为2n。再对信号分别进行抽样、译码,最终判决输出比特流。具体地:The transmitting end transmits the coded and modulated signal through the antenna, the signal is transmitted in the wireless channel, and the receiving end performs matching filtering on the received signal. Since the received signal is a time domain signal, it is necessary to perform Fourier transform on the time domain signal first. Convert to frequency domain signal, and then decode the signal. Inverse Fourier transform and Fourier transform in OvFDM system both involve the setting of the number of sampling points. The number of sampling points of the two should be consistent, and the value is 2 n . Then the signals are sampled and decoded respectively, and finally the output bit stream is judged. specifically:
(6)对接收信号在时间域形成符号同步。(6) Symbol synchronization is formed in the time domain for the received signal.
(7)对各个符号时间区间的信号进行数字处理,包括取样、量化,将之变为接收数字信号序列。(7) Perform digital processing on the signals of each symbol time interval, including sampling and quantization, and convert them into received digital signal sequences.
(8)对每个时间符号区间的接收数字信号序列进行傅氏变换以形成每个时间符号区间的实际接收信号频谱。其表达式为:Signal(f)RX=fft(s(t))。(8) Fourier transform is performed on the received digital signal sequence of each time symbol interval to form the actual received signal spectrum of each time symbol interval. Its expression is: Signal (f) RX = fft (s (t)).
(9)对每个时间符号区间的实际接收信号频谱在频率域以子载波频谱间隔ΔB分段得到实际接收信号分段频谱。(9) Segment the actual received signal spectrum of each time symbol interval in the frequency domain with the subcarrier spectrum interval ΔB to obtain the segmented spectrum of the actual received signal.
(10)按照一定的译码算法对切割后的频谱波形进行译码。(10) Decoding the cut spectrum waveform according to a certain decoding algorithm.
以上为传统OvFDM系统的编码过程,其在译码过程中,对尾段的数据不会进行译码,因为有用信息流的长度为N,所以只会对发送过来的长度为N+K-1的数据中的前N个数据进行译码。The above is the encoding process of the traditional OvFDM system. During the decoding process, the data in the tail segment will not be decoded, because the length of the useful information stream is N, so only the length of the transmitted information is N+K-1 The first N data in the data are decoded.
本申请的发明构思是将上述经过编码的长度为N+K-1的数据的首段挪至尾段,与原本的尾段进行叠加后形成新的尾段,从而形成一个新的数据长度为N的互补的编码数据,当然,也可以将尾段挪至首段进行叠加,如图8所示。上述的挪动过程,可以放到编程过程中,也可以放到译码过程中。在一实施例中,若将上述的挪动过程放到编程过程中,则可以在(5)之前,将数据的首段/尾段挪至尾段/首段进行叠加。在一实施例中,若将上述的挪动过程放到译码过程中,则可以在(10)之前,将数据的首段/尾段挪至尾段/首段进行叠加。The inventive idea of the present application is to move the first segment of the above-mentioned coded data with a length of N+K-1 to the tail segment, and superimpose with the original tail segment to form a new tail segment, thereby forming a new data length of The complementary coded data of N, of course, can also move the tail segment to the first segment for superimposition, as shown in FIG. 8 . The above-mentioned moving process can be put into the programming process, and can also be put into the decoding process. In one embodiment, if the above moving process is included in the programming process, before (5), the first segment/end segment of the data can be moved to the end segment/first segment for superimposition. In one embodiment, if the above-mentioned moving process is put into the decoding process, before (10), the first segment/tail segment of the data can be moved to the tail segment/first segment for superimposition.
(10)中的译码算法,包含多种,例如维特比译码算法和迭代译码算法等。下面不妨以维特比译码方法为例进行说明。The decoding algorithm in (10) includes many kinds, such as Viterbi decoding algorithm and iterative decoding algorithm. Let's take the Viterbi decoding method as an example for illustration.
采用本申请后,在进行到(10)的译码时,是对长度为N的序列yi(i=1~N)进行译码,每一个符号都是K路符号叠加的结果,即是对互补的数据序列进行译码。。After adopting this application, when proceeding to the decoding of (10), the sequence y i (i=1~N) whose length is N is decoded, and each symbol is the result of superposition of K symbols, that is The complementary data sequence is decoded. .
第一、生成K路符号叠加后的可能状态即理想符号Stheory(j),j=1~2K,共计2K种。First, generate the possible states after superposition of K-way symbols, that is, ideal symbols S theory (j), j= 1˜2 K , 2 K types in total.
K路符号表示为:叠加后对应的表示形式为如果用+1来表示叠加后的输出电平,则共计包含K+1种符号电平,依次为:±K、±(K-2)、...±(K-2k),k=1~K/2,记为Ytheory(index),index=1~K+1。The K-road notation is expressed as: The corresponding expression after superposition is If +1 is used to represent the superimposed output level, then a total of K+1 symbol levels are included, followed by: ±K, ±(K-2), ... ±(K-2 k ), k= 1~K/2, recorded as Y theory (index), index=1~
比如K=3时,符号叠加后共计有8种状态,分别为: 对应输出的符号电平为±3、±1共四种,即Ytheory(1)=-3,Ytheory(2)=-1,Ytheory(3)=1,Ytheory(4)=3。For example, when K=3, there are a total of 8 states after the symbols are superimposed, which are: The corresponding output symbol levels are ±3 and ±1, a total of four types, namely Y theory (1)=-3, Y theory (2)=-1, Y theory (3)=1, Y theory (4)=3 .
第二、计算当前符号的测度距离。Second, calculate the measure distance of the current symbol.
测度距离表示两个信号之间的距离,定义为当p=2时,即为欧式距离,欧式距离是两个信号之间的真实距离,能够真实的反应实际信号和理想信号之间的距离,其定义为本实施案例中我们以欧式距离为例说明。The metric distance represents the distance between two signals and is defined as When p=2, it is the Euclidean distance. The Euclidean distance is the real distance between two signals, which can truly reflect the distance between the actual signal and the ideal signal. It is defined as In this implementation case, we take the Euclidean distance as an example.
使用当前符号yi(i=1~N)与生成的2K种理想符号Stheory(j)依次求欧式距离,得到2k个欧氏距离。记为 Use the current symbol y i (i=1~N) and the generated 2 K kinds of ideal symbols S theory (j) to calculate the Euclidean distance sequentially, and obtain 2 k Euclidean distances. recorded as
第三、计算当前符号的累加距离。Third, calculate the cumulative distance of the current symbol.
在比较欧式距离时,如果只对比当前符号与理论符号的欧式距离,随着译码深度的增加,最佳路径可能会有偏差,导致最终译码的成功率降低。When comparing the Euclidean distance, if only the Euclidean distance between the current symbol and the theoretical symbol is compared, as the decoding depth increases, the optimal path may deviate, resulting in a decrease in the final decoding success rate.
由于符号叠加过程本身就是K个符号相互重叠,符号前后关联性较大,因此我们采取当前欧式距离与前面累加的欧式距离之和进行判断,这样可以随着译码深度的增加,更精确的判断最佳路径,提高译码成功率。Since the symbol superposition process itself is that K symbols overlap each other, and the symbols are highly correlated, we use the sum of the current Euclidean distance and the previous accumulated Euclidean distance to judge, so that as the decoding depth increases, more accurate judgments can be made. The optimal path improves the decoding success rate.
累加的欧式距离表达式记为: The cumulative Euclidean distance expression is written as:
其中Di,j表示当前符号累加之后的欧氏距离,其中由于第一个符号没有累加距离,因此只计算其当前距离dcurrent。i表示当前符号在整个接收符号序列中的索引,j表示累加符号的索引,共计2K种。Among them, D i, j represent the Euclidean distance after the accumulation of the current symbol, and since the first symbol has no accumulated distance, only its current distance d current is calculated. i represents the index of the current symbol in the entire received symbol sequence, and j represents the index of the accumulated symbol, and there are 2 K types in total.
Dprev_i-1表示当前节点yi之前经过筛选后的累加欧式距离,共计2K-1,即2K-1种Dprev_i-1是从2K种Di-1,j中筛选出来的。由于2K中状态仅第一路符号不同,最终只保留2K-1种欧氏距离和2K-1条最佳路径,因此Dprev_i-1共有2K-1种欧式距离,由于第一个符号没有累加距离,因此不存在Dprev_i-1。D prev_i-1 represents the cumulative Euclidean distance after screening before the current node y i , totaling 2 K-1 , that is, 2 K-1 kinds of D prev_i-1 are selected from 2 K kinds of D i-1,j . Since only the sign of the first path is different in 2 K states, only 2 K-1 Euclidean distances and 2 K-1 optimal paths are retained in the end, so D prev_i-1 has 2 K-1 Euclidean distances in total. Due to the first symbols have no accumulative distance, so D prev_i-1 does not exist.
dcurrent的值始终为当前符号与理论符号的欧式距离。The value of d current is always the Euclidean distance between the current symbol and the theoretical symbol.
第四、选择最佳路径Fourth, choose the best path
经过上述第三步的处理后,得到2K种累加欧式距离Di,j和路径pathj,j=1~2K,由于这2K种路径大体可分为2部分,即前一状态是输入+1还是输入-1。因此我们将2K个路径分为两部分,每部分包含2K-1条路径,将其对应的累加欧式距离也分为两部分。After the third step above, 2 K kinds of cumulative Euclidean distance D i,j and path j are obtained, j=1~2 K , because these 2 K kinds of paths can be roughly divided into two parts, that is, the previous state is Enter +1 or enter -1. Therefore, we divide the 2 K paths into two parts, each part contains 2 K-1 paths, and divide the corresponding cumulative Euclidean distance into two parts.
对每一部分对应的每行累加欧氏距离进行两两比较求最小者,即第一部分第一行与第二部分第一行比较,第一部分第二行与第二部分第二行比较,以此类推,求出每行的最小欧式距离,记录下这行对应的累加欧氏距离Di,j,并标注为新的筛选后的累加欧氏距离Dprev_i,其为计算i+1节点的累加欧氏距离Di+1,j中前i个节点的累加欧式距离而用,同时保留该累加欧式距离对应的符号路径path,对当前符号根据转移路径输入+1或者输入-1,并将相应的path的深度加1。The cumulative Euclidean distance of each row corresponding to each part is compared in pairs to find the smallest one, that is, the first row of the first part is compared with the first row of the second part, and the second row of the first part is compared with the second row of the second part, so that By analogy, find the minimum Euclidean distance for each row, record the cumulative Euclidean distance D i,j corresponding to this row, and mark it as the new filtered cumulative Euclidean distance D prev_i , which is the accumulation of the i+1 node
经过上述步骤处理后,又得到2K-1个欧氏距离Dprev_i及其对应的2K-1个符号路径path。After the above steps, 2 K-1 Euclidean distances D prev_i and corresponding 2 K-1 symbol paths are obtained.
第五、最后一个符号处理Fifth, the last symbol processing
根据第一至四步骤依次对其余符号处理,当处理完最后一个符号yN时,经过筛选得到了2K-1个欧氏距离dj及其对应的2K-1个符号路径path,此时path的深度为N。对2K-1个欧氏距离进行从小到大的排序,找出累加距离最小的欧式距离,得到其对应的索引,根据其索引,取出path对应索引的译码符号序列,即为最终的译码结果。According to the first to fourth steps, the remaining symbols are processed sequentially. When the last symbol y N is processed, 2 K-1 Euclidean distances d j and their corresponding 2 K-1 symbol path paths are obtained after screening. When the depth of the path is N. Sort the 2 K-1 Euclidean distances from small to large, find the Euclidean distance with the smallest cumulative distance, and obtain its corresponding index. According to its index, take out the decoding symbol sequence corresponding to the index of path, which is the final translation code result.
记译码后的序列为Sdecode(i),i=1~N。对比译码序列Sdecode(i)和输入序列xi,可以检验译码结果是否正确,同时计算系统的误码率。Denote the decoded sequence as S decode (i), i=1~N. Comparing the decoding sequence S decode (i) with the input sequence xi can check whether the decoding result is correct, and calculate the bit error rate of the system at the same time.
译码过程参考附图9中K=3,重叠时分输入-输出关系的码树图,附图10节点状态转移图,附图11中K=3,OvFDM系统的格状(Trelli)图。For the decoding process, refer to K=3 in accompanying drawing 9, the code tree diagram of overlapping time-division input-output relationship, the node state transition diagram in accompanying drawing 10, and K=3 in accompanying drawing 11, the trellis diagram of OvFDM system.
一般情况下,由于待译码的数据长度较长,且随着译码深度的加深,累加距离越来越大,系统若将所有数据全部译码完成后再进行译码输出,较消耗系统资源,因此对于路径的存储容量和距离的存储采取较优的处理方法。一般选取路径存储长度为4K~5K,此时如果路径存储器已经存满而译码判决输出还未进行强行判决输出,将具有相同路径的初始节点先进行输出;随着译码深度的加深,累加距离也会越来越大,可将累加距离存储为相对距离,即定义一个参考距离,其取值根据不同的系统而定,距离存储记录的是每条路径的第二距离相对于参考距离的相对值,在进行最佳路径的筛选时通过相对距离进行比较。In general, since the length of the data to be decoded is long, and with the deepening of the decoding depth, the accumulation distance becomes larger and larger, if the system decodes all the data and then performs decoding output, it will consume more system resources. , so a better processing method is adopted for the storage capacity of the path and the storage of the distance. Generally, the path storage length is selected to be 4K to 5K. At this time, if the path memory is full and the decoding judgment output has not yet been forced to be judged, the initial node with the same path will be output first; as the decoding depth deepens, the accumulated The distance will also become larger and larger, and the accumulated distance can be stored as a relative distance, that is, a reference distance is defined, and its value depends on different systems. The distance storage records the second distance of each path relative to the reference distance Relative value, compared by relative distance when screening the best path.
例如,本案例中我们以方波为复用波形来说明编译码过程。设置重叠复用次数K=3,输入序列长度N=9,符号序列xi={-1,+1,-1,+1,+1,+1,-1,+1,-1},经过OvFDM系统编码后输出序列长度变为11(N+K-1),输出符号序列s'(t)={-1,0,-1,+1,+1,+3,+1,+1,-1,0,-1},本案例符号叠加过程如附图12所示,由图中可以看到叠加后的符号序列中前两个和后两个符号不是3路的叠加,因此我们将这两部分信号进行互补叠加,放在中间符号的前面,形成互补OvFDM模式,互补叠加后的输出符号序列为s(t)={-1,-1,-1,+1,+1,+3,+1,+1,-1}。编码后的信号经过实际信道传输,在接收端接收到的符号序列会有偏差,记为yi,i=1~9。本案例中收到的符号序列为:For example, in this case, we use a square wave as the multiplexed waveform to illustrate the encoding and decoding process. Set the number of overlapping multiplexing K=3, the length of the input sequence N=9, the symbol sequence x i ={-1,+1,-1,+1,+1,+1,-1,+1,-1}, After being encoded by the OvFDM system, the length of the output sequence becomes 11 (N+K-1), and the output symbol sequence s'(t)={-1,0,-1,+1,+1,+3,+1,+ 1,-1,0,-1}, the superposition process of the symbols in this case is shown in Figure 12, it can be seen from the figure that the first two and the last two symbols in the superimposed symbol sequence are not 3-way superposition, so We perform complementary superposition of these two parts of the signal and place them in front of the middle symbol to form a complementary OvFDM mode. The output symbol sequence after complementary superposition is s(t)={-1,-1,-1,+1,+1 ,+3,+1,+1,-1}. The coded signal is transmitted through the actual channel, and the symbol sequence received at the receiving end will have deviation, which is denoted as y i , where i=1~9. The sequence of symbols received in this case is:
yi={-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995};y i ={-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995};
对所有符号按照上述的维特比译码方法逐个进行译码,译码过程符号检测路径如附图13所示。完成所有符号的译码后,得到四条最佳路径及其对应的欧氏距离,如下:All symbols are decoded one by one according to the aforementioned Viterbi decoding method, and the symbol detection path in the decoding process is shown in FIG. 13 . After decoding all symbols, four optimal paths and their corresponding Euclidean distances are obtained, as follows:
path1:{-1,1,-1,1,1,1,-1,1,1};path 1 : {-1,1,-1,1,1,1,-1,1,1};
path2:{-1,1,-1,1,1,1,-1,1,-1};path 2 : {-1,1,-1,1,1,1,-1,1,-1};
path3:{-1,1,-1,1,1,1,-1,-1,1};path 3 : {-1,1,-1,1,1,1,-1,-1,1};
path4:{-1,1,-1,1,1,1,-1,-1,-1};path 4 : {-1,1,-1,1,1,1,-1,-1,-1};
其对应的欧式距离依次为d1=8.1839,d2=6.1839,d3=8.1839,d4=7.7848,对这四个距离比较大小,得到d2的欧式距离最小,则对应的路径path2选择为输出符号序列。即我们认为输出的符号序列Sdecode={-1,1,-1,1,1,1,-1,1,-1},而输入的符号序列xi={-1,+1,-1,+1,+1,+1,-1,+1,-1},对比Sdecode和xi两者序列完全一致,则译码结果正确。The corresponding Euclidean distances are d 1 =8.1839, d 2 =6.1839, d 3 =8.1839, d 4 =7.7848. After comparing these four distances, the Euclidean distance of d 2 is the smallest, and the corresponding path path 2 is selected is the output sequence of symbols. That is, we think that the output symbol sequence S decode ={-1,1,-1,1,1,1,-1,1,-1}, and the input symbol sequence x i ={-1,+1,- 1,+1,+1,+1,-1,+1,-1}, comparing the sequences of S decode and xi are exactly the same, then the decoding result is correct.
第二个例子不妨以OvTDM系统来说明。The second example may wish to illustrate with the OvTDM system.
现有的OvTDM系统对数据的重叠呈平行四边形,编码后的数据前后各有一段“首段”和“尾段”,形状呈上三角和下三角状,刚好互补。我们将完成编码数据的“尾段”挪到“首段”的位置,或将“首段”挪到“尾段”的位置,即将下三角和上三角进行互补叠加,形成一个长方形状,可以称这种重叠为互补OvTDM系统。互补后的数据呈长方形状,每个数据都是K次的重叠,这样就解决了背景技术中现有技术存在的问题。The existing OvTDM system overlaps the data in a parallelogram shape, and there are a section of "first section" and "tail section" before and after the encoded data, and the shape is an upper triangle and a lower triangle, which are just complementary. We move the "tail section" of the encoded data to the position of the "first section", or move the "first section" to the position of the "tail section", that is, the lower triangle and the upper triangle are complementary superimposed to form a rectangular shape, which can be This overlap is called a complementary OvTDM system. The complementary data is in the shape of a rectangle, and each data is overlapped K times, thus solving the problems existing in the prior art in the background art.
编码过程如图14所示:The encoding process is shown in Figure 14:
(1)根据设计参数生成时域内的初始包络波形h(t)。(1) Generate the initial envelope waveform h(t) in the time domain according to the design parameters.
(2)将(1)中所设计的包络波形h(t)经特定时间移位后,形成其它各个时刻发送信号的偏移包络波形h(t-i×ΔT)。(2) After the envelope waveform h(t) designed in (1) is shifted by a specific time, an offset envelope waveform h(t-i×ΔT) of the transmitted signal at other times is formed.
(3)将所要发送的符号xi与(2)生成的相应时刻的偏移包络波形h(t-i×ΔT)相乘,得到各个时刻的调制包络波形xih(t-i×ΔT)。(3) Multiply the symbol xi to be transmitted by the offset envelope waveform h(ti×ΔT) generated in (2) at the corresponding time to obtain the modulation envelope waveform xi h(ti×ΔT) at each time.
(4)将(3)所形成的各个时刻的调制包络波形xih(t-i×ΔT)进行叠加,形成复调制包络波形以发射。复调制包络波形可表达如下: (4) The modulation envelope waveform x i h (ti×ΔT) at each time point formed in (3) is superimposed to form a complex modulation envelope waveform for transmission. The complex modulation envelope waveform can be expressed as follows:
以上为传统OvTDM系统的编码过程。(4)中的叠加过程,反映到数据的编码上,则如图1所示。对于一个符号长度为N的数据,经过上述调制和编码后,长度变为N+K-1,其具有一长度为K-1的未经过K次叠加的首段,还有一长度为K-1的未经过K次叠加的尾段。图1中的数据排布成平行四边形,左端三角形即为“首段数据”,右端三角形即为“尾段数据”,中间为充分叠加的数据。The above is the encoding process of the traditional OvTDM system. The superposition process in (4) is reflected in the coding of the data, as shown in Fig. 1 . For data with a symbol length of N, after the above modulation and encoding, the length becomes N+K-1, which has a length of K-1 without K-time superimposed first segment, and a length of K-1 The tail segment of , which has not undergone K times of stacking. The data in Figure 1 is arranged in a parallelogram, the triangle at the left end is the "first data", the triangle at the right is the "tail data", and the data in the middle is fully superimposed.
译码过程如图15所示:The decoding process is shown in Figure 15:
发送端将编码调制后的信号通过天线发射出去,信号在无线信道中传输,接收端对接收信号进行匹配滤波,再对信号分别进行抽样、译码,最终判决输出比特流。具体地:The transmitting end transmits the coded and modulated signal through the antenna, and the signal is transmitted in the wireless channel. The receiving end performs matching filtering on the received signal, and then samples and decodes the signal respectively, and finally judges and outputs the bit stream. specifically:
(5)首先对接收信号进行同步,包括载波同步、帧同步、符号时间同步等。(5) Synchronize the received signal first, including carrier synchronization, frame synchronization, symbol time synchronization, etc.
(6)根据取样定理,对每一帧内的接收信号进行数字化处理。(6) According to the sampling theorem, digitalize the received signal in each frame.
(7)对接收到的波形按照波形发送时间间隔切割。(7) Cut the received waveform according to the waveform sending time interval.
(8)按照一定的译码算法对切割后的波形进行译码。(8) Decode the cut waveform according to a certain decoding algorithm.
以上为传统OvTDM系统的编码过程,其在译码过程中,对尾段的数据不会进行译码,因为有用信息流的长度为N,所以只会对发送过来的长度为N+K-1的数据中的前N个数据进行译码。The above is the encoding process of the traditional OvTDM system. During the decoding process, the data in the tail segment will not be decoded, because the length of the useful information stream is N, so only the length of the transmitted information is N+K-1 The first N data in the data are decoded.
本申请的发明构思是将上述经过编码的长度为N+K-1的数据的首段挪至尾段,与原本的尾段进行叠加后形成新的尾段,从而形成一个新的数据长度为N的互补的编码数据,当然,也可以将尾段挪至首段进行叠加,如图16所示。上述的挪动过程,可以放到编程过程中,也可以放到译码过程中。在一实施例中,若将上述的挪动过程放到编程过程中,则可以在(4)中,将数据的首段/尾段挪至尾段/首段进行叠加。在一实施例中,若将上述的挪动过程放到译码过程中,则可以在(8)之前,将数据的首段/尾段挪至尾段/首段进行叠加。、The inventive idea of the present application is to move the first segment of the above-mentioned coded data with a length of N+K-1 to the tail segment, and superimpose with the original tail segment to form a new tail segment, thereby forming a new data length of The complementary coded data of N, of course, can also move the tail segment to the first segment for superimposition, as shown in FIG. 16 . The above-mentioned moving process can be put into the programming process, and can also be put into the decoding process. In one embodiment, if the above moving process is included in the programming process, then in (4), the first/last segment of the data can be moved to the last/first segment for superimposition. In an embodiment, if the above-mentioned moving process is put into the decoding process, before (8), the first segment/tail segment of the data can be moved to the tail segment/first segment for superimposition. ,
(8)中的译码算法,包含多种,例如维特比译码算法和迭代译码算法等。下面不妨以维特比译码方法为例进行说明。The decoding algorithm in (8) includes many kinds, such as Viterbi decoding algorithm and iterative decoding algorithm. Let's take the Viterbi decoding method as an example for illustration.
采用本申请后,在进行到(8)的译码时,是对长度为N的序列yi(i=1~N)进行译码,每一个符号都是K路符号叠加的结果,即是对互补的数据序列进行译码。After adopting this application, when proceeding to the decoding of (8), the sequence y i (i=1~N) of length N is decoded, and each symbol is the result of superposition of K-way symbols, that is The complementary data sequence is decoded.
第一、首先生成K路符号叠加后的可能状态,即理想符号Stheory(j),j=1~2K,共计2K种。Firstly, the possible states after superposition of K-way symbols are first generated, that is, ideal symbols S theory (j), j= 1˜2 K , 2 K types in total.
K路符号表示为:叠加后对应的表示形式为如果用+1来表示叠加后的输出电平,则共计包含K+1种符号电平,依次为:±K、±(K-2)、...±(K-2k),k=1~K/2,记为Ytheory(index),index=1~K+1。The K-road notation is expressed as: The corresponding expression after superposition is If +1 is used to represent the superimposed output level, then a total of K+1 symbol levels are included, followed by: ±K, ±(K-2), ... ±(K-2 k ), k= 1~K/2, recorded as Y theory (index), index=1~
比如K=3时,符号叠加后共计有8种状态,分别为: 对应输出的符号电平为±3、±1共四种,即Ytheory(1)=-3,Ytheory(2)=-1,Ytheory(3)=1,Ytheory(4)=3。For example, when K=3, there are a total of 8 states after the symbols are superimposed, which are: The corresponding output symbol levels are ±3 and ±1, a total of four types, namely Y theory (1)=-3, Y theory (2)=-1, Y theory (3)=1, Y theory (4)=3 .
第二、计算当前符号的测度距离。Second, calculate the measure distance of the current symbol.
测度距离表示两个信号之间的距离,定义为当p=2时,即为欧式距离,欧式距离是两个信号之间的真实距离,能够真实的反应实际信号和理想信号之间的距离,其定义为本实施案例中我们以欧式距离为例说明。The metric distance represents the distance between two signals and is defined as When p=2, it is the Euclidean distance. The Euclidean distance is the real distance between two signals, which can truly reflect the distance between the actual signal and the ideal signal. It is defined as In this implementation case, we take the Euclidean distance as an example.
使用当前符号yi(i=1~N)与(1)中生成的2K种理想符号Stheory(j)依次求欧式距离,得到2k个欧氏距离。记为 Use the current symbol y i (i=1~N) and 2 K kinds of ideal symbols S theory (j) generated in (1) to calculate the Euclidean distance sequentially, and obtain 2 k Euclidean distances. recorded as
第三、计算当前符号的累加距离。Third, calculate the cumulative distance of the current symbol.
在比较欧式距离时,如果只对比当前符号与理论符号的欧式距离,随着译码深度的增加,最佳路径可能会有偏差,导致最终译码的成功率降低。When comparing the Euclidean distance, if only the Euclidean distance between the current symbol and the theoretical symbol is compared, as the decoding depth increases, the optimal path may deviate, resulting in a decrease in the final decoding success rate.
由于符号叠加过程本身就是K个符号相互重叠,符号前后关联性较大,因此我们采取当前欧式距离与前面累加的欧式距离之和进行判断,这样可以随着译码深度的增加,更精确的判断最佳路径,提高译码成功率。Since the symbol superposition process itself is that K symbols overlap each other, and the symbols are highly correlated, we use the sum of the current Euclidean distance and the previous accumulated Euclidean distance to judge, so that as the decoding depth increases, more accurate judgments can be made. The optimal path improves the decoding success rate.
累加的欧式距离表达式记为: The cumulative Euclidean distance expression is written as:
其中Di,j表示当前符号累加之后的欧氏距离,其中由于第一个符号没有累加距离,因此只计算其当前距离dcurrent。i表示当前符号在整个接收符号序列中的索引,j表示累加符号的索引,共计2K种。Among them, D i, j represent the Euclidean distance after the accumulation of the current symbol, and since the first symbol has no accumulated distance, only its current distance d current is calculated. i represents the index of the current symbol in the entire received symbol sequence, and j represents the index of the accumulated symbol, and there are 2 K types in total.
Dprev_i-1表示当前节点yi之前经过筛选后的累加欧式距离,共计2K-1,即2K-1种Dprev_i-1是从2K种Di-1,j中筛选出来的。由于2K中状态仅第一路符号不同,最终只保留2K-1种欧氏距离和2K-1条最佳路径,因此Dprev_i-1共有2K-1种欧式距离,由于第一个符号没有累加距离,因此不存在Dprev_i-1。dcurrent的值始终为当前符号与理论符号的欧式距离。D prev_i-1 represents the cumulative Euclidean distance after screening before the current node y i , totaling 2 K-1 , that is, 2 K-1 kinds of D prev_i-1 are selected from 2 K kinds of D i-1,j . Since only the sign of the first path is different in 2 K states, only 2 K-1 Euclidean distances and 2 K-1 optimal paths are retained in the end, so D prev_i-1 has 2 K-1 Euclidean distances in total. Due to the first symbols have no accumulative distance, so D prev_i-1 does not exist. The value of d current is always the Euclidean distance between the current symbol and the theoretical symbol.
第四、选择最佳路径。Fourth, choose the best path.
经过上述第三步的处理后,得到2K种累加欧式距离Di,j和路径pathj,j=1~2K,由于这2K种路径可分为2部分,即前一状态是输入+1还是输入-1。因此我们将2K个路径分为两部分,每部分包含2K-1条路径,将其对应的累加欧式距离也分为两部分。After the processing of the third step above, 2 K kinds of cumulative Euclidean distances D i,j and path j are obtained, j=1~2 K , because these 2 K kinds of paths can be divided into two parts, that is, the previous state is the input +1 or -1 for typing. Therefore, we divide the 2 K paths into two parts, each part contains 2 K-1 paths, and divide the corresponding cumulative Euclidean distance into two parts.
对每一部分对应的每行累加欧氏距离进行两两比较求最小者,即第一部分第一行与第二部分第一行比较,第一部分第二行与第二部分第二行比较,以此类推,求出每行的最小欧式距离,记录下这行对应的累加欧氏距离Di,j,并标注为新的筛选后的累加欧氏距离Dprev_i,其为计算i+1节点的累加欧氏距离Di+1,j中前i个节点的累加欧式距离而用,同时保留该累加欧式距离对应的符号路径path,对当前符号根据转移路径输入+1或者输入-1,并将相应的path的深度加1。The cumulative Euclidean distance of each row corresponding to each part is compared in pairs to find the smallest one, that is, the first row of the first part is compared with the first row of the second part, and the second row of the first part is compared with the second row of the second part, so that By analogy, find the minimum Euclidean distance for each row, record the cumulative Euclidean distance D i,j corresponding to this row, and mark it as the new filtered cumulative Euclidean distance D prev_i , which is the accumulation of the i+1 node The accumulated Euclidean distance of the first i nodes in the Euclidean distance D i+1,j is used, and the symbol path path corresponding to the accumulated Euclidean distance is reserved at the same time. For the current symbol, input +1 or -1 according to the transfer path, and the corresponding The depth of the path is increased by 1.
经过上述步骤处理后,又得到2K-1个欧氏距离Dprev_i及其对应的2K-1个符号路径path。After the above steps, 2 K-1 Euclidean distances D prev_i and corresponding 2 K-1 symbol paths are obtained.
第五、最后一个符号处理。Fifth, the last symbol processing.
根据第一至四步骤依次对其余符号处理,当处理完最后一个符号yN时,经过筛选得到了2K-1个欧氏距离dj及其对应的2K-1个符号路径path,此时path的深度为N。对2K-1个欧氏距离进行从小到大的排序,找出累加距离最小的欧式距离,得到其对应的索引,根据其索引,取出path对应索引的译码符号序列,即为最终的译码结果。According to the first to fourth steps, the remaining symbols are processed sequentially. When the last symbol y N is processed, 2 K-1 Euclidean distances d j and their corresponding 2 K-1 symbol path paths are obtained after screening. When the depth of the path is N. Sort the 2 K-1 Euclidean distances from small to large, find the Euclidean distance with the smallest cumulative distance, and obtain its corresponding index. According to its index, take out the decoding symbol sequence corresponding to the index of path, which is the final translation code result.
记译码后的序列为Sdecode(i),i=1~N。对比译码序列Sdecode(i)和输入序列xi,可以检验译码结果是否正确,同时计算系统的误码率。Denote the decoded sequence as S decode (i), i=1~N. Comparing the decoding sequence S decode (i) with the input sequence xi can check whether the decoding result is correct, and calculate the bit error rate of the system at the same time.
译码过程参考附图17中K=3,重叠时分输入-输出关系的码树图,附图18节点状态转移图,附图19的K=3,OvTDM系统格状(Trelli)图。For the decoding process, refer to K=3 in the accompanying drawing 17, the code tree diagram of the overlapping time-division input-output relationship, the node state transition diagram in the accompanying drawing 18, and the K=3 in the accompanying drawing 19, the OvTDM system trellis (Trelli) diagram.
一般情况下,由于待译码的数据长度较长,且随着译码深度的加深,累加距离越来越大,系统若将所有数据全部译码完成后再进行译码输出,较消耗系统资源,因此对于路径的存储容量和距离的存储采取较优的处理方法。一般选取路径存储长度为4K~5K,此时如果路径存储器已经存满而译码判决输出还未进行强行判决输出,将具有相同路径的初始节点先进行输出;随着译码深度的加深,累加距离也会越来越大,可将累加距离存储为相对距离,即定义一个参考距离,其取值根据不同的系统而定,距离存储记录的是每条路径的第二距离相对于参考距离的相对值,在进行最佳路径的筛选时通过相对距离进行比较。In general, since the length of the data to be decoded is long, and with the deepening of the decoding depth, the accumulation distance becomes larger and larger, if the system decodes all the data and then performs decoding output, it will consume more system resources. , so a better processing method is adopted for the storage capacity of the path and the storage of the distance. Generally, the path storage length is selected to be 4K to 5K. At this time, if the path memory is full and the decoding judgment output has not yet been forced to make a judgment output, the initial node with the same path will be output first; as the decoding depth deepens, the accumulated The distance will also become larger and larger, and the accumulated distance can be stored as a relative distance, that is, a reference distance is defined, and its value depends on different systems. The distance storage records the second distance of each path relative to the reference distance Relative value, compared by relative distance when screening the best path.
例如,本案例中我们以方波为复用波形来说明编译码过程。设置重叠复用次数K=3,输入序列长度N=9,符号序列xi={-1,+1,-1,+1,+1,+1,-1,+1,-1},经过OvTDM系列编码后输出序列长度变为11(N+K-1),输出符号序列s'(t)={-1,0,-1,+1,+1,+3,+1,+1,-1,0,-1},本案例符号叠加过程如附图20所示,由图中可以看到叠加后的符号序列中前两个和后两个符号不是3路的叠加,因此我们将这两部分信号进行互补叠加,放在中间符号的前面,形成互补OvTDM模式,互补叠加后的输出符号序列为s(t)={-1,-1,-1,+1,+1,+3,+1,+1,-1}。编码后的信号经过实际信道传输,在接收端接收到的符号序列会有偏差,记为yi,i=1~9。本案例中收到的符号序列为:For example, in this case, we use a square wave as the multiplexed waveform to illustrate the encoding and decoding process. Set the number of overlapping multiplexing K=3, the length of the input sequence N=9, the symbol sequence x i ={-1,+1,-1,+1,+1,+1,-1,+1,-1}, After OvTDM series encoding, the output sequence length becomes 11(N+K-1), and the output symbol sequence s'(t)={-1,0,-1,+1,+1,+3,+1,+ 1,-1,0,-1}, the superposition process of the symbols in this case is shown in Figure 20, and it can be seen from the figure that the first two and the last two symbols in the superimposed symbol sequence are not a 3-way superposition, so We perform complementary superposition of these two parts of the signal and place them in front of the middle symbol to form a complementary OvTDM mode. The output symbol sequence after complementary superposition is s(t)={-1,-1,-1,+1,+1 ,+3,+1,+1,-1}. The coded signal is transmitted through the actual channel, and the symbol sequence received at the receiving end will have deviation, which is denoted as y i , where i=1~9. The sequence of symbols received in this case is:
yi={-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995};y i ={-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995};
对所有符号按照上述的维特比译码方法逐个进行译码,译码过程符号检测路径如附图21所示。完成所有符号的译码后,得到四条最佳路径及其对应的欧氏距离,如下:All symbols are decoded one by one according to the aforementioned Viterbi decoding method, and the symbol detection path in the decoding process is shown in FIG. 21 . After decoding all symbols, four optimal paths and their corresponding Euclidean distances are obtained, as follows:
path1:{-1,1,-1,1,1,1,-1,1,1};path 1 : {-1,1,-1,1,1,1,-1,1,1};
path2:{-1,1,-1,1,1,1,-1,1,-1};path 2 : {-1,1,-1,1,1,1,-1,1,-1};
path3:{-1,1,-1,1,1,1,-1,-1,1};path 3 : {-1,1,-1,1,1,1,-1,-1,1};
path4:{-1,1,-1,1,1,1,-1,-1,-1};path 4 : {-1,1,-1,1,1,1,-1,-1,-1};
其对应的欧式距离依次为d1=8.1839,d2=6.1839,d3=8.1839,d4=7.7848,对这四个距离比较大小,得到d2的欧式距离最小,则对应的路径path2选择为输出符号序列。即我们认为输出的符号序列Sdecode={-1,1,-1,1,1,1,-1,1,-1},而输入的符号序列xi={-1,+1,-1,+1,+1,+1,-1,+1,-1},对比Sdecode和xi两者序列完全一致,则译码结果正确。The corresponding Euclidean distances are d 1 =8.1839, d 2 =6.1839, d 3 =8.1839, d 4 =7.7848. After comparing these four distances, the Euclidean distance of d 2 is the smallest, and the corresponding path path 2 is selected is the output sequence of symbols. That is, we think that the output symbol sequence S decode ={-1,1,-1,1,1,1,-1,1,-1}, and the input symbol sequence x i ={-1,+1,- 1,+1,+1,+1,-1,+1,-1}, comparing the sequences of S decode and xi are exactly the same, then the decoding result is correct.
本申请的互补编码方法及装置、互补译码方法及装置,在同等信噪比的情况下,可达到较高的译码成功率,其除了应用在OvTDM和OvFDM等系统中,也可广泛应用于实际移动通信系统中,如TD-LTE、TD-SCDMA等系统,也可广泛应用于卫星通信、微波视距通信、散射通信、大气层光通信、红外通信与水生通信等任何无线通信系统中。既可以应用于大容量无线传输,也可以应用于小容量的轻型无线电系统。The complementary encoding method and device, complementary decoding method and device of the present application can achieve a higher decoding success rate under the same signal-to-noise ratio, and can be widely used in addition to OvTDM and OvFDM systems In the actual mobile communication system, such as TD-LTE, TD-SCDMA and other systems, it can also be widely used in any wireless communication system such as satellite communication, microwave line-of-sight communication, scattering communication, atmospheric optical communication, infrared communication and aquatic communication. It can be applied not only to large-capacity wireless transmission, but also to small-capacity light radio systems.
上内容是结合具体的实施方式对本申请所作的进一步详细说明,不能认定本申请的具体实施只局限于这些说明。对于本申请所属技术领域的普通技术人员来说,在不脱离本申请发明构思的前提下,还可以做出若干简单推演或替换。The above content is a further detailed description of the application in conjunction with specific implementation methods, and it cannot be determined that the specific implementation of the application is limited to these descriptions. For those of ordinary skill in the technical field to which the present application belongs, some simple deduction or replacement can also be made without departing from the inventive concept of the present application.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610592255.0A CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary encoding method and device, complementary decoding method and device, OvXDM system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610592255.0A CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary encoding method and device, complementary decoding method and device, OvXDM system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107645364A CN107645364A (en) | 2018-01-30 |
| CN107645364B true CN107645364B (en) | 2022-12-09 |
Family
ID=61109900
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610592255.0A Expired - Fee Related CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary encoding method and device, complementary decoding method and device, OvXDM system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107645364B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112491494B (en) * | 2019-09-11 | 2023-05-09 | 中国移动通信有限公司研究院 | Code determining method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1269085A (en) * | 1998-03-13 | 2000-10-04 | 末广直树 | Comb-like spectrum communication method of complementary series repetition modulation type |
| CN1625079A (en) * | 2003-10-30 | 2005-06-08 | 朗迅科技公司 | System and method for providing multi-beam scheduling |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN103454495A (en) * | 2013-09-13 | 2013-12-18 | 电子科技大学 | Self-adaptive high-precision fast spectral analysis method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100568863C (en) * | 2005-09-30 | 2009-12-09 | 中国科学院上海微系统与信息技术研究所 | Transmitting and receiving device and method based on multi-subband filter bank |
| US8121299B2 (en) * | 2007-08-30 | 2012-02-21 | Texas Instruments Incorporated | Method and system for music detection |
| CN103179067B (en) * | 2013-03-07 | 2015-07-29 | 西安理工大学 | A kind of multi-system digital communication carrier modulation method |
| CN103795544B (en) * | 2014-02-12 | 2017-04-19 | 天地融科技股份有限公司 | Audio signal transmitting method, mobile terminal and intelligent secret key device |
-
2016
- 2016-07-22 CN CN201610592255.0A patent/CN107645364B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1269085A (en) * | 1998-03-13 | 2000-10-04 | 末广直树 | Comb-like spectrum communication method of complementary series repetition modulation type |
| CN1625079A (en) * | 2003-10-30 | 2005-06-08 | 朗迅科技公司 | System and method for providing multi-beam scheduling |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN103454495A (en) * | 2013-09-13 | 2013-12-18 | 电子科技大学 | Self-adaptive high-precision fast spectral analysis method |
Non-Patent Citations (1)
| Title |
|---|
| 《重叠频分复用系统循环前缀的设计和分析》;王键;《电子科技大学学报》;20090131;32-39 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107645364A (en) | 2018-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107769841B (en) | Iterative demodulation method of satellite communication turbo code under high dynamic and extremely low signal-to-noise ratio | |
| US11575547B2 (en) | Data transmission network configuration | |
| CN105684373B (en) | CPFSK receiver with frequency offset correction and matched filter bank decoding | |
| WO2018068540A1 (en) | Overlapped multiplexing-based modulation and demodulation method and device | |
| CN109039468A (en) | A kind of information modulation method, information demodulation method, device and communication system | |
| US10771303B2 (en) | Overlapped multiplexing-based decoding method and device, and modulation and demodulation method and system | |
| CN107645364B (en) | Complementary encoding method and device, complementary decoding method and device, OvXDM system | |
| CN101207614A (en) | Mode detection and signal frame recognition method and device | |
| CN107645360B (en) | OvXDM system decoding method and device and OvXDM system | |
| CN106911421B (en) | Decoding method, device and system thereof | |
| CN106656415A (en) | Data superframe generation method of adaptive transmission channel | |
| CN109067494A (en) | A kind of UAT data-link time synchronization method and device about CPFSK Modulation Types | |
| Turin | Simulation of error sources in digital channels | |
| WO2018019109A1 (en) | Decoding method, device and system based on overlapped multiplexing | |
| CN101889408B (en) | An Improved Method for Bit Synchronous Digitization | |
| CN107979547A (en) | Channel estimation methods and device | |
| WO2018077028A1 (en) | Signal processing method and apparatus | |
| JP2739318B2 (en) | Maximum likelihood receiver | |
| CN108600139B (en) | A Viterbi Decoding Method for GMSK Signals with Arbitrary Information Rate | |
| CN107979549A (en) | Channel estimation methods and device | |
| CN107645363B (en) | Quick decoding method and device suitable for OvXDM system and OvXDM system | |
| CN116961816A (en) | Clock recovery method and system for optical fiber communication system | |
| CN107645466A (en) | Method and device applied to the IQ independent process of satellite high-speed digital transmission system | |
| CN107979553B (en) | Carrier synchronization method and device | |
| CN107277913A (en) | Time synchronization method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190830 Address after: 518057 2nd Floor, No. 9 Software Building, Zhongxin Road, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd. Address before: Bantian street Longgang District of Shenzhen City, Guangdong province 518000 Jihua Road, the new world Huasai Industrial Area No. 2, building 101 (two floor) 201 Applicant before: SHENZHEN SUPER DATA LINK TECHNOLOGY Ltd. |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20221116 Address after: 276000 Room 1511, Building A, Applied Science City, Nanjing Road, Liuqing Street, Lanshan District, Linyi City, Shandong Province Applicant after: Shandong No.1 Ark Robot Intelligent Technology Co.,Ltd. Address before: 518057 2nd floor, software building, No.9, Gaoxin middle 1st Road, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Applicant before: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20221209 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |