WO2016154964A1 - 一种查找表的生成方法和装置、预补偿方法和装置 - Google Patents

一种查找表的生成方法和装置、预补偿方法和装置 Download PDF

Info

Publication number
WO2016154964A1
WO2016154964A1 PCT/CN2015/075687 CN2015075687W WO2016154964A1 WO 2016154964 A1 WO2016154964 A1 WO 2016154964A1 CN 2015075687 W CN2015075687 W CN 2015075687W WO 2016154964 A1 WO2016154964 A1 WO 2016154964A1
Authority
WO
WIPO (PCT)
Prior art keywords
symbol
sequence
sub
symbol sequence
center
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.)
Ceased
Application number
PCT/CN2015/075687
Other languages
English (en)
French (fr)
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP15886934.7A priority Critical patent/EP3249819B1/en
Priority to JP2017550207A priority patent/JP6455765B2/ja
Priority to CN201580023454.3A priority patent/CN106464274B/zh
Priority to MX2017011782A priority patent/MX367848B/es
Priority to PCT/CN2015/075687 priority patent/WO2016154964A1/zh
Publication of WO2016154964A1 publication Critical patent/WO2016154964A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/50—Transmitters
    • H04B10/58—Compensation for non-linear transmitter output
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/62—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission for providing a predistortion of the signal in the transmitter and corresponding correction in the receiver, e.g. for improving the signal/noise ratio
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/25—Arrangements specific to fibre transmission
    • H04B10/2507—Arrangements specific to fibre transmission for the reduction or elimination of distortion or dispersion
    • H04B10/2543—Arrangements specific to fibre transmission for the reduction or elimination of distortion or dispersion due to fibre non-linearities, e.g. Kerr effect
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/32—Carrier systems characterised by combinations of two or more of the types covered by groups H04L27/02, H04L27/10, H04L27/18 or H04L27/26
    • H04L27/34—Amplitude- and phase-modulated carrier systems, e.g. quadrature-amplitude modulated carrier systems
    • H04L27/36—Modulator circuits; Transmitter circuits
    • H04L27/366—Arrangements for compensating undesirable properties of the transmission path between the modulator and the demodulator
    • H04L27/367—Arrangements for compensating undesirable properties of the transmission path between the modulator and the demodulator using predistortion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/02—Transmitters
    • H04B1/04—Circuits
    • H04B2001/0408—Circuits with power amplifiers
    • H04B2001/0425—Circuits with power amplifiers with linearisation using predistortion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B2210/00—Indexing scheme relating to optical transmission systems
    • H04B2210/25—Distortion or dispersion compensation
    • H04B2210/254—Distortion or dispersion compensation before the transmission line, i.e. pre-compensation

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a method and apparatus for generating a lookup table, a method and apparatus for precompensating.
  • the actual drive amplifier and modulator have nonlinear effects, and there are nonlinear effects such as self-phase modulation in the optical fiber, so the signal received by the optical communication system will exist based on the phase and amplitude of the symbol sequence.
  • Nonlinear degradation In the optical communication system, the actual drive amplifier and modulator have nonlinear effects, and there are nonlinear effects such as self-phase modulation in the optical fiber, so the signal received by the optical communication system will exist based on the phase and amplitude of the symbol sequence. Nonlinear degradation.
  • DSP Digital Signal Processing
  • LUT Lookup Table
  • a widely used nonlinear pre-compensation scheme is to compensate for nonlinearly introduced signal distortion by processing the input communication signal in the electrical domain prior to the electro-optical conversion and transmission over the optical link of the communication system.
  • the electrical input signal is processed, for example, using a compensation operator to generate a pre-distorted electrical signal, and the corresponding pre-distorted electrical signal is used to modulate the light source to generate a pre-distorted optical signal for transmission via the optical communication system.
  • the LUT is required to be used in the step of inputting a signal at a digital processing point, wherein the LUT table can be generated by calculating a sequence of each of the predetermined N symbol sequences (the N symbol sequence refers to a sequence of symbols of length N).
  • the value of the pre-distorted electrical signal storing each calculated value and the sequence number of the calculated value to generate a LUT.
  • the electrical input signal needs to be converted into a series of K-bit words, each K-bit word being used as an index value to access the corresponding register of the look-up table.
  • the 16 Quad Quadrature Amplitude Modulation (QAM) modulation mode when the electrical input signal is a two-level signal, if the length of the symbol sequence is N, the resource of the LUT is equal to 2 n , and the electrical input signal is four. In the case of a level signal, if the length of the symbol sequence is N, the resource of the LUT is equal to 4 n . If a better compensation effect is to be obtained, usually N needs to take a relatively large value, so that the resources of the LUT will increase exponentially; In addition, as the modulation mode of the signal increases, the number of levels of the electrical input signal also increases, which also causes a sharp increase in LUT resources.
  • QAM Quad Quadrature Amplitude Modulation
  • the current LUT is a nonlinear deviation value for storing the N symbol sequence
  • the resources of the LUT will increase exponentially.
  • the embodiment of the invention provides a method and a device for generating a lookup table, a precompensation method and a device, which are used to solve the problem that the current LUT is a non-linear deviation value of the stored N symbol sequence.
  • the problem of exponential growth is presented.
  • a method for generating a lookup table including:
  • the first symbol sequence is a sequence of any one of a preset set of N symbol sequences; when N is an odd number, the central symbol is the a (N+1)/2th symbol in a symbol sequence, when N is an even number, the center symbol is the N/2th symbol or the N/2+1th symbol in the first symbol sequence ; N is an integer not less than 3;
  • the sub-symbol sequence with the center symbol as the last symbol is stored corresponding to its nonlinear deviation value to form a first look-up table in the cascaded lookup table;
  • the sub-symbol sequence having the center symbol as the first symbol is stored corresponding to its non-linear deviation value to constitute a second look-up table in the concatenated lookup table.
  • the method further includes:
  • edge symbols being the center symbol in the first symbol sequence or sub-symbol sequence and A symbol other than the symbol adjacent to the center symbol.
  • a second possible implementation manner when the number of symbols spaced between the first edge symbol and the center symbol is smaller than the interval between the second edge symbol and the center symbol The number of possible symbols of the first edge symbol after the number of levels is reduced is not less than the number of possible levels of the second edge symbol after the number of levels is reduced;
  • the first edge symbol, the second edge symbol, and the center symbol are all included in the same symbol sequence.
  • a lookup table generating apparatus including:
  • a segmentation module configured to divide the first symbol sequence into two sub-symbol sequences; wherein each symbol in the first symbol sequence to the central symbol constitutes a sub-symbol sequence, the central symbol to the Each symbol of the last symbol in the first symbol sequence constitutes another sub-symbol sequence;
  • the first symbol sequence is any one of a predetermined set of N symbol sequences; when N is an odd number, the center The symbol is the (N+1)/2th symbol in the first symbol sequence, and when N is an even number, the center symbol is the N/2th symbol or the N/th in the first symbol sequence. 2+1 symbols; N is an integer not less than 3;
  • a calculation module configured to take a statistical average of each sub-symbol sequence, and calculate a nonlinear deviation value according to the statistical average result
  • a building module configured to store the sub-symbol sequence with the center symbol as the last symbol and the non-linear deviation value thereof to form a first look-up table in the cascaded lookup table; and to use the center symbol as the sub-symbol sequence of the first symbol
  • the linear deviation value corresponding storage constitutes a second lookup table in the cascaded lookup table.
  • the device when N is greater than 3, the device further includes a compression module;
  • the compression module is configured to reduce a number of levels other than the highest level and the lowest level among the possible levels of the respective edge symbols; the edge symbols are in the first symbol sequence or the sub-symbol sequence except the center A symbol and a symbol other than the symbol adjacent to the center symbol.
  • the number of possible levels of the first edge symbol after the number of levels is reduced is not a number of possible levels of the second edge symbol less than the reduced number of levels;
  • the first edge symbol, the second edge symbol, and the center symbol are all included in the same symbol sequence.
  • a third aspect provides a pre-compensation method for generating a lookup table according to an embodiment of the present invention, where the method includes:
  • a fourth aspect provides a pre-compensation apparatus for generating a lookup table according to an embodiment of the present invention, where the apparatus includes:
  • a search module configured to search for a non-linear deviation value of a sequence of sub-symbols formed by the first symbol in the sequence of N symbols to the symbols of the center symbol from a first look-up table for an N-symbol sequence converted from an electrical input signal And finding, from the second lookup table, a non-linear deviation value of the sub-symbol sequence formed by the central symbol in the sequence of N symbols to the respective symbols of the last symbol;
  • a summation module summing the N symbol sequence, the nonlinear deviation value found from the first lookup table, and the nonlinear deviation value found from the second lookup table to obtain the sequence of the N symbol Predistorted symbol sequence.
  • a method and device for generating a lookup table, a precompensation method and apparatus provided by an embodiment of the present invention, when generating a lookup table, divide each N symbol sequence into two sub symbol sequences, and calculate a linearity of each sub symbol sequence.
  • the offset value, and the sequence of sub-symbols with the center symbol as the last symbol The linear deviation value correspondingly stores the first lookup table in the cascading lookup table, and the subsymbol sequence whose center symbol is the first symbol is stored corresponding to the nonlinear deviation value thereof to form a second lookup table in the cascading lookup table.
  • one LUT in the prior art is divided into a first LUT and a second LUT in the cascade LUT, and the sum of the resources of the first LUT and the resources of the second LUT is much less than that in the prior art.
  • the resources of one LUT therefore, in the case that the lengths of the symbol sequences are equal, the LUT generated by the embodiment of the present invention generates less resources of the LUT than the resources of the LUT generated by the prior art, so that the same hardware resources can be used. Under the condition, the length of the symbol sequence is taken longer to achieve better compensation effect.
  • FIG. 1 is a flowchart of a method for generating a lookup table according to an embodiment of the present invention
  • 2 is a schematic diagram of an N symbol sequence divided into two sub-symbol sequences
  • FIG. 3 is a second flowchart of a method for generating a lookup table according to an embodiment of the present invention
  • 4 is a schematic diagram of possible levels of individual symbols after the number of possible levels of edge symbols in a sequence of N symbols is reduced;
  • FIG. 5 is a third flowchart of a method for generating a lookup table according to an embodiment of the present invention.
  • 6 is a schematic diagram of possible levels of respective symbols after the number of possible levels of edge symbols in which the sequence of N symbols is not two sub-symbol sequences;
  • FIG. 7 is a second schematic diagram of an N symbol sequence divided into two sub-symbol sequences
  • FIG. 8 is a schematic structural diagram of a device for generating a lookup table according to an embodiment of the present disclosure
  • FIG. 9 is a second schematic structural diagram of a device for generating a lookup table according to an embodiment of the present invention.
  • FIG. 9b is a third schematic structural diagram of a device for generating a lookup table according to an embodiment of the present invention.
  • FIG. 10 is a flowchart of a pre-compensation method according to an embodiment of the present invention.
  • FIG. 11 is a block diagram of an implementation of a pre-compensation method according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a pre-compensation device according to an embodiment of the present invention.
  • the method and device for generating a lookup table and the pre-compensation method and apparatus provided by the embodiments of the present invention generate two cascaded LUTs by dividing the N symbol sequence into two sub-symbol sequences, so that the lengths of the symbol sequences are equal.
  • the LUT generated by the method for generating the LUT provided by the embodiment of the present invention has less resources than the LUT generated by the prior art. Therefore, the length of the symbol sequence can be longer under the condition of the same hardware resource, thereby realizing Better compensation.
  • the method for generating a lookup table provided by the embodiment of the present invention, as shown in FIG. 1 includes:
  • the first symbol sequence is divided into two sub-symbol sequences; wherein each symbol in the first symbol sequence to the central symbol constitutes a sub-symbol sequence, and the central symbol is to the first symbol
  • Each symbol of the last symbol in the sequence constitutes another sub-symbol sequence;
  • the first symbol sequence is any one of a preset set of N symbol sequences; when N is an odd number, the center symbol is The (N+1)/2th symbol in the first symbol sequence, when N is an even number, the center symbol is the N/2th symbol or the N/2+1 in the first symbol sequence Symbol; N is an integer not less than 3;
  • the sub-symbol sequence with the center symbol being the last symbol is stored corresponding to the nonlinear deviation value thereof to form a first look-up table in the cascaded lookup table.
  • the sub-symbol sequence with the center symbol being the first symbol is stored corresponding to the nonlinear deviation value thereof to form a second lookup table in the concatenation lookup table.
  • S103 may be executed first, then S104 may be executed, S104 may be executed first, S103 may be executed, or S103 and S104 may be simultaneously executed.
  • FIG. 2 is a schematic structural diagram of a first symbol sequence, each box is a symbol, wherein a gray box is a center symbol, and a first symbol sequence includes a first symbol 1 and a second symbol. Symbol 2, third symbol 3, fourth symbol 4, and fifth symbol 5, the third symbol 3 is centered symbol.
  • S101 is to divide the first symbol sequence into two sub-symbol sequences by a central symbol, wherein one sub-symbol sequence is composed of a first symbol 1, a second symbol 2, and a third symbol 3 in the first symbol sequence. Another sub-symbol sequence is composed of a third symbol 3, a fourth symbol 4, and a fifth symbol 5 in the first symbol sequence.
  • the resource of the LUT is k N when the LUT is generated according to the prior art; and the LUT provided by the embodiment of the present invention when N is an odd number
  • the resource of the LUT generated by the generation method is 2*k (N+1)/2 ; when N is an even number, the resource of the LUT generated by the method for generating the LUT according to the embodiment of the present invention is 5*k N/2 ,
  • the length of the symbol sequence can be taken longer under the same hardware resources, thereby achieving better compensation effect.
  • the farther the edge symbol is from the center symbol the smaller the effect of the edge symbol on the center symbol. Therefore, the smaller the number of possible levels of the edge symbol, the smaller the effect on the center symbol. In this way, the resources of the LUT can be further reduced.
  • the method for generating the LUT provided by the embodiment of the present invention is as shown in FIG. 3, and further includes:
  • S301 Decrease, among the possible levels of each edge symbol, a number of levels other than a highest level and a lowest level; the edge symbol is a center symbol and adjacent to the center symbol in the first symbol sequence. Symbols other than symbols.
  • S301 is performed before S101, that is, before the first symbol sequence is divided into two sub-symbol sequences, the highest level and the lowest level are among the possible levels of the respective edge symbols in the first symbol sequence. The number of levels other than the one is reduced.
  • FIG. 4 is a schematic structural diagram of a first symbol sequence, each box is a symbol, wherein a gray box is a center symbol, and a first symbol sequence includes a first symbol 1
  • the second symbol 2, the third symbol 3, the fourth symbol 4, and the fifth symbol 5, and the third symbol 3 is a center symbol.
  • the possible levels of each symbol in the first symbol sequence are -3, -1, 1 and 3, respectively, since the first symbol 1 in the first symbol sequence is far from the center symbol, the first one can be The number of possible levels of symbol 1 is reduced, ie the possible of the first symbol 1 The number of values is reduced, so that the possible level of the first symbol 1 can be -3, 1, 3, or -3, -1, 3.
  • the possible level of the fifth symbol 5 may be -3, 1, 3, or -3, - 1, 3.
  • the method for generating the LUT provided by the embodiment of the present invention is as shown in FIG. 5, and further includes:
  • S501 Decrease, among the possible levels of the edge symbols, a number of levels other than the highest level and the lowest level; the edge symbols are the center symbol and the center symbol adjacent to the center symbol. Symbols other than symbols.
  • S501 is executed after S101, that is, after dividing the sub-symbol sequence into two sub-sequence symbols, the level of each edge symbol in the sub-symbol sequence, except for the highest level and the lowest level, is excluded. The number of levels is reduced.
  • FIG. 6 is a schematic structural diagram of two sub-symbol sequences divided into a first symbol sequence, each box is a symbol, wherein a gray box is a center symbol, and a sub-symbol sequence is used.
  • the first symbol 1, the second symbol 2, and the third symbol 3 are included, and the other sub-symbol sequence includes a third symbol 3, a fourth symbol 4, and a fifth symbol 5, and the third symbol 3 is centered. symbol.
  • the possible levels of each symbol in each sub-symbol sequence are -3, -1, 1, and 3, respectively.
  • the first one can be The number of possible levels of symbol 1 is reduced, that is, the number of possible values of the first symbol 1 is reduced, so that the possible level of the first symbol 1 may be -3, 1, 3, or -3, -1, 3.
  • the possible level of the fifth symbol 5 may be -3, 1, 3, or -3. -1, 3.
  • the possible power of the first edge symbol after the number of levels is reduced
  • the number of levels is not less than the number of possible levels of the second edge symbol after the number of levels is reduced
  • the first edge symbol, the second edge symbol, and the center symbol are all included in the same symbol sequence, that is, the first edge symbol, the second edge symbol, and the center symbol may all be included in the same first
  • the symbol sequence can also be included in the same sub-symbol sequence.
  • FIG. 7 is a schematic structural diagram of a first symbol sequence, each box is a symbol, wherein a gray box is a center symbol, and a first symbol sequence includes a first symbol 1 , second symbol 2, third symbol 3, fourth symbol 4, fifth symbol 5, sixth symbol 6, seventh symbol 7, eighth symbol 8, and ninth symbol 9,
  • the five symbols 5 are center symbols
  • the first symbol 1, the second symbol 2, the third symbol 3, the seventh symbol 7, the eighth symbol 8, and the ninth symbol 9 are all edge symbols.
  • the number of possible levels of each symbol in the first symbol sequence is eight, and after the number of levels of the edge symbols is reduced, the number of possible levels of the third symbol 3 is not less than the first symbol.
  • the number of possible levels is not less than the number of possible levels of the second symbol 2, and likewise, the number of possible levels of the seventh symbol 7 after the number of levels of the edge symbols is reduced Not less than the number of possible levels of the eighth symbol 8 and not less than the number of possible levels of the ninth symbol 9.
  • one sub-symbol sequence is composed of a first symbol 1, a second symbol 2, a third symbol 3, a fourth symbol 4, and The fifth symbol 5 is constructed, and the other sub-symbol sequence is composed of a fifth symbol 5, a sixth symbol 6, a seventh symbol 7, an eighth symbol 8, and a ninth symbol 9.
  • the number of possible levels of the third symbol 3 in a sub-symbol sequence is not less than the number of possible levels of the first symbol 1, nor less than the second
  • the number of possible levels of the symbol 2 likewise, after the number of levels of the edge symbols is reduced, the number of possible levels of the seventh symbol 7 in the other sub-symbol sequence is not less than the eighth symbol
  • the number of possible levels is not less than the number of possible levels of the ninth symbol.
  • the embodiment of the present invention further provides a device for generating a lookup table.
  • the principle of the problem solved by the device is similar to the method for generating the lookup table. Therefore, the implementation of the device can be implemented by referring to the implementation of the foregoing method. It will not be repeated here.
  • the device for generating a lookup table provided by the embodiment of the present invention, as shown in FIG. 8, includes:
  • a segmentation module 81 configured to divide the first symbol sequence into two sub-symbol sequences; wherein each symbol in the first symbol sequence to the central symbol constitutes a sub-symbol sequence, Each symbol of the center symbol to the last symbol in the first symbol sequence constitutes another sub-symbol sequence; the first symbol sequence is any one of a preset set of N symbol sequences; when N is In the case of an odd number, the center symbol is the (N+1)/2th symbol in the first symbol sequence, and when N is an even number, the center symbol is the N/2th in the first symbol sequence. Symbol or N/2+1th symbol; N is an integer not less than 3;
  • the calculating module 82 is configured to take a statistical average for each sub-symbol sequence, and calculate a nonlinear deviation value according to the statistical average result;
  • the constructing module 83 is configured to store the sub-symbol sequence with the center symbol as the last symbol and the non-linear deviation value thereof to form a first look-up table in the cascaded lookup table; and to use the center symbol as the sub-symbol sequence of the first symbol
  • the non-linear deviation value corresponding storage constitutes a second lookup table in the concatenated lookup table.
  • the apparatus for generating a lookup table provided by the embodiment of the present invention, as shown in FIG. 9a or 9b, further includes a compression module 91;
  • the compression module 91 is configured to reduce the number of levels other than the highest level and the lowest level among the possible levels of the respective edge symbols; the edge symbol is the center symbol except the first symbol sequence or the sub-symbol sequence And symbols other than the symbols adjacent to the center symbol.
  • the embodiment of the present invention further provides a pre-compensation method for generating a lookup table according to an embodiment of the present invention. As shown in FIG. 10, the method includes:
  • the non-linear deviation value of the sub-symbol sequence formed by finding the first symbol in the N-symbol sequence from the first look-up table to the central symbol has a nonlinear deviation value of 0.1.
  • M n*N, n is log 2 k
  • N is the number of symbols in the sequence of N symbols
  • k is the number of possible levels of the center symbol of the sequence of N symbols
  • the sequence-converted bit word serves as an index value to access the corresponding register of the first look-up table, reads out the nonlinear deviation value stored in the register, and uses the bit of the M-bit word converted by the sub-symbol sequence whose center symbol is the first symbol.
  • the word is used as an index value to access a corresponding register of the second lookup table, read out the nonlinear deviation value stored in the register, and sum the M-bit word and the read two nonlinear deviation values to obtain a predistorted symbol sequence. .
  • FIG. 10 A block diagram of an implementation structure of the compensation method provided by the embodiment of the present invention is shown in FIG. 10, wherein the center symbol is the last symbol in one sub-symbol sequence, and the center symbol is the first symbol in another sub-symbol sequence, N
  • the symbol sequence is summed with the found nonlinear deviation values in the first lookup table, and then summed with the found nonlinear deviation values in the second lookup table to obtain a predistorted symbol sequence.
  • the embodiment of the present invention further provides a pre-compensation device. Since the principle of solving the problem is similar to the foregoing pre-compensation method, the implementation of the device can refer to the implementation of the foregoing method, and the repetition is no longer Narration.
  • a pre-compensation device for generating a lookup table according to an embodiment of the present invention is provided in the embodiment of the present invention. As shown in FIG. 12, the device includes:
  • the searching module 121 is configured to search for a nonlinear deviation of the sub-symbol sequence formed by the first symbol in the N symbol sequence to each symbol of the central symbol from the first lookup table for an N symbol sequence converted by the electrical input signal. a value, and a non-linear deviation value of the sub-symbol sequence formed by searching for a symbol sequence of the center symbol of the N symbol sequence to each symbol of the last symbol from the second lookup table;
  • a summation module 122 summing the N symbol sequence, the nonlinear deviation value found from the first lookup table, and the nonlinear deviation value found from the second lookup table to obtain the N symbol sequence The predistorted symbol sequence of the column.
  • the LUT generated by the LUT generating method provided by the embodiment of the present invention is smaller than the resource of the LUT generated by the prior art, so that the length of the symbol sequence can be longer to implement.
  • the better compensation effect, that is to say, the pre-compensation method provided by the embodiment of the present invention is better under the same conditions of hardware resources.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Nonlinear Science (AREA)
  • Electromagnetism (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Amplifiers (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明实施例提供了一种查找表的生成方法和装置、预补偿方法和装置，用以解决目前的LUT随着符号序列的长度的增长，LUT的资源会呈现指数倍的增长的问题。该方法包括：将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。

Description

一种查找表的生成方法和装置、预补偿方法和装置 技术领域
本发明涉及通信技术领域，特别涉及一种查找表的生成方法和装置、预补偿方法和装置。
背景技术
在光通信系统当中，实际的驱动放大器和调制器都存在非线性效应，光纤中也存在诸如自相位调制等非线性效应，所以光通信系统接收到的信号会存在基于符号序列的相位和幅度上的非线性劣化。
在数字信号处理(DSP，Digital Signal Processing)中用基于符号序列的查找表(LUT，Lookup Table)来预补偿系统非线性效应的方法，已被证明是减少系统非线性效应的有效方法。目前广泛采用的非线性预补偿方案是：在电-光转换和经由通信系统的光链路传输之前，通过在电域中处理输入通信信号，补偿非线性引入的信号失真。例如使用补偿算子数字处理电输入信号，以生成预失真电信号，并使用相应的预失真电信号来调制光源，以生成用于经由光通信系统传输的预失真光信号。
在数字处理点输入信号的步骤中需要使用LUT，其中，LUT表可以采用如下方法生成：计算预定N符号序列(N符号序列是指长度为N的符号序列)之中的每一个符号序列相对应的预失真电信号的数值；将每个计算的数值以及得打该计算数值的序号序列对应存储，生成LUT。在数字处理电输入信号的过程中，需要把电输入信号转换成一系列K比特字，将每个K比特字用做索引值来访问查找表的相应寄存器。
以16正交振幅调制(QAM，Quadrate Amplitude Modulation)调制模式为例，在电输入信号为两电平信号时，若符号序列的长度N，则LUT的资源等于2n，在电输入信号为四电平信号时，若符号序列的长度N，则LUT的资源等于4n，如果要取得比较好的补偿效果，通常N需要取比较大的值，这样， LUT的资源会呈现指数倍的增长；另外，随着信号的调制模式的增加，电输入信号的电平数也随之增加，这也会让LUT资源急剧增加。
综上所述，由于目前的LUT是存储N符号序列的非线性偏差值，因此，随着N的增大，LUT的资源会呈现指数倍的增长。
发明内容
本发明实施例提供了一种查找表的生成方法和装置、预补偿方法和装置，用以解决目前的LUT是存储N符号序列的非线性偏差值，随着N的增大，LUT的资源会呈现指数倍的增长的问题。
第一方面，提供一种查找表生成方法，包括：
将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；
将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
结合第一方面，在第一种可能的实现方式中，当N大于3时，所述方法还包括：
将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列或子符号序列中除中心符号以及 与所述中心符号相邻的符号以外的符号。
结合第一方面的第一种可能的实现方式，在第二种可能的实现方式中，当第一边缘符号与中心符号之间间隔的符号的数量小于第二边缘符号与中心符号之间间隔的符号的数量时，电平数量减少后的第一边缘符号的可能的电平的数量不小于电平数量减少后的第二边缘符号的可能的电平的数量；
其中，第一边缘符号、第二边缘符号和中心符号均包含于同一个符号序列中。
第二方面，提供一种查找表生成装置，包括：
分割模块，用于将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
计算模块，用于对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
构建模块，用于将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；并将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
结合第二方面，在第一种可能的实现方式中，当N大于3时，所述装置还包括压缩模块；
所述压缩模块用于，将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列或子符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
结合第二方面的第一种可能的实现方式，在第二种可能的实现方式中， 当第一边缘符号与中心符号之间间隔的符号的数量小于第二边缘符号与中心符号之间间隔的符号的数量时，电平数量减少后的第一边缘符号的可能的电平的数量不小于电平数量减少后的第二边缘符号的可能的电平的数量；
其中，第一边缘符号、第二边缘符号和中心符号均包含于同一个符号序列中。
第三方面，提供一种基于本发明实施例提供的查找表的生成方法的预补偿方法，该方法包括：
针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序列的预失真的符号序列。
第四方面，提供一种基于本发明实施例提供的查找表的生成方法的预补偿装置，该装置包括：
查找模块，用于针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
求和模块，将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序列的预失真的符号序列。
本发明实施例的有益效果包括：
本发明实施例提供的一种查找表的生成方法和装置、预补偿方法和装置，在生成查找表时，会将每个N符号序列分为两个子符号序列，并计算每个子符号序列的线性偏差值，以及将中心符号为最后一个符号的子符号序列与其非 线性偏差值对应存储构成级联查找表中的第一查找表，并将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表，也就是说，将现有技术中的一个LUT分为级联LUT中的第一LUT和第二LUT，而第一LUT的资源与第二LUT的资源之和远少于现有技术中的一个LUT的资源，因此，在符号序列的长度相等的情况下，本发明实施例提供的LUT的生成方法生成的LUT的资源少于现有技术生成的LUT的资源，这样可以在相同硬件资源的条件下，将符号序列的长度取的更长，实现更好的补偿效果。
附图说明
图1为本发明实施例提供的查找表的生成方法的流程图之一；
图2为一个N符号序列分为两个子符号序列时的示意图之一；
图3为本发明实施例提供的查找表的生成方法的流程图之二；
图4为一个N符号序列中的边缘符号的可能的电平的数量减少后的各个符号的可能的电平的示意图；
图5为本发明实施例提供的查找表的生成方法的流程图之三；
图6为一个N符号序列非为两个子符号序列后其中的边缘符号的可能的电平的数量减少后的各个符号的可能的电平的示意图；
图7为一个N符号序列分为两个子符号序列时的示意图之二；
图8为本发明实施例提供的查找表的生成装置的结构示意图之一；
图9a为本发明实施例提供的查找表的生成装置的结构示意图之二；
图9b为本发明实施例提供的查找表的生成装置的结构示意图之三；
图10为本发明实施例提供的预补偿方法的流程图；
图11为本发明实施例提供的预补偿方法的实现框图；
图12为本发明实施例提供的预补偿装置的结构示意图。
具体实施方式
本发明实施例提供的查找表的生成方法和装置、预补偿方法和装置，由于将N符号序列分为两个子符号序列从而生成级联的两个LUT，这样在符号序列的长度相等的情况下，本发明实施例提供的LUT的生成方法生成的LUT的资源少于现有技术生成的LUT的资源，因此，可以在相同硬件资源的条件下，将符号序列的长度取的更长，从而实现更好的补偿效果。
下面结合说明书附图，对本发明实施例提供的一种查找表的生成方法和装置、预补偿方法和装置的具体实施方式进行说明。
本发明实施例提供的查找表的生成方法，如图1所示，包括：
S101、将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
S102、对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
S103、将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；
S104、将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
其中，S103和S104之间并无时间上的先后顺序，可以先执行S103，再执行S104，也可以先执行S104，再执行S103，也可以S103和S104同时执行。
以N＝5为例，图2为第一符号序列的结构示意图，每一个方框为一个符号，其中，灰色的方框为中心符号，第一符号序列包括第一个符号1、第二个符号2、第三个符号3、第四个符号4和第五个符号5，第三个符号3为中心 符号。S101是将第一符号序列以中心符号为界分为两个子符号序列，其中，一个子符号序列由第一符号序列中的第一个符号1、第二个符号2和第三个符号3构成，另一个子符号序列由第一符号序列中的第三个符号3、第四个符号4和第五个符号5构成。
假设第一符号序列中的每个符号可能的电平的数量为k，那么按照现有技术生成LUT时，LUT的资源为kN；当N为奇数时，按照本发明实施例提供的LUT的生成方法生成的LUT的资源为2*k(N+1)/2；当N为偶数时，按照本发明实施例提供的LUT的生成方法生成的LUT的资源为5*kN/2，因此，可以在相同硬件资源的条件下，将符号序列的长度取的更长，从而实现更好的补偿效果。
在一个符号序列中，当边缘符号离中心符号越远，那么这个边缘符号对中心符号的影响就越小，因此，这个边缘符号的可能的电平的数量减少后对中心符号的影响就越小，这样，可以进一步减小LUT的资源。
因此，可选地，当N大于3时，本发明实施例提供的LUT的生成方法如图3所示，还包括：
S301、将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
此时，S301在S101之前执行，也就是说，在将第一符号序列分为两个子符号序列之前，将第一符号序列中的各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少。
以N＝5，16QAM调制模式为例，图4为第一符号序列的结构示意图，每一个方框为一个符号，其中，灰色的方框为中心符号，第一符号序列包括第一个符号1、第二个符号2、第三个符号3、第四个符号4和第五个符号5，第三个符号3为中心符号。第一符号序列中的各个符号的可能的电平分别为-3、-1、1和3，由于第一符号序列中的第一个符号1离中心符号较远，因此，可以将第一个符号1的可能的电平的数量减少，即将第一个符号1的可能的 取值的数量减少，这样，第一个符号1的可能的电平可以为-3、1、3，也可以为-3、-1、3。同样的，第一符号序列中的第五个符号5的可能的电平的数量减少后，第五个符号5的可能的电平可以为-3、1、3，也可以为-3、-1、3。
或者，当N大于3时，本发明实施例提供的LUT的生成方法如图5所示，还包括：
S501、将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述子符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
此时，S501在S101之后执行，也就是说，在将子符号序列分为两个子序列符号之后，将子符号序列中的各个边缘符号科恩那个的电平中除最高电平和最低电平以外的电平的数量减少。
以N＝5，16QAM调制模式为例，图6为第一符号序列分成的两个子符号序列的结构示意图，每一个方框为一个符号，其中，灰色的方框为中心符号，一个子符号序列包括第一个符号1、第二个符号2、第三个符号3，另一个子符号序列包括第三个符号3、第四个符号4和第五个符号5，第三个符号3为中心符号。每个子符号序列中的各个符号的可能的电平分别为-3、-1、1和3，由于一个子符号序列中的第一个符号1离中心符号较远，因此，可以将第一个符号1的可能的电平的数量减少，即将第一个符号1的可能的取值的数量减少，这样，第一个符号1的可能的电平可以为-3、1、3，也可以为-3、-1、3。同样的，另一个子符号序列中的第五个符号5的可能的电平的数量减少后，第五个符号5的可能的电平可以为-3、1、3，也可以为-3、-1、3。
可选地，当第一边缘符号与中心符号之间间隔的符号的数量小于第二边缘符号与中心符号之间间隔的符号的数量时，电平数量减少后的第一边缘符号的可能的电平的数量不小于电平数量减少后的第二边缘符号的可能的电平的数量；
其中，第一边缘符号、第二边缘符号和中心符号均包含于同一个符号序列中，即第一边缘符号、第二边缘符号和中心符号可以均包含于同一个第一 符号序列，也可以均包含于同一个子符号序列。
以N＝9，64QAM调制模式为例，图7为第一符号序列的结构示意图，每一个方框为一个符号，其中，灰色的方框为中心符号，第一符号序列包括第一个符号1、第二个符号2、第三个符号3、第四个符号4、第五个符号5、第六个符号6、第七个符号7、第八个符号8和第九个符号9，第五个符号5为中心符号，第一个符号1、第二个符号2、第三个符号3、第七个符号7、第八个符号8和第九个符号9均为边缘符号。第一符号序列中的各个符号的可能的电平数量均为8个，那么在边缘符号的电平的数量减少后，第三个符号3的可能的电平的数量不少于第一个符号1可能的电平的数量，也不少于第二个符号2可能的电平的数量，同样的，在边缘符号的电平的数量减少后，第七个符号7的可能的电平的数量不少于第八个符号8可能的电平的数量，也不少于第九个符号9可能的电平的数量。
同样地，在将图7中的第一符号序列分为两个子符号序列时，一个子符号序列由第一个符号1、第二个符号2、第三个符号3、第四个符号4和第五个符号5构成，另一个子符号序列由第五个符号5、第六个符号6、第七个符号7、第八个符号8和第九个符号9构成。在边缘符号的电平的数量减少后，一个子符号序列中的第三个符号3的可能的电平的数量不少于第一个符号1可能的电平的数量，也不少于第二个符号2可能的电平的数量，同样的，在边缘符号的电平的数量减少后，另一个子符号序列中的第七个符号7的可能的电平的数量不少于第八个符号8可能的电平的数量，也不少于第九个符号9可能的电平的数量。
基于同一发明构思，本发明实施例还提供了一种查找表的生成装置，由于该装置所解决问题的原理与前述查找表的生成方法相似，因此该装置的实施可以参见前述方法的实施，重复之处不再赘述。
本发明实施例提供的查找表的生成装置，如图8所示，包括：
分割模块81，用于将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所 述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
计算模块82，用于对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
构建模块83，用于将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；并将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
可选地，当N大于3时，本发明实施例提供的查找表的生成装置，如图9a或图9b所示，还包括压缩模块91；
压缩模块91用于，将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列或子符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
本发明实施例还提供一种基于本发明实施例提供的查找表的生成方法的预补偿方法，如图10所示，该方法包括：
S1001、针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
S1002、将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序列的预失真的符号序列。
假设一个N符号序列为3，从第一查找表中查找到该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值为0.1，从 第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值为0.2，那么，该N符号序列的预失真的符号序列为3+0.1+0.2＝3.3。
在实际使用过程中，对电输入符号的转化的一系列的N符号序列进行补偿时，需要将每个N符号序列转化为M比特字，其中，M＝n*N，n为log2k上取整后的值，N为N符号序列中的符号的个数，k为N符号序列的中心符号的可能的电平的数量，然后用M比特字中由中心符号为最后一个符号的子符号序列转换的比特字作为索引值来访问第一查找表的相应寄存器，读出该寄存器中存储的非线性偏差值，并用M比特字中由中心符号为第一个符号的子符号序列转换的比特字作为索引值来访问第二查找表的相应寄存器，读出该寄存器中存储的非线性偏差值，以及将M比特字与读出的两个非线性偏差值求和，得到预失真的符号序列。
本发明实施例提供的与补偿方法的实现结构框图如图10所示，其中，中心符号在一个子符号序列中为最后一个符号，中心符号在另一个子符号序列中为第一个符号，N符号序列与第一查找表中查找到非线性偏差值求和，再与第二查找表中的查找到的非线性偏差值求和，得到预失真的符号序列。
基于同一发明构思，本发明实施例还提供了一种预补偿装置，由于该装置所解决问题的原理与前述预补偿方法相似，因此该装置的实施可以参见前述方法的实施，重复之处不再赘述。
本发明实施例提供的基于本发明实施例提供的查找表的生成方法的预补偿装置，如图12所示，该装置包括：
查找模块121，用于针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
求和模块122，将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序 列的预失真的符号序列。
由于在符号序列的长度相等的情况下，本发明实施例提供的LUT生成方法生成的LUT的资源小于现有技术生成的LUT的资源，因此，可以将符号序列的长度取的更长，以实现更好的补偿效果，也就是说，在硬件资源相同的条件下，本发明实施例提供的预补偿方法的效果更好。
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然，本领域的技术人员可以对本发明实施例进行各种改动和变型而不脱离本发明实施例的精神和范围。这样，倘若本发明实施例的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包含这些改动和变型在内。

Claims (8)

  1. 一种查找表的生成方法，其特征在于，包括：
    将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
    对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
    将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；
    将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
  2. 如权利要求1所述的方法，其特征在于，当N大于3时，所述方法还包括：
    将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列或子符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
  3. 如权利要求2所述的方法，其特征在于，当第一边缘符号与中心符号之间间隔的符号的数量小于第二边缘符号与中心符号之间间隔的符号的数量时，电平数量减少后的第一边缘符号的可能的电平的数量不小于电平数量减少后的第二边缘符号的可能的电平的数量；
    其中，第一边缘符号、第二边缘符号和中心符号均包含于同一个符号序列中。
  4. 一种查找表的生成装置，其特征在于，包括：
    分割模块，用于将第一符号序列分为两个子符号序列；其中，所述第一符号序列中的第一个符号到中心符号的各个符号构成一个子符号序列，所述中心符号到所述第一符号序列中的最后一个符号的各个符号构成另一个子符号序列；所述第一符号序列为预设的一组N符号序列中的任一符号序列；当N为奇数时，所述中心符号为所述第一符号序列中的第(N+1)/2个符号，当N为偶数时，所述中心符号为所述第一符号序列中的第N/2个符号或第N/2+1个符号；N为不小于3的整数；
    计算模块，用于对每个子符号序列取统计平均，并根据统计平均的结果计算其非线性偏差值；
    构建模块，用于将中心符号为最后一个符号的子符号序列与其非线性偏差值对应存储构成级联查找表中的第一查找表；并将中心符号为第一个符号的子符号序列与其非线性偏差值对应存储构成所述级联查找表中的第二查找表。
  5. 如权利要求4所述的装置，其特征在于，当N大于3时，所述装置还包括压缩模块；
    所述压缩模块用于，将各个边缘符号的可能的电平中除最高电平和最低电平以外的电平的数量减少；所述边缘符号为所述第一符号序列或子符号序列中除中心符号以及与所述中心符号相邻的符号以外的符号。
  6. 如权利要求5所述的装置，其特征在于，当第一边缘符号与中心符号之间间隔的符号的数量小于第二边缘符号与中心符号之间间隔的符号的数量时，电平数量减少后的第一边缘符号的可能的电平的数量不小于电平数量减少后的第二边缘符号的可能的电平的数量；
    其中，第一边缘符号、第二边缘符号和中心符号均包含于同一个符号序列中。
  7. 一种基于权利要求1～3任一查找表的生成方法的预补偿方法，其特征在于，该方法包括：
    针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
    将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序列的预失真的符号序列。
  8. 一种基于权利要求1～3任一查找表的生成方法的预补偿装置，其特征在于，该装置采用如权利要求1～3任一查找表的生成方法生成的第一查找表和第二查找表对由电输入信号分成的一系列N符号序列进行补偿，该装置包括：
    查找模块，用于针对一个由电输入信号转化的N符号序列，从第一查找表中查找该N符号序列中的第一个符号到中心符号的各个符号构成的子符号序列的非线性偏差值，并从第二查找表中查找该N符号序列中的中心符号到最后一个符号的各个符号构成的子符号序列的非线性偏差值；
    求和模块，将该N符号序列、从所述第一查找表中查找到的非线性偏差值和从所述第二查找表中查找到的非线性偏差值求和，得到该N符号序列的预失真的符号序列。
PCT/CN2015/075687 2015-04-01 2015-04-01 一种查找表的生成方法和装置、预补偿方法和装置 Ceased WO2016154964A1 (zh)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP15886934.7A EP3249819B1 (en) 2015-04-01 2015-04-01 Lookup table generation method and device, and pre-compensation method and device
JP2017550207A JP6455765B2 (ja) 2015-04-01 2015-04-01 ルックアップテーブル生成方法およびルックアップテーブル生成装置、ならびに事前補償方法および事前補償装置
CN201580023454.3A CN106464274B (zh) 2015-04-01 2015-04-01 一种查找表的生成方法和装置、预补偿方法和装置
MX2017011782A MX367848B (es) 2015-04-01 2015-04-01 Aparato y método de generación de tabla de búsqueda, y aparato y método de pre-compensación.
PCT/CN2015/075687 WO2016154964A1 (zh) 2015-04-01 2015-04-01 一种查找表的生成方法和装置、预补偿方法和装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2015/075687 WO2016154964A1 (zh) 2015-04-01 2015-04-01 一种查找表的生成方法和装置、预补偿方法和装置

Publications (1)

Publication Number Publication Date
WO2016154964A1 true WO2016154964A1 (zh) 2016-10-06

Family

ID=57006517

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/075687 Ceased WO2016154964A1 (zh) 2015-04-01 2015-04-01 一种查找表的生成方法和装置、预补偿方法和装置

Country Status (5)

Country Link
EP (1) EP3249819B1 (zh)
JP (1) JP6455765B2 (zh)
CN (1) CN106464274B (zh)
MX (1) MX367848B (zh)
WO (1) WO2016154964A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110545079A (zh) * 2018-05-29 2019-12-06 大唐移动通信设备有限公司 一种dpd查找表生成方法及装置

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP7193715B2 (ja) * 2018-11-08 2022-12-21 日本電信電話株式会社 光伝送システム
JP7794053B2 (ja) 2022-03-30 2026-01-06 富士通株式会社 非線形補償回路、及び光送受信機
US12388526B2 (en) 2023-03-10 2025-08-12 Huawei Technologies Co., Ltd. Method and system for compressing and employing pattern dependent look-up table

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070098111A1 (en) * 2005-10-27 2007-05-03 Cypress Semiconductor Corporation Frequency offset and method of offsetting
CN101123594A (zh) * 2006-08-08 2008-02-13 上海贝尔阿尔卡特股份有限公司 用于多入多出基带处理的系统、装置及方法
US20130185345A1 (en) * 2012-01-16 2013-07-18 Designart Networks Ltd Algebraic processor
CN104303422A (zh) * 2012-01-27 2015-01-21 苹果公司 对控制符号进行智能加扰的方法和装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2004032609A (ja) * 2002-06-28 2004-01-29 Nec Corp 非線形歪み補償回路
US7756421B2 (en) * 2002-10-03 2010-07-13 Ciena Corporation Electrical domain compensation of non-linear effects in an optical communications system
US7340005B2 (en) * 2003-06-12 2008-03-04 Lg Electronics Inc. Signal transmission apparatus and method
JP4933940B2 (ja) * 2007-04-02 2012-05-16 株式会社日立国際電気 電力増幅装置
JP4935906B2 (ja) * 2007-07-31 2012-05-23 富士通株式会社 歪補償装置および方法
US8693890B2 (en) * 2010-08-20 2014-04-08 Nec Laboratories America, Inc. Look-up table and digital transmitter based architecture for fiber nonlinearity compensation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070098111A1 (en) * 2005-10-27 2007-05-03 Cypress Semiconductor Corporation Frequency offset and method of offsetting
CN101123594A (zh) * 2006-08-08 2008-02-13 上海贝尔阿尔卡特股份有限公司 用于多入多出基带处理的系统、装置及方法
US20130185345A1 (en) * 2012-01-16 2013-07-18 Designart Networks Ltd Algebraic processor
CN104303422A (zh) * 2012-01-27 2015-01-21 苹果公司 对控制符号进行智能加扰的方法和装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110545079A (zh) * 2018-05-29 2019-12-06 大唐移动通信设备有限公司 一种dpd查找表生成方法及装置

Also Published As

Publication number Publication date
MX367848B (es) 2019-09-09
CN106464274B (zh) 2019-02-19
EP3249819A1 (en) 2017-11-29
CN106464274A (zh) 2017-02-22
EP3249819B1 (en) 2019-06-19
EP3249819A4 (en) 2018-03-14
JP2018509860A (ja) 2018-04-05
JP6455765B2 (ja) 2019-01-23
MX2017011782A (es) 2017-12-04

Similar Documents

Publication Publication Date Title
US10091037B2 (en) DPD system
CN107276546B (zh) 一种数字预失真处理方法及装置
JP6455765B2 (ja) ルックアップテーブル生成方法およびルックアップテーブル生成装置、ならびに事前補償方法および事前補償装置
CN109150213B (zh) 一种数字预失真系统
JPWO2020174574A1 (ja) 分布整形方法および分布整形終端方法、分布整形符号化器および分布整形復号器、並びに、伝送システム
CN116686236A (zh) 用于低复杂度模式相关查找表预补偿的方法和装置
JP5853913B2 (ja) アドレス制御装置、送信装置およびアドレス制御方法
US8478210B2 (en) Apparatus and method of digital predistortion for power amplifiers with dynamic nonlinearities
WO2019120066A1 (zh) 一种适合sm2算法的快速模约减方法和介质
US8311149B2 (en) Method and apparatus for distorting input signal of digital predistortion (DPD) power amplifier in wireless communication system
CN112532549B (zh) 一种信号补偿方法及装置
CN105720999B (zh) 数字调制器非线性校正
JP7268335B2 (ja) 歪補償回路、送信装置および歪補償方法
CN114244292B (zh) 适用多场景的dpd分频段校正方法及应用
JP5673475B2 (ja) 歪補償装置および歪補償方法
US11683093B2 (en) Wavelength dispersion compensation apparatus, optical receiving apparatus, wavelength dispersion compensation method and computer program
CN104300919B (zh) 预失真方法以及预失真装置
US12283996B1 (en) Efficient nonlinear equalizer for transmitter predistortion
JP4127116B2 (ja) 非線形歪み補償送信装置および補償データ更新方法
Zhang et al. OFDM PAPR reduction with digital amplitude predistortion
JP2007208684A (ja) 歪補償機能付き送信装置
CN119520202B (zh) 一种基于遗传算法的数字预失真补偿方法及系统
EP1482637B1 (en) Method of influencing an input signal and predistorter
WO2019234925A1 (ja) 歪み補償回路及び無線送信機
Song et al. A novel FPGA implementation of trellis shaping for PAPR reduction of OFDM signals

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15886934

Country of ref document: EP

Kind code of ref document: A1

REEP Request for entry into the european phase

Ref document number: 2015886934

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: MX/A/2017/011782

Country of ref document: MX

ENP Entry into the national phase

Ref document number: 2017550207

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE