WO2017206188A1 - 一种基于ftn的通信方法、相关装置 - Google Patents

一种基于ftn的通信方法、相关装置 Download PDF

Info

Publication number
WO2017206188A1
WO2017206188A1 PCT/CN2016/084816 CN2016084816W WO2017206188A1 WO 2017206188 A1 WO2017206188 A1 WO 2017206188A1 CN 2016084816 W CN2016084816 W CN 2016084816W WO 2017206188 A1 WO2017206188 A1 WO 2017206188A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
symbol
power value
ftn
ith
Prior art date
Application number
PCT/CN2016/084816
Other languages
English (en)
French (fr)
Inventor
张昌明
蔡梦
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP16903573.0A priority Critical patent/EP3454517B1/en
Priority to CN201680079239.XA priority patent/CN108476195B/zh
Priority to PCT/CN2016/084816 priority patent/WO2017206188A1/zh
Publication of WO2017206188A1 publication Critical patent/WO2017206188A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03828—Arrangements for spectral shaping; Arrangements for providing signals with specified spectral properties
    • H04L25/03834—Arrangements for spectral shaping; Arrangements for providing signals with specified spectral properties using pulse shaping
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40—Transmitting circuits; Receiving circuits
    • H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems
    • H04L25/497—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems by correlative coding, e.g. partial response coding or echo modulation coding transmitters and receivers for partial response systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006—Arrangements for removing intersymbol interference
    • H04L2025/03592—Adaptation methods
    • H04L2025/03598—Algorithms
    • H04L2025/03611—Iterative algorithms

Definitions

  • the present invention relates to the field of wireless communication technologies, and in particular, to a FTN-based communication method and related apparatus.
  • FTN Faster than Nyquist
  • the most critical part of the FTN communication system is the FTN demodulation of the receiving device. Since the FTN compresses the signal bandwidth, there is a problem of introducing Inter-Symbol Interference (ISI) in the signal received by the receiving device.
  • ISI Inter-Symbol Interference
  • the goal of FTN demodulation is to have the receiving device remove the ISI and thereby obtain the data transmitted by the transmitting device from the symbol to be processed.
  • the demodulation result may be hard decision information or soft decision information, and a soft decision result is generally required when there is a compiled code.
  • FTN demodulation can be performed using the Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithm.
  • M the number of states in the BCJR algorithm and the number of branch transitions in each stage increase exponentially.
  • IQ in-phase and quadrature
  • the number of types of each channel is The number of states is M (L-1)/2
  • the number of branch transitions for each stage is M L/2 , where L represents the length of the ISI considered.
  • L 10 as an example
  • Table 1 shows the number of states and the number of branch transitions in different modulation modes (considering the IQ two-way, the number of states and the number of branch transitions in the table are twice the above results).
  • Embodiments of the present invention provide a FTN-based communication method and related apparatus, which can be applied to an equivalent high-order modulation mode communication system, thereby achieving higher spectral efficiency.
  • An embodiment of the present invention provides a FTN-based communication method, including:
  • the receiving device receives the signal sent by the transmitting device in parallel through the K layer and converts it into a symbol to be processed;
  • K is a positive integer greater than 1; from the first layer to the Kth layer, the corresponding power value of each layer sequentially increases;
  • i is greater than or equal to 1 and less than or equal to K, and performs:
  • the receiving device separates the i-th layer to-be-processed symbol from the to-be-processed symbol; the receiving device determines the symbol to be processed as the i-th layer to-be-processed symbol when determining that i is equal to K; and the receiving device obtains the The i+1 layer decision result is to the ith layer FTN reconstructed symbol reconstructed by the layer K decision result to the FTN reconstructed symbol of the layer K, and the receiving device removes the obtained i+1th layer FTN reconstructed symbol from the to-be-processed symbol.
  • the FTN reconstruction symbol to the Kth layer obtains the ith layer to be processed symbol; the receiving device performs FTN demodulation on the ith layer to be processed symbol to obtain the ith layer demodulated symbol; and the receiving device demodulates the symbol according to the ith layer , the judgment is made, and the result of the i-th layer judgment is obtained.
  • Layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency; on the other hand, due to each layer Using low-order modulation, FTN demodulation can be performed at lower complexity for each layer, providing achievability for further spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • the receiving device performs FTN demodulation on the layer 1 to-be-processed symbol to obtain the i-th layer demodulated symbol, including: the receiving device generates a layer 1 state transition grid for the layer 1 a receiving device generates a first layer desired output symbol for each branch transfer according to a state of the first layer transition; wherein: the receiving device calculates a log likelihood of the first layer according to the first layer expected output symbol Than LLR. Since Layer 1 is already undisturbed by other layers, conventional FTN demodulation, i.e., FTN demodulation without interference, can be employed, thus being better compatible with the prior art.
  • the receiving apparatus performs FTN demodulation on the i-th layer to-be-processed symbol to obtain an i-th layer demodulated symbol, including: the receiving apparatus generates an ith layer for the jth layer to the i-th layer a state transition trellis diagram; the receiving device transfers the trellis diagram according to the state of the i-th layer, and performs FTN demodulation on the i-th layer to be processed to obtain an i-th layer demodulated symbol; wherein, the jth layer to the i-th Each of the 1 layers is a preset layer having a degree of interference to the i-th layer greater than the interference threshold; j is greater than or equal to 1 and less than or equal to i-1. In this way, the influence of the jth layer to the i-1th layer is also considered in the generation of the state transition trellis diagram of the i-th layer, so that FTN demodulation can be performed more accurately.
  • the receiving device generates a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, including: the receiving device is for the i-th layer ISI tap, and each of the jth layer to the i-1th layer A state transition trellis diagram generated by significant ISI taps; wherein, the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the i th layer corresponding The energy threshold of the ISI tap.
  • the receiving device performs FTN demodulation on the i-th layer to be processed according to the state of the i-th layer, and obtains the i-th layer demodulated symbol, including: the receiving device transfers the grid map according to the state, Each branch transition generates an i-th layer desired output symbol; wherein, the i-th layer desired output symbol comprises: a sum of symbols obtained by multiplying a symbol of each layer in the jth layer to the i-th layer by a power value factor corresponding to the layer; The receiving device calculates the log likelihood ratio LLR of the i-th layer based on the expected output symbol of the i-th layer. In this way, the influence of the jth layer to the i-1th layer is also considered in generating the i-th layer desired output symbol, so that FTN demodulation can be performed more accurately.
  • the generating rule when the receiving device generates the i-th layer expected output symbol for each branch transfer according to the state transition trellis diagram meets the following formula requirements:
  • P i is the power value corresponding to the i-th layer symbol
  • P i-1 is the power value corresponding to the i-th layer symbol
  • P im is the power value corresponding to the i-th layer symbol
  • P j is the j-th layer symbol corresponding Power value a power value factor corresponding to the i-th layer symbol; a power value factor corresponding to the i-1th layer symbol; a power value factor corresponding to the first im layer symbol; J for the first layer power factor value corresponding to the symbol
  • L is the i-th layer ISI preset tap length; L.
  • L 1 is a preset significant ISI tap length of layer i-1;
  • L is a preset first m The length of the significant ISI tap of the im layer;
  • L ij is the length of the significant ISI tap of the preset j-th layer;
  • m is an integer, m takes every integer in [1, ij];
  • f l is the ISI tap coefficient;
  • n is the data label.
  • the receiving device performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol, and performs a decision according to the ith layer demodulated symbol to obtain an ith layer decision result, including: the receiving device.
  • the ith layer to-be-processed symbol is subjected to FTN demodulation, deinterleaving and decoding by using an iterative structure, and the i-th layer decoding result obtained by multiple iterations is obtained; the receiving device performs the judgment according to the i-th layer decoding result, and obtains the first The result of the i-layer decision.
  • the obtained i-th layer decoding result is more accurate, and the decision can be performed more accurately according to the i-th layer decoding result, thereby obtaining a more accurate i-th layer decision result, and then according to the i-th layer decision result.
  • Reconstructing a more accurate FTN reconstruction symbol of the i-th layer thereby more accurately and completely eliminating the interference of the i-th layer to the K-th layer FTN reconstruction symbol on the i-1th layer to be processed symbol, that is, more accurately eliminated
  • the larger the power value the larger the interference to the current layer.
  • the receiving device repeatedly performs FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations, including: for each iteration in multiple iterations Execution: the receiving device performs FTN demodulation, deinterleaving, and decoding on the ith layer to-be-processed symbol to obtain an ith layer decoding result of the iteration; the i-th layer decoding result of the iteration is used as the next iteration
  • the a priori information of the FTN demodulation in the process in turn performs FTN demodulation, deinterleaving and decoding in the next iteration. Thereby, the demodulation result is more accurate, and the decoding result of the last iteration of each layer is judged to obtain the final sink.
  • An embodiment of the present invention provides a FTN-based communication method, including:
  • the transmitting device encodes, interleaves, and modulates signals of all layers in the K layer separately to obtain K. a symbol for each layer in the layer; where K is a positive integer greater than one;
  • the transmitting device filters all the symbols in the K layer by FTN shaping and filtering according to the power value allocated to each layer in the K layer, and then transmits them in parallel; wherein, from the first layer to the Kth layer, the corresponding power values of each layer are sequentially increased. Big.
  • Layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency; on the other hand, due to each layer Using low-order modulation, FTN demodulation can be performed at lower complexity for each layer, providing achievability for further spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • the power value allocated to each layer in the K layer satisfies the following condition: the system BER is less than the BER threshold, and the sum of the power values of the first layer to the Kth layer is not greater than the total power value threshold.
  • the system BER can be ensured to meet the requirements, and the sum of the power values of all layers does not exceed the total power value threshold, so that the performance of the entire system is optimal.
  • the power value assigned to each layer in the K layer is obtained by assigning a power value to each of the K layers in order from the first layer to the Kth layer. In this way, power values can be assigned to each layer more efficiently and accurately.
  • the power value assigned to each layer in the K layer is obtained by the following method:
  • the power value of the first layer is: a minimum power value that satisfies the system BER less than the BER threshold;
  • Step A setting the power value of the i-th layer to the power value of the i-th layer; and proceeding to step B;
  • Step B the power value of the i-th layer is increased by a preset step time to obtain the power value of the updated i-th layer; and the process proceeds to step C;
  • Step C after determining that the power value of the first layer to the power value of the i-1th layer, and the sum of the power values of the i-th layer after the update is not greater than the total power value threshold, proceeds to step D;
  • Step D when it is determined that the system BER is less than the BER threshold, go to step E, otherwise, go to step Step B;
  • Step E the updated power value of the i-th layer is determined as the power value of the i-th layer
  • step F when it is determined that i is smaller than K 0 , i is incremented by 1, and the process proceeds to step A.
  • the method further includes: in step C, when determining that the power value of the layer 1 to the power value of the i-1th layer and the sum of the power values of the i-th layer after the update are greater than the total power value threshold, The value is set to i-1.
  • the method further includes: in step F, setting the value of K to K 0 when determining that i is not less than K 0 .
  • An embodiment of the present invention provides a receiving apparatus, including:
  • a receiving unit configured to receive a signal that the transmitting device sends in parallel through the K layer
  • K is a positive integer greater than 1; and from a layer 1 to a layer K, a corresponding power value of each layer is sequentially increased;
  • a processing unit configured to target the i-th layer in the K layer, i is greater than or equal to 1 and less than or equal to K, and performs:
  • a decision is made to obtain an i-th layer decision result.
  • the processing unit is configured to: when i is equal to 1, generate a state transition mesh map of the first layer for the first layer; and transfer the mesh map according to the state of the first layer, and generate the first for each branch transfer The layer expects an output symbol; wherein: the log likelihood ratio LLR of the first layer is calculated according to the expected output symbol of the first layer.
  • the processing unit is configured to: when i is not equal to 1, generate a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, and transfer the trellis diagram according to the state of the i-th layer, to the i-th
  • the layer to be processed is subjected to FTN demodulation to obtain an i-th layer demodulated symbol; wherein each of the jth layer to the i-1th layer is The layer that is preset and interferes with the i-th layer is greater than the interference threshold; j is greater than or equal to 1 and less than or equal to i-1.
  • the processing unit is configured to: for the i-th layer ISI tap, and the j-th layer to the i-th layer, when generating the state transition trellis diagram of the i-th layer for the jth layer to the i-th layer A state transition trellis diagram generated by a significant ISI tap of the layer; wherein the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the i The ISI tap of the energy threshold corresponding to the layer.
  • the processing unit performs FTN demodulation on the i-th layer to be processed symbol according to the state of the i-th layer to obtain the i-th layer demodulated symbol, and is used to: transfer the grid map according to the state Generating, for each branch transfer, an i-th layer desired output symbol; wherein, the i-th layer desired output symbol comprises: a symbol obtained by multiplying a symbol of each layer in the jth layer to the i-th layer by a power value factor corresponding to the layer And; based on the expected output symbol of the i-th layer, the log likelihood ratio LLR of the i-th layer is calculated.
  • the generating rule when the processing unit generates the ith layer expected output symbol for each branch according to the state transition grid map meets the formula requirements in the method item, and details are not described herein again.
  • the processing unit performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol, and performs a decision according to the ith layer demodulated symbol to obtain an ith layer decision result.
  • FTN demodulation, deinterleaving and decoding are performed on the ith layer to be processed symbol by using an iterative structure, and the ith layer decoding result obtained after multiple iterations is obtained; and the ith layer decoding result is used to determine the result The result of the i-layer decision.
  • the processing unit performs FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations, and is used for: Each iteration, execute:
  • the i-th layer decoding result of the iteration is used as FTN demodulation in the next iteration process
  • the a priori information in turn performs FTN demodulation, deinterleaving, and decoding in the next iteration.
  • Layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency; on the other hand, due to each layer Use low-order modulation for FTN at lower complexity for each layer Demodulation provides achievability for further spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • An embodiment of the present invention provides a sending apparatus, including:
  • a processing unit configured to separately encode, interleave, and modulate signals of all layers in the K layer to obtain symbols of each layer in the K layer; wherein, K is a positive integer greater than 1; and the power allocated according to each layer in the K layer Value, all symbols in the K layer are filtered by FTN shaping filtering;
  • a sending unit configured to send all the symbols in the filtered K layer in parallel; wherein, from the first layer to the Kth layer, corresponding power values of each layer are sequentially increased.
  • the method for the power value allocated by each layer in the K layer and the method for the power value allocated to each layer in the K layer can be referred to the description in the foregoing method embodiment, and details are not described herein again.
  • An embodiment of the present invention provides a receiving apparatus, including:
  • a receiver configured to receive a signal sent by the transmitting device in parallel through the K layer
  • a memory for storing programs and instructions
  • the processor is configured to execute by calling a program and an instruction stored in the memory:
  • K is a positive integer greater than 1; from the first layer to the Kth layer, the corresponding power value of each layer is sequentially increased;
  • i is greater than or equal to 1 and less than or equal to K, and performs:
  • the processor is configured to: when i is equal to 1, generate a state transition trellis diagram of the first layer for the first layer; and transfer the trellis diagram according to the state of the first layer, and generate the first for each branch transfer The layer expects an output symbol; wherein: the log likelihood ratio of the first layer is calculated according to the expected output symbol of the first layer LLR.
  • the processor is configured to: when i is not equal to 1, generate a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, and transfer the trellis diagram according to the state of the i-th layer, to the i-th
  • the layer to be processed is subjected to FTN demodulation to obtain an i-th layer demodulated symbol; wherein each of the jth layer to the i-1th layer is preset, and the interference degree to the i-th layer is greater than the interference threshold.
  • Layer; j is greater than or equal to 1 and less than or equal to i-1.
  • the processor when generating the state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, is used for: for the i-th layer ISI tap, and for each of the jth layer to the i-1th layer A state transition trellis diagram generated by a significant ISI tap of the layer; wherein the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the i The ISI tap of the energy threshold corresponding to the layer.
  • the processor shifts the trellis diagram according to the state of the i-th layer, and performs FTN demodulation on the i-th layer to be processed to obtain the i-th layer demodulated symbol, and is used to: transfer the trellis according to the state.
  • the generating rule when the processor generates the ith layer expected output symbol for each branch according to the state transition trellis diagram is referred to the formula requirement in the method item, and details are not described herein again.
  • the processor performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol, and performs a decision according to the ith layer demodulated symbol to obtain an ith layer decision result.
  • FTN demodulation, deinterleaving and decoding are performed on the ith layer to be processed symbol by using an iterative structure, and the ith layer decoding result obtained after multiple iterations is obtained; and the ith layer decoding result is used to determine the result The result of the i-layer decision.
  • performing FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations for:
  • the i-th layer decoding result of the iteration is used as FTN demodulation in the next iteration process
  • the a priori information in turn performs FTN demodulation, deinterleaving, and decoding in the next iteration.
  • the layered technology is used for parallel transmission through multiple layers of low-order modulation, and the spectrum efficiency achieved by using high-order modulation is achieved, so communication based on layered technology is provided.
  • High spectral efficiency on the other hand, since each layer uses low-order modulation, FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • An embodiment of the present invention provides a sending apparatus, including:
  • a memory for storing programs and instructions
  • the processor is configured to execute by calling a program and an instruction stored in the memory:
  • the signals of all layers in the K layer are separately encoded, interleaved and modulated to obtain symbols of each layer in the K layer; wherein K is a positive integer greater than 1; according to the power value assigned to each layer in the K layer, the K layer is All symbols in the filter are filtered by FTN shaping filtering;
  • the transmitter is configured to send all the symbols in the filtered K layer in parallel; wherein, from the first layer to the Kth layer, the power values corresponding to each layer are sequentially increased.
  • the method for the power value allocated by each layer in the K layer and the method for the power value allocated to each layer in the K layer can be referred to the description in the foregoing method embodiment, and details are not described herein again.
  • the receiving device receives the signal sent by the transmitting device in parallel through the K layer and converts it into a symbol to be processed; K is a positive integer greater than 1; from the first layer to the Kth layer, each layer corresponds to The power value is sequentially increased; for the i-th layer in the K layer, i is greater than or equal to 1 and less than or equal to K, and the receiving device separates the ith layer to-be-processed symbol from the to-be-processed symbol; the receiving device pairs the ith layer The processing symbol is subjected to FTN demodulation to obtain an i-th layer demodulated symbol; the receiving device performs a decision according to the i-th layer demodulated symbol, and obtains an i-th layer decision result.
  • Layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency; on the other hand, due to each layer Using low-order modulation, FTN demodulation can be performed at lower complexity for each layer, providing achievability for further spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • FIG. 1a is a schematic structural diagram of a system according to an embodiment of the present invention.
  • FIG. 2 is a schematic flowchart of a FTN-based communication method performed by a transmitting device according to an embodiment of the present disclosure
  • FIG. 2b is a schematic flowchart of a FTN-based communication method performed by a receiving device side according to an embodiment of the present invention
  • 2c is a schematic flowchart of another FTN-based communication method performed by a receiving device side according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of a FTN-based communication method performed by a transmitting device and a receiving device according to an embodiment of the present invention
  • 2 e is a schematic flowchart of a method for allocating power values for each layer when i is greater than 1 according to an embodiment of the present disclosure
  • 2f is a schematic structural diagram of a state transition grid diagram according to an embodiment of the present invention.
  • 2g is a schematic diagram showing a comparison between a distribution map of interference and noise of the first layer to the i-1th layer and a Gaussian distribution map when i is not equal to 1 according to an embodiment of the present invention
  • FIG. 2h is a schematic diagram of a method for removing significant ISI taps from each of the jth layer to the i-1th layer from the first layer to the i-1th layer of interference plus noise when i is not equal to 1 according to an embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of another state transition grid diagram according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of ISI comparison before and after conversion of a minimum phase system according to an embodiment of the present invention
  • 2k is a schematic diagram of BER performance results of a Matlab platform simulation according to an embodiment of the present invention.
  • FIG. 3 is a schematic structural diagram of an FTN-based receiving apparatus according to an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of an FTN-based transmitting apparatus according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of an FTN-based receiving apparatus according to an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of an apparatus for transmitting an FTN according to an embodiment of the present invention.
  • FIG. 1a exemplarily shows a schematic structural diagram of a system applicable to an embodiment of the present invention.
  • the system architecture includes a transmitting device 101 and a receiving device 102.
  • the transmitting device 101 can be a network device or a terminal device in a communication system
  • the receiving device 102 can be a network device or a terminal device in a communication system.
  • the terminal device can communicate with one or more core networks via a radio access network (RAN), and the terminal device can refer to a user equipment (User Equipment, referred to as “UE”), an access terminal, a subscriber unit, and a user.
  • RAN radio access network
  • UE user equipment
  • Station mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.
  • the access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol ("SSIP") phone, a Wireless Local Loop (WLL) station, and a personal digital processing (Personal Digital) Assistant, referred to as "PDA” for short, handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in future 5G networks, and the like.
  • SSIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Processing
  • the network device may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, abbreviated as "BTS”) in the GSM system or CDMA, or may be a base station (NodeB in the WCDMA system, referred to as "NB") may also be an evolved base station (Evolutional Node B, "eNB” or "eNodeB”) in the LTE system, or the network device may be a relay station, an access point, an in-vehicle device, a wearable device, and A network side device in a future 5G network or a network device in a future evolved PLMN network.
  • BTS Base Transceiver Station
  • NodeB base station
  • eNodeB evolved base station
  • LTE Long Term Evolutional Node B
  • GSM Global System of Mobile Communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD frequency division duplex
  • TDD LTE time division duplex
  • UMTS Universal Mobile Telecommunication System
  • WiMAX Worldwide Interoperability for Microwave Access
  • FIG. 2 is a schematic flowchart diagram of an FTN-based communication method performed by a transmitting device side according to an embodiment of the present invention. Based on the above discussion, an embodiment of the present invention provides an FTN-based communication method performed by a transmitting device side, as shown in FIG. 2a, the method includes:
  • Step 2101 The transmitting device separately encodes, interleaves, and modulates signals of all layers in the K layer to obtain symbols of each layer in the K layer, where K is a positive integer greater than 1.
  • Step 2102 The transmitting device filters all the symbols in the K layer by FTN shaping and filtering according to the power value allocated to each layer in the K layer, and then transmits the signals in parallel; wherein, from the first layer to the Kth layer, the corresponding power of each layer The values increase in turn.
  • FIG. 2b is a schematic flow chart showing an FTN-based communication method performed by a receiving device side according to an embodiment of the present invention. Based on the above discussion, an embodiment of the present invention provides an FTN-based communication method performed by a receiving device side, as shown in FIG. 2b, the method includes:
  • Step 2201 The receiving device receives the signal sent by the transmitting device in parallel through the K layer, and converts it into a symbol to be processed; K is a positive integer greater than 1; and from the first layer to the Kth layer, the power value corresponding to each layer is sequentially increased. Big;
  • i is greater than or equal to 1 and less than or equal to K, and the following steps 2202 to 2204 are performed:
  • Step 2202 The receiving device separates the i-th layer to-be-processed symbol from the to-be-processed symbol; when the determining device determines that i is equal to K, the receiving device uses the to-be-processed symbol as the i-th layer to be processed symbol; when the receiving device determines that i is not equal to K, Acquiring the ith ninth FTN reconstructed symbol reconstructed from the i+1th layer decision result to the Kth layer decision result to the FTN reconstructed symbol of the Kth layer, and the receiving device removes the obtained i+1th layer from the to-be-processed symbol FTN reconstructs the symbol to the FTN reconstruction symbol of the Kth layer to obtain an ith layer to be processed symbol;
  • Step 2203 The receiving device performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol;
  • Step 2204 The receiving device performs a decision according to the demodulated symbol of the i-th layer, and obtains an i-th layer decision result.
  • the signal received by the receiving device is obtained by: the transmitting device separately encodes, interleaves, and modulates signals of all layers in the K layer to obtain symbols of each layer in the K layer; The transmitting device obtains all the symbols in the K layer by FTN shaping filtering according to the power value assigned to each layer in the K layer.
  • the signal sent by the transmitting device may be affected by noise, and then received by the receiving device, and the receiving device receives the signal.
  • the noise-affected signal is subjected to matched filtering and minimum phase system conversion in turn, the to-be-processed symbol is obtained, and then the receiving device sequentially separates the i-th layer to-be-processed symbol from the to-be-processed symbol.
  • FIG. 2 is a schematic diagram showing another flow of an optional FTN-based communication method performed by the receiving device side according to an embodiment of the present invention. As shown in FIG. 2c, an embodiment of the present invention provides an optional receiving device.
  • the FTN-based communication methods performed on the side include:
  • Step 2301 the method begins
  • Step 2302 the receiving device receives the signal sent by the transmitting device in parallel through the K layer, and converts it into the to-be-processed symbol x n by matched filtering and minimum phase system conversion;
  • K is a positive integer greater than 1; from the first layer to the Kth Layer, the corresponding power value of each layer increases in turn;
  • Step 2303 let i be equal to K, and note that the i-th layer to be processed symbol is
  • Step 2304 The receiving apparatus performs FTN demodulation, deinterleaving, and decoding according to the ith layer to-be-processed symbol, and finally obtains an ith layer decision result by using the FTN.
  • Step 2305 it is determined whether i is equal to 1, if i is equal to 1, then step 2308 is performed; if i is not equal to 1, step 2306 is performed;
  • Step 2306 the receiving device reconstructs the i-th layer FTN reconstruction symbol according to the i-th layer decision result
  • Step 2307 the receiving device makes i equal to i-1; and subtracts the i+1th FTN reconstruction symbol from the x n to the Kth layer FTN reconstruction symbol to obtain an i th layer to be processed symbol;
  • Step 2308 ending the method flow.
  • the multi-layer low-order modulation is equivalent to the high-order modulation, that is, the parallel transmission by the multi-layer low-order modulation, and the spectrum efficiency achieved by using the high-order modulation is achieved, so the communication is performed based on the layered technology.
  • the high-order modulation that is, the parallel transmission by the multi-layer low-order modulation
  • the spectrum efficiency achieved by using the high-order modulation is achieved, so the communication is performed based on the layered technology.
  • FTN technology can be used for demodulation for each layer in lower complexity, providing achievability for further spectral efficiency.
  • FIG. 2d is a schematic diagram showing an FTN-based communication method performed by a transmitting device and a receiving device according to an embodiment of the present invention.
  • both the transmitting device and the receiving device perform data transmission based on the layering technology.
  • the transmitting device can perform parallel transmission by using a layering technology, and the transmitting device separately encodes each layer of data and interleaves through different interleavers, such as the Kth layer shown in FIG. 2d. Interleaver ⁇ K interleaving, K-1 layer interleaver ⁇ K-1 interleaving, ..., layer 1 interleaver ⁇ 1 interleaving, and the like. Then, the transmitting device separately performs symbol modulation on each layer of the interleaved data, such as QPSK symbol modulation, and maps into constellation points, and then performs power value allocation on each layer, such as the power value P allocated by the Kth layer shown in FIG. 2d.
  • symbol modulation such as QPSK symbol modulation
  • the noise may be Additive White Gaussian Noise (AWGN).
  • AWGN Additive White Gaussian Noise
  • the power value assigned to each layer in the K layer is obtained by assigning a power value to each of the K layers in order from the first layer to the Kth layer. In this way, power values can be assigned to each layer more efficiently and accurately.
  • the power value allocated for each layer in the K layer satisfies the following condition: the system BER is less than the BER threshold, and the sum of the power values of the first layer to the Kth layer is not greater than the total power value threshold.
  • the system BER can be ensured to meet the requirements, and the sum of the power values of all layers does not exceed the total power value threshold, so that the performance of the entire system is optimal.
  • the power value allocated to each layer in the K layer is obtained by: allocating the power value of the first layer to the first layer; wherein, the power value of the first layer is: satisfying that the system BER is smaller than the BER threshold. Minimum power value.
  • FIG. 2 e is a schematic flow chart showing a method for allocating power values for each layer when i is greater than 1 according to an embodiment of the present invention, as shown in FIG. 2 e .
  • Step A setting the power value of the i-th layer to the power value of the i-th layer; and proceeding to step B;
  • Step B the power value of the i-th layer is increased by a preset step time to obtain the power value of the updated i-th layer; and the process proceeds to step C;
  • Step C when determining that the power value of the layer 1 to the power value of the i-1th layer and the sum of the power values of the i-th layer after the update are not greater than the total power value threshold, proceed to step D; optionally, In step C, when it is determined that the power value of the layer 1 to the power value of the i-1th layer and the sum of the power values of the i-th layer after the update are greater than the total power value threshold, the value of K is set to i-1;
  • Step D when it is determined that the system BER is less than the BER threshold, proceeds to step E, otherwise, proceeds to step B;
  • Step E the updated power value of the i-th layer is determined as the power value of the i-th layer
  • step F when it is determined that i is smaller than K 0 , i is incremented by 1, and the process proceeds to step A.
  • step F when it is determined that i is not less than K 0 , the value of K is set to K 0 .
  • the power value is allocated for the first layer, and then the power value is allocated for the second layer. If the power value of the second layer is satisfied, the system BER is less than the BER threshold and the first The power value of the layer to the sum of the power values of the second layer is not greater than the total power value threshold, and the power value is allocated for the third layer.
  • the power values are assigned to the third layer, the fourth layer, and the fifth layer in sequence, it is determined that the value of K is 5, and the power value of the sixth layer is no longer set.
  • the transmitting device can determine the value of K 0 according to the rate requirement of the system. Specifically, the transmitting device can calculate the value of K 0 according to the transmission rate to be required. For example, if the sending device feels that the setting of 5 layers can meet the demand according to the actual situation of the data transmitted this time, K 0 is set to 5, and even if the first 5 layers meet the preset conditions, Then set the 6th layer to avoid waste of power resources.
  • the K is The value is 3. That is, at this time, the value of K can no longer be large, otherwise it will exceed the preset power value threshold, that is, exceed the capability of the transmitting device itself, thereby causing data transmission failure and the like.
  • the value of K set in the embodiment of the present invention can satisfy the requirement of the data transmission on the one hand, and can conform to the performance of the system itself on the other hand.
  • the more the number of layers, that is, the larger the value of K, the larger the transmission power value required by the transmitting device, and the maximum transmission power value of the actual transmitting device is limited by the total power value threshold, that is, the transmitting device sends
  • the sum of the transmit power values of the layers of data cannot be greater than the total power value threshold. Therefore, by adopting the above method, the system BER is ensured to meet the requirements, and the sum of the power values of all layers is not required to exceed the total power value threshold.
  • the BER threshold is 10 -6 and K 0 is 5:
  • first setting the power value of the first layer is: the minimum power value that satisfies the system BER less than the BER threshold; that is, the power that satisfies the system BER less than the BER threshold.
  • the power value of the first layer takes the minimum value within the range. That is, the BER of the system (the system has only one layer) at the minimum power value requirement is less than the BER threshold, for example, 5 dBm.
  • the power value of the second layer is set to the power value of the first layer of 5 dBm.
  • the power value of the second layer is gradually increased from 5 dBm by a preset step.
  • the preset step size is 0.5 dB
  • the power value of the updated layer 2 obtained after the first increase is 5.5 dBm.
  • the power value of the second layer is again increased by a preset step size, that is, the power value of the updated layer 2 is 6 dBm, and the power value of the first layer and the updated layer 2 are The sum of the power values is not greater than the total power value threshold, and further determining that the system BER corresponding to the updated power value of 6 dBm of the second layer is less than the BER threshold, determining that the power value of the second layer is 6 dBm.
  • the power value of the third layer is set to the power value of the second layer of 6 dBm, and the power value of the third layer is increased by 6 dBm in a preset step, and the first increase is performed. After that, it is 6.5dBm. If it is determined that the sum of the power value of the first layer is 5dBm, the power value of the second layer is 6dBm, and the sum of the power value of the updated third layer is 6.5dBm is greater than the total power value threshold, then K is determined to be 2 That is, the maximum number of layers determined by the transmitting device is 2.
  • the power value of the third layer is determined to be 6.5 dBm;
  • the power value of layer 4 is successfully allocated in turn, and the power value of layer 5 is 7.5 dBm.
  • the preset K 0 is 5, it is determined that the value of K is 5 at this time, and the sixth layer is no longer configured.
  • the transmitting device filters all the symbols in the K layer by FTN shaping filtering to obtain a signal to be transmitted, and then the signal is transmitted, and the signal reaches the receiving device by the influence of noise.
  • the noise may be Additive White Gaussian Noise (AWGN).
  • the receiving device converts the received signal into a to-be-processed symbol by a matched filtering and a minimum phase system conversion based on an Orthogonal Basis Model (OBM), and further processes the symbol to be processed.
  • OBM Orthogonal Basis Model
  • the FTN technology specifically implements a higher symbol rate by compressing symbol periods in the time domain without changing a single symbol waveform, that is, maintaining a signal bandwidth. From another angle
  • FTN is equivalent to compressing the signal bandwidth in the frequency domain to save frequency resources on the premise that the symbol period is constant.
  • the signal sent by the transmitting device is processed by the noise and FTN shaping filter, and the receiving device passes the OBM matching filtering process to keep the noise of each sampling symbol independent of each other. Further, since the FTN compresses the symbol bandwidth, the optimal sampling point is interfered by other symbols, resulting in ISI and causing waveform distortion.
  • an all-pass filter can be added to minimize the phase response of the overall response.
  • the all-pass filter does not change the power value spectrum distribution of the signal and noise, so the noise in the symbol to be processed can still maintain the independence of the symbols; secondly, in all systems with the same amplitude-frequency characteristics, the minimum
  • the phase system concentrates the more energetic taps in a shorter delay interval, thereby reducing the complexity of FTN demodulation.
  • the receiving device After the receiving device converts the received signal into a to-be-processed symbol through matched filtering and minimum phase system conversion, the data sent by the transmitting device needs to be obtained from the to-be-processed symbol, that is, the receiving device needs to perform FTN demodulation, de-interleaving, and decoding.
  • the FTN demodulation result may be hard decision information or soft decision information, and a soft decision result is generally required when there is a compiled code.
  • the receiving device sequentially separates the Kth layer to be processed symbol to the layer 1 to be processed symbol according to the size of the corresponding power value of each layer.
  • the receiving device separates the ith layer to-be-processed symbol from the to-be-processed symbol, including: when the determining device determines that i is equal to K, the to-be-processed symbol is used as The i-th layer to be processed symbol; the receiving device acquires the FTN reconstruction of the i+1th FTN reconstruction symbol to the Kth layer reconstructed according to the i+1th layer decision result to the Kth layer decision result when determining i is not equal to K The receiving device removes the acquired i+1th FTN reconstructed symbol from the to-be-processed symbol to the FTN reconstructed symbol of the Kth layer to obtain an i-th layer to-be-processed symbol.
  • the receiving device can directly treat the symbol to be processed as the symbol to be processed of the Kth layer, and then iterate through the symbol to be processed of the Kth layer.
  • the structure performs FTN demodulation, deinterleaving, decoding, and performs a decision to output a decision result.
  • the reconstruction of the K-th FTN reconstruction symbol may be performed according to the K-th layer decision result to obtain the K-th layer FTN reconstruction symbol.
  • the result of the decision is hard information, and thus, the K-th FTN reconstructed symbol reconstructed according to the hard decision information is more accurate.
  • the Kth layer FTN reconstruction symbol After demodulating the K-1th layer to be processed symbol, the Kth layer FTN reconstruction symbol is subtracted from the converted symbol to be processed, and the obtained information is used as the K-1th layer to be processed symbol, and it is iterated.
  • the structure is demodulated, deinterleaved, decoded and judged to obtain the K-1 layer decision result. It can be seen that, at this time, for the K-1 layer to be processed symbol, the Kth layer FTN reconstruction symbol is not included, and only the power value of the Kth layer is greater than the power value of the K-1 layer, that is, the power value has been eliminated at this time. The interference of the larger value of the power value on the K-1 layer pending symbol.
  • the K-1 layer FTN reconstruction symbol reconstruction may be performed according to the K-1 layer decision result, and the K-1 layer FTN reconstruction symbol is obtained; then the Kth layer FTN reconstruction symbol is subtracted from the to-be-processed symbol and the The K-1 layer FTN reconstructs the symbol, and the obtained information is used as the K-2 layer to be processed symbol, and demodulates, deinterleaves, decodes and judges the iterative structure to obtain the K-2 layer decision result. It can be seen that, at this time, for the K-2 layer to be processed symbol, since the Kth layer FTN reconstruction symbol and the K-1 layer FTN reconstruction symbol are not included, and only the power values of the Kth layer and the K-1 layer are only included. The power value greater than the K-2 layer, that is, the interference of the larger value of the power value to the symbol of the K-2 layer to be processed has been eliminated.
  • the method for eliminating the interference of the layer larger than the power value of the current layer is similar to the foregoing, and is not described again.
  • the above method can be used to obtain the decision result of all layers, and then the estimation is performed.
  • the data transmitted by the transmitting device is obtained.
  • the receiving device performs FTN demodulation on the i-th layer to be processed symbol to obtain the i-th layer demodulated symbol, and performs a decision according to the i-th layer demodulated symbol to obtain an i-th layer decision result.
  • the receiving device repeats FTN demodulation, deinterleaving and decoding on the ith layer to-be-processed symbol by using an iterative structure to obtain an ith layer decoding result obtained after multiple iterations; the receiving device decodes according to the ith layer The result is judged to obtain the i-th layer decision result.
  • the i-th layer decoding result is obtained by using multiple iterations, so that the obtained i-th layer decoding result is more accurate, and then according to the ith layer.
  • the decoding result can be more accurately judged, thereby obtaining a more accurate i-th layer decision result, and then reconstructing a more accurate i-th layer FTN reconstruction symbol according to the i-th layer decision result, thereby being more accurate and more accurate.
  • the interference of the ith layer to the Kth layer FTN reconstruction symbol on the i-1th layer to be processed symbol is completely eliminated, that is, the interference of the power layer with a larger layer on the current layer is more accurately eliminated.
  • the receiving device repeatedly performs FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations, including:
  • the receiving device performs FTN demodulation, deinterleaving and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result of the iteration; the ith layer decoding result of the iteration is used as FTN in the next iteration process
  • the a priori information of the demodulation is performed to perform FTN demodulation, deinterleaving, and decoding in the next iteration.
  • the ISI introduced by the FTN is regarded as an inner coding
  • the channel coding is regarded as an outer coding
  • a turbo (turbo) iterative structure is used for processing, that is, each decoding feedback is performed.
  • the soft information is used as the a priori information of the FTN demodulation.
  • the FTN demodulation of each layer is performed separately by IQ two paths.
  • the transmitting device performs interleaving through different interleavers, such as the K-th interleaver ⁇ K interleaving shown in FIG. 2d, the K-1 layer interleaver ⁇ K-1 interleaving, ..., The 1-layer interleaver ⁇ 1 interlaces and the like.
  • the receiving device is also deinterleaved by the corresponding deinterleaver and reinterleaved in the iterative feedback process. For example, as shown in Figure 2d, use a deinterleaver for layer K.
  • deinterleaving and interleaver ⁇ K interleaving in the iterative feedback process deinterleaver for the K-1 layer Perform de-interleaving and use interleaver ⁇ K-1 interleaving in the iterative feedback process, ..., use deinterleaver for layer 1 Deinterleaving is performed and interleaved using ⁇ 1 in the iterative feedback process.
  • each layer in the receiving device performs signal demodulation through an iterative loop.
  • the decoding result after the last iteration of the layer with the larger power value is determined and the FTN signal is reconstructed, and each layer of the to-be-processed symbol is separated from the to-be-processed symbol, thereby achieving inter-layer interference cancellation.
  • each layer performs FTN demodulation, deinterleaving, and decoding, respectively.
  • the soft decision information is decoded and outputted, and then interleaved, and then fed back to the FTN demodulation of the next iteration, so that the demodulation result is more accurate, and the decoding result of the last iteration of each layer is performed. Judgment, get the final sink.
  • FTN demodulation may be performed by using Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithms, etc., for performing FTN demodulation for each layer.
  • a state transition trellis diagram is first generated in the demodulation process, and then a Log-Likelihood Ratio (LLR) is calculated based on the state transition trellis diagram.
  • LLR Log-Likelihood Ratio
  • the FTN demodulation of the first layer since the FTN reconstruction symbols of the second layer to the Kth layer are subtracted from the to-be-processed symbols, the first layer is not interfered by other layers, so conventional FTN demodulation can be employed. That is, FTN demodulation without interference.
  • FTN demodulation without interference.
  • the FTN demodulation for the Kth layer to the 2nd layer can be performed by the FTN demodulation considering interference provided in the embodiment of the present invention.
  • the FTN demodulation without interference is specifically: when i is equal to 1, the receiving device performs FTN demodulation on the layer 1 to-be-processed symbol.
  • the BCJR algorithm may be used, where the algorithm includes:
  • the receiving device generates a state transition grid map of the first layer for the first layer
  • the receiving device transfers the grid map according to the state of the layer 1, and optionally generates the layer 1 desired output symbol for the plurality of branch transitions; optionally, the layer 1 desired output symbol includes: the first layer of the desired symbol and the a symbol obtained by multiplying the corresponding power value factors of the layer;
  • the receiving device calculates the LLR of the first layer data based on the first layer expected output symbol.
  • the receiving device shifts the grid map according to the state of the first layer, and the generation rule when generating the first layer desired output symbol conforms to the following formula:
  • P 1 is a power value corresponding to the layer 1 symbol; a power value factor corresponding to the layer 1 symbol;
  • L is the length of the ISI tap of the preset i-th layer; wherein i is 1 at this time;
  • the first layer of data corresponding to the state transition grid map
  • n is the data label.
  • the algorithm for FTN demodulation belongs to an algorithm of deconvolution, and the tap is a convolutional response coefficient in a convolution process, and the tap may be a filter coefficient, a linear equalization coefficient, or a code.
  • Inter-crosstalk coefficient where the ISI tap refers to the crosstalk coefficient between codes.
  • the data of the first layer sent by the transmitting device is
  • the first layer to be processed symbol separated by the receiving device from the symbol to be processed is Give an example for explanation.
  • the receiving device performs FTN demodulation from Get It is a deconvolution process, and the BCJR algorithm is a classic algorithm for deconvolution, so it is also a reliable solution for FTN demodulation.
  • each desired output symbol causes each desired output symbol to be related not only to the current input symbol, but also to the previous symbols, and the value of the preceding several symbols is a state.
  • the current input symbol be the data of the first layer sent by the sending device.
  • ISI length is L
  • the next state will become If the number of types of each symbol is M, that is, the number of types of IQ two-way symbols is Then the number of single-state states is M (L-1)/2 , which is transferred from the current state to the next state.
  • the number of branches, that is, the total branch transfer case is M L/2 .
  • the BCJR algorithm is designed based on a state transition grid diagram. FIG.
  • FIG. 2f exemplarily shows a state transition grid diagram provided by an embodiment of the present invention.
  • the "-" stands for 1 and -1 respectively, and their corresponding binary bits are 0 and 1, respectively, and the initial state and the end state are both "++".
  • the BCJR algorithm needs to obtain soft information for each bit, usually LLR, which needs to be calculated by branch transition probability, forward state probability, and backward state probability.
  • LLR branch transition probability, forward state probability, and backward state probability.
  • the first calculation amount, the first The two calculation amounts, the third calculation amount, and the fourth calculation amount explain these calculation amounts.
  • the branch transition probability is used to describe the probability of moving from one state to another. Set the nth input symbol to make the status from move to If there is no noise, the corresponding expected output symbol is in equation (1) Actual receiving symbol due to the presence of noise versus There is a certain gap, and according to this formula, it can be calculated according to formula (2). move to The branch transition probability can be based on equation (2):
  • the symbol for the first layer to be processed is Time corresponding to slave status move to Branch transfer probability
  • the prior probability of the decoded soft information output from the previous iteration is calculated by the interleaver ⁇ 1 .
  • the value is 1/2;
  • N is a single-channel noise power value
  • ⁇ is a pi-constant
  • s' has M (L-1)/2 possible values, and each value corresponds to A transition case, so each stage of the trellis diagram needs to calculate M L/2 branch transition probabilities (except for the initial and end).
  • the forward state probability describes the probability that each level, ie, the time of each symbol sample point, is in each state from front to back recursively, and can be expressed as equation (3):
  • ⁇ n-1 (s') is a forward state probability at state s' at time n-1 calculated from front to back recursively; the set of values of s' may be a set of states that can jump to s.
  • the backward state probability describes the probability that each level, ie, the time of each symbol sample point, is recursively calculated from backward to forward, and can be expressed as equation (4):
  • ⁇ n+1 (s') is a backward state probability at state s' at time n+1 calculated recursively from back to front;
  • the set of values of s' can be a set that can be jumped from the s state.
  • the LLR can be expressed by equation (5):
  • the set of values of [s' 1 , s 1 ] is the combination of all states in which the current bit corresponding to s' 1 ⁇ s 1 state transition is 1, and [s' 0 , s 0 ]
  • the set of values is a combination of all states in which the corresponding current bit is 0 when the state transitions from s' 0 to s 0 ; wherein s' 1 ⁇ s 1 represents a transition from state s' 1 to state s 1 ; s' 0 ⁇ s 0 Indicates transition from state s' 0 to state s 0 ;
  • ⁇ n (s 1 ) is a backward state probability at state s 1 at time n calculated recursively from back to front;
  • ⁇ n (s 0 ) is a backward state probability at state s 0 at time n calculated recursively from back to front;
  • ⁇ n-1 (s' 1 ) is a forward state probability at state s' 1 at time n-1 calculated from front to back recursively;
  • ⁇ n-1 (s' 0 ) is a forward state probability at state s' 0 at time n-1 calculated from front to back recursively;
  • the M-BCJR algorithm may be used for FTN demodulation, specifically, recursive calculation is performed for each stage to select a state with a large probability, rather than for all states.
  • the branch transition probability, the forward state probability, and the backward state probability are calculated, and the corresponding probability is set to 0 for the unselected state.
  • FIG. 2g exemplarily shows a comparison diagram of a distribution map and a Gaussian distribution map of the first layer to the i-1th layer interference plus noise when i is not equal to 1 according to an embodiment of the present invention, which can be seen from FIG. 2g.
  • i is not equal to 1
  • the distribution of interference + noise 2301 is significantly different from the Gaussian distribution 2302, and + indicates the meaning of addition. Therefore, if the FTN solution is not considered for the i-th layer when i is not equal to 1, Tone, the interference plus noise is regarded as a Gaussian distribution map, and there is a large error, which will bring a large error to the branch transition probability calculation.
  • the FTN demodulation considering interference is specifically: when i is not equal to 1, the receiving apparatus performs FTN demodulation on the ith layer to be processed symbol to obtain the i-th layer demodulated symbol, including:
  • the receiving device generates a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, and the receiving device transfers the trellis diagram according to the state of the i-th layer, and performs FTN demodulation on the i-th layer to be processed symbol; wherein, the jth
  • Each of the layers to the i-1 layer is a layer that is preset and has a degree of interference to the i-th layer that is greater than the interference threshold; It is greater than or equal to 1 and less than or equal to i-1.
  • the receiving device generates a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, including: the receiving device is for the i-th layer ISI tap, and each of the jth layer to the i-1th layer A significant ISI tap generation state transition trellis diagram; wherein, the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the corresponding layer of the i th layer The ISI tap of the energy threshold.
  • the jth layer when j is greater than or equal to 1 and less than or equal to i-1, the jth layer includes one or more ISI taps, and the ISI taps are classified into two types, a significant ISI tap or a non-ISI significant tap.
  • the significant ISI tap of the jth layer refers to the ISI tap of the energy of all the ISI taps of the jth layer is greater than the energy threshold corresponding to the i th layer;
  • the non-significant ISI tap of the jth layer refers to all the ISI taps of the jth layer
  • the ISI tap whose energy is not greater than the energy threshold corresponding to the i-th layer.
  • the energy thresholds of any two of the K layers are different.
  • the energy threshold corresponding to the fifth layer is 2 dBm, that is, the ISI tap of the fifth layer will cause serious interference to the symbol of the fifth layer.
  • significant ISI taps with energies above 1 dBm in layers 1 through 4 cause severe interference to the 5th layer symbol, at which point significant ISI taps with energies above 2 dBm are responsible for layer 5 symbols. Interference cannot be approximated as Gaussian noise. Therefore, significant ISI taps with energy above 2dBm need to be considered in the state transition grid to better handle the significant ISI taps above 2dBm for the 5th layer. The interference.
  • the corresponding j is set to 3.
  • the energy may be equivalent to a power value
  • the energy threshold may be equivalent to a power value threshold.
  • the power values of each layer are different, so the energy threshold corresponding to each layer is also different.
  • the receiving device performs FTN demodulation on the ith layer to-be-processed symbol by using a BCJR algorithm considering interference based on the state transition trellis diagram, including:
  • the receiving device generates an ith layer desired output symbol according to the state transition trellis diagram; wherein, the ith layer expected output symbol comprises: multiplying the symbol of each layer in the jth layer to the i th layer by a power value factor corresponding to each layer The sum of the symbols; the receiving device calculates the log likelihood ratio LLR of the i-th layer based on the expected output symbol of the i-th layer.
  • the significant ISI taps of each of the jth layer to the i-1th layer are considered in the state transition, and then the remaining jth layer to the i-1th layer are non-significant.
  • the ISI taps, the ISI taps of the 1st to the j-1th layers, and the noise are treated as Gaussian noise.
  • FIG. 2h exemplarily shows an embodiment of the present invention from the first layer when i is not equal to 1.
  • the interference + noise distribution 2401 after removing the significant ISI taps of each of the jth layer to the i-1th layer is closer to the Gaussian distribution 2402, where + indicates the meaning of addition, that is, when i is not equal to 1
  • the i-th layer performs FTN demodulation considering interference, that is, considering the significant ISI taps of each layer in the jth layer to the i-1th layer into the state transition trellis diagram, and then considering the remaining interference plus noise as a Gaussian distribution, Accurate, there will be no large errors. There is some noise distribution in other interference situations in Figure 2h, which is not discussed at this time.
  • the maximum interference layer is preset to 2 layers according to the interference energy threshold; at this time, when the FTN demodulation of the 5th layer to be processed symbol is required, it is generated for the 3rd to 5th layers.
  • the state transition trellis diagram performs FTN demodulation, that is, the preset layer 4 to-be-processed symbols and the layer 3 to-be-processed symbols have the strongest interference to the layer 5 to-be-processed symbols, and the interference degree is greater than the interference threshold, and the The two layers of pending symbols and the first layer of pending symbols have a weaker effect on the fifth layer, and all ISI taps of the first layer, all ISI taps of the second layer, non-significant ISI taps of the third layer, and the fourth The non-significant ISI tap of the layer processes the interference plus noise of the 5th layer as Gaussian noise, that is, when i is 5, the preset j is 3.
  • the layer 5 FTN reconstruction symbol has been removed from the layer 4 to-be-processed symbol
  • only the ISI tap of the layer 4 is required at this time, and the layer 2 to the The state transition trellis diagram generated by the significant ISI taps of each of the three layers performs FTN demodulation, that is, the preset layer 2 and layer 3 have the strongest interference to the layer 4 pending symbols, and the degree of interference Greater than the interference threshold, and the first layer of pending symbols has a weaker effect on the fourth layer, and all ISI taps of the first layer, non-significant ISI taps of the second layer, and non-significant ISI taps of the third layer
  • the 4 layers of interference plus noise are treated as Gaussian noise, that is, when i is 4, the preset j is 2.
  • FTN demodulation is performed on the layer 5 to-be-processed symbol
  • FTN demodulation is performed for the ISI taps in layer 5 and the state transition trellis diagrams generated by the significant ISI taps of each of the third to fourth layers, that is, in addition to considering the ISI taps in layer 5
  • the taps and the ISI taps of each of the first to second layers are treated as Gaussian noise.
  • the generating rule when the receiving device generates the i-th layer expected output symbol for each branch transfer according to the state transition trellis diagram meets the following formula requirements:
  • P i is the power value corresponding to the i-th layer symbol
  • P i-1 is the power value corresponding to the i-th layer symbol
  • P im is the power value corresponding to the im- th layer symbol
  • P j is The power value corresponding to the jth layer symbol; a power value factor corresponding to the i-th layer symbol; a power value factor corresponding to the i-1th layer symbol; a power value factor corresponding to the first im layer symbol; a power value factor corresponding to the jth layer symbol;
  • L is the length of the Ii tap of the preset i-th layer
  • L 1 is the length of the significant ISI tap of the preset i-1th layer
  • L m is the length of the significant ISI tap of the preset im layer
  • L ij The length of the significant ISI tap for the preset j-th layer
  • n is an integer, m takes every integer in [1, i-j];
  • n is the data label.
  • FIG. 2 is a schematic structural diagram of another state transition grid diagram provided by an embodiment of the present invention. As shown in FIG. 2i, the interference layer with the ISI length of the current layer being L and the interference level exceeding the interference threshold is set.
  • the interference layer is considered only a first layer i-1) is considered the ISI length L 1, with and Representing the current layer and the symbol of the interference layer under consideration, the state transition process can be recorded as
  • the data sent by the transmitting device is
  • the ith layer to-be-processed symbol separated by the receiving device from the to-be-processed symbol x n is Give an example for explanation.
  • the interference layer whose interference level exceeds the interference threshold is only the i-1th layer, and the nth input symbol makes the state from move to Regardless of noise and other disturbances, the corresponding expected output symbol is calculated according to formula (6).
  • the branch transition probability can be calculated according to formula (7):
  • N represents the sum of the power values of single-channel noise and other interferences not considered in the state transition process. Since this part does not contain the interference taps with larger energy, the distribution characteristics are close to the Gaussian distribution;
  • ⁇ is a pi constant
  • a Viterbi algorithm or the like may also be used for deconvolution, which is also performed based on a state transition trellis diagram.
  • the FTN demodulation method considering interference in the present invention may also adopt such a method. method. That is, in the embodiment of the present invention, when the i is not equal to 1, the receiving device performs a FTN demodulation on the i-th layer to-be-processed symbol for the state transition trellis map generated by the j-th layer to the i-th layer symbol.
  • BCJR algorithm and other deconvolution algorithms such as Viterbi.
  • the corresponding number of layers in the embodiment of the present invention is log 4 M (considering each layer is QPSK modulation).
  • Each layer uses IQ two channels for FTN demodulation.
  • the interference layer whose interference level exceeds the interference threshold is only the strongest interference layer.
  • L is the ISI length of the current layer, and L 1 is The length of the significant ISI tap of the strongest interference layer;
  • the number of branch transfer types is For Layer 1, the number of single-state states is 2 L-1 and the number of branch transitions is 2 L.
  • Table 2 Number of states of multi-layer structure and number of branch transitions under different modulation modes
  • the main conditions include: (1) the FTN compression ratio is 4/7, the roll-off coefficient of the Root-Raised Consine (RRC) forming filter is 0.2; (2) the spectral efficiency of 16384QAM modulation is required; 3)
  • the coding method is a Low Density Parity Check Code (LDPC) code with a code rate of 0.8.
  • LDPC Low Density Parity Check Code
  • FIG. 2j exemplarily shows an ISI before and after conversion of a minimum phase system according to an embodiment of the present invention.
  • the ISI length considered is 10, which is [0.2782 0.7162 0.5489-0.1054-0.2435 0.0996 0.1100-0.0973-0.0417 0.0555];
  • the target BER is set to 10 -6 in advance, and the power value is allocated according to an optional transmitting device allocation power value method provided in the foregoing content of the embodiment of the present invention. It is assumed that the maximum signal power value allows 4-layer transmission. The difference in interlayer power values can be obtained. Based on the power value of the first layer, the power values of the 2-4th layer will need to be increased by 8.9141dB, 9.0781dB, and 8.9297dB, respectively. During the BER performance test, for different Eb/N0 (where Eb represents the signal energy averaged to each bit and N0 represents the power value spectral density of the noise), the difference in interlayer power values must be kept constant.
  • FIG. 2 is a schematic diagram showing the BER performance result of a Matlab platform simulation provided by an embodiment of the present invention. As shown in FIG. 2k, each layer of the embodiment of the present invention is demodulated compared to the 16384QAM modulation without FTN. All of the iterations are required, and the number of iterations is set to 10. It can be seen that the BER performance obtained by the embodiment of the present invention is better.
  • the embodiment of the present invention can achieve a performance gain of 0.5 dB at a BER of 10 -6 compared to the conventional 16384 QAM modulation.
  • the 4-layer structure adopted in the embodiment of the present invention corresponds to 256QAM modulation, and can accept a smaller power value amplifier (PA) power value back-off, and can obtain additional 3-5dB system gain, so the total gain is 3.5-5.5dB.
  • PA power value amplifier
  • the FTN compression ratio is not limited in the embodiment of the present invention, and the signal bandwidth is sufficiently compressed to improve the spectrum efficiency; and the FTN is difficult to be used for high-order modulation through the layered transmission architecture.
  • the problem is that it is easy to apply FTN on the basis of high-order modulation spectrum efficiency; effectively achieve inter-layer interference cancellation and ensure BER performance requirements.
  • the power value is larger than the layer signal reconstruction feedback, and the interference cancellation is thorough; considering the significant ISI tap of the smaller power layer in the state transition relationship, the influence of the interference on the FTN demodulation is reduced;
  • the high-order QAM modulation under spectral efficiency reduces the requirement for the PA power value to fall back, further improving the system gain.
  • the description is mainly for the AWGN channel, which can also be used in the multipath channel environment, and only needs to perform channel equalization before entering the multi-layer FTN demodulation to remove the influence of the channel multipath.
  • white noise is taken as an example.
  • the matched filter and the transmitting device forming filter are strictly matched, that is, when Ungerboeck matched filtering is used, the noise will be correlated if the BCJR algorithm is improved to color.
  • the embodiment of the present invention can also continue FTN demodulation for this case.
  • the FTN demodulation method considering interference in the embodiment of the present invention can also be used for other signal demodulation in an interference and ISI environment, or in a volume with interference. Product code decoding.
  • the layered technology is used for parallel transmission through multiple layers of low-order modulation, and the spectrum efficiency achieved by using high-order modulation is achieved, so communication based on layering technology is provided.
  • Higher spectral efficiency since each layer uses low-order modulation, FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • FIG. 3 is a schematic structural diagram of a receiving apparatus according to an embodiment of the present invention.
  • the receiving apparatus 300 includes a receiving unit 301, a converting unit 302, and a processing unit.
  • the receiving apparatus 300 includes a receiving unit 301, a converting unit 302, and a processing unit.
  • a receiving unit configured to receive a signal that the transmitting device sends in parallel through the K layer
  • K is a positive integer greater than 1; and from a layer 1 to a layer K, a corresponding power value of each layer is sequentially increased;
  • a processing unit configured to target the i-th layer in the K layer, i is greater than or equal to 1 and less than or equal to K, and performs:
  • a decision is made to obtain an i-th layer decision result.
  • the processing unit is configured to: when i is equal to 1, generate a state transition mesh map of the first layer for the first layer; and transfer the mesh map according to the state of the first layer, and generate the first for each branch transfer The layer expects an output symbol; wherein: the log likelihood ratio LLR of the first layer is calculated according to the expected output symbol of the first layer.
  • the processing unit is configured to: when i is not equal to 1, generate a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, and transfer the trellis diagram according to the state of the i-th layer, to the i-th
  • the layer to be processed is subjected to FTN demodulation to obtain an i-th layer demodulated symbol; wherein each of the jth layer to the i-1th layer is preset, and the interference degree to the i-th layer is greater than the interference threshold.
  • Layer; j is greater than or equal to 1 and less than or equal to i-1.
  • the processing unit is configured to: for the i-th layer ISI tap, and the j-th layer to the i-th layer, when generating the state transition trellis diagram of the i-th layer for the jth layer to the i-th layer A state transition trellis diagram generated by a significant ISI tap of the layer; wherein the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the i The ISI tap of the energy threshold corresponding to the layer.
  • the processing unit performs FTN demodulation on the i-th layer to be processed symbol according to the state of the i-th layer to obtain the i-th layer demodulated symbol, and is used to: transfer the grid map according to the state , Generating an i-th layer desired output symbol for each branch transfer; wherein the i-th layer desired output symbol comprises: a sum of symbols obtained by multiplying a symbol of each layer in the jth layer to the i-th layer by a power value factor corresponding to the layer According to the expected output symbol of the i-th layer, the log likelihood ratio LLR of the i-th layer is calculated.
  • the generating rule when the processing unit generates the i-th layer expected output symbol for each branch transfer according to the state transition trellis diagram conforms to the requirement of formula (6) in the foregoing method item embodiment.
  • the processing unit performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol, and performs a decision according to the ith layer demodulated symbol to obtain an ith layer decision result.
  • FTN demodulation, deinterleaving and decoding are performed on the ith layer to be processed symbol by using an iterative structure, and the ith layer decoding result obtained after multiple iterations is obtained; and the ith layer decoding result is used to determine the result The result of the i-layer decision.
  • the processing unit performs FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations, and is used for: Each iteration, execute:
  • the i-th layer decoding result of the iteration is used as FTN demodulation in the next iteration process
  • the a priori information in turn performs FTN demodulation, deinterleaving, and decoding in the next iteration.
  • the layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency;
  • FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • FIG. 4 is a schematic structural diagram of a transmitting apparatus according to an embodiment of the present invention.
  • the embodiment of the present invention provides a sending apparatus, which is configured to execute the foregoing method.
  • the sending apparatus 400 includes a processing unit 401 and a sending unit 402:
  • a processing unit configured to respectively encode, interleave, and modulate signals of all layers in the K layer to obtain symbols of each layer in the K layer; wherein, K is a positive integer greater than 1; according to each layer in the K layer Power value, all symbols in the K layer are filtered by FTN shaping filtering;
  • a sending unit configured to send all the symbols in the filtered K layer in parallel; wherein, from the first layer to the Kth layer, corresponding power values of each layer are sequentially increased.
  • the method for the power value allocated by each layer in the K layer and the method for the power value allocated to each layer in the K layer can be referred to the description in the foregoing method embodiment, and details are not described herein again.
  • the layered technology is used for parallel transmission through multi-layer low-order modulation, which achieves the spectral efficiency achieved by using high-order modulation. Therefore, communication based on layered technology provides higher spectral efficiency;
  • FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • FIG. 5 is a schematic diagram showing the result of a receiving apparatus according to an embodiment of the present invention.
  • an embodiment of the present invention provides a receiving apparatus, which is configured to execute the foregoing method, and the receiving apparatus 500 includes a processor 501, a receiver 502, and a memory 503:
  • a receiver configured to receive a signal sent by the transmitting device in parallel through the K layer
  • a memory for storing programs and instructions
  • the processor is configured to execute by calling a program and an instruction stored in the memory:
  • K is a positive integer greater than 1; from the first layer to the Kth layer, the corresponding power value of each layer is sequentially increased;
  • i is greater than or equal to 1 and less than or equal to K, and performs:
  • the processor is configured to: when i is equal to 1, generate a state transition of the first layer for the first layer Shifting the grid map; generating a layer 1 desired output symbol for each branch transition according to the state of the layer 1 transition; wherein: calculating the log likelihood ratio of the layer 1 according to the expected output symbol of the layer 1 LLR.
  • the processor is configured to: when i is not equal to 1, generate a state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, and transfer the trellis diagram according to the state of the i-th layer, to the i-th
  • the layer to be processed is subjected to FTN demodulation to obtain an i-th layer demodulated symbol; wherein each of the jth layer to the i-1th layer is preset, and the interference degree to the i-th layer is greater than the interference threshold.
  • Layer; j is greater than or equal to 1 and less than or equal to i-1.
  • the processor when generating the state transition trellis diagram of the i-th layer for the jth layer to the i-th layer, is used for: for the i-th layer ISI tap, and for each of the jth layer to the i-1th layer A state transition trellis diagram generated by a significant ISI tap of the layer; wherein the significant ISI taps of each of the jth layer to the i-1th layer are: the energy in each of the jth layer to the i-1th layer is greater than the i The ISI tap of the energy threshold corresponding to the layer.
  • the processor shifts the trellis diagram according to the state of the i-th layer, and performs FTN demodulation on the i-th layer to be processed to obtain the i-th layer demodulated symbol, and is used to: transfer the trellis according to the state.
  • the generating rule when the processor generates the i-th layer expected output symbol for each branch according to the state transition trellis diagram is required by the formula (6) in the foregoing method item embodiment.
  • the processor performs FTN demodulation on the ith layer to be processed symbol to obtain an ith layer demodulated symbol, and performs a decision according to the ith layer demodulated symbol to obtain an ith layer decision result.
  • FTN demodulation, deinterleaving and decoding are performed on the ith layer to be processed symbol by using an iterative structure, and the ith layer decoding result obtained after multiple iterations is obtained; and the ith layer decoding result is used to determine the result The result of the i-layer decision.
  • performing FTN demodulation, deinterleaving, and decoding on the ith layer to be processed symbol to obtain an ith layer decoding result obtained after multiple iterations for:
  • the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by the processor and various circuits of memory represented by the memory.
  • the bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein.
  • the bus interface provides an interface.
  • the transceiver can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium.
  • the processor is responsible for managing the bus architecture and the usual processing, and the memory can store the data that the processor uses when performing operations.
  • the layered technology is used for parallel transmission through multiple layers of low-order modulation, and the spectrum efficiency achieved by using high-order modulation is achieved, so communication based on layered technology is provided.
  • High spectral efficiency on the other hand, since each layer uses low-order modulation, FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • FIG. 6 is a schematic structural diagram of a transmitting apparatus according to an embodiment of the present invention.
  • an embodiment of the present invention provides a sending apparatus 600, which is configured to execute the foregoing method, including a processor 601, a transmitter 602, and a memory 603:
  • a memory for storing programs and instructions
  • the processor is configured to execute by calling a program and an instruction stored in the memory:
  • the signals of all layers in the K layer are separately encoded, interleaved and modulated to obtain symbols of each layer in the K layer; wherein K is a positive integer greater than 1; according to the power value assigned to each layer in the K layer, the K layer is All symbols in the filter are filtered by FTN shaping filtering;
  • the transmitter is configured to send all the symbols in the filtered K layer in parallel; wherein, from the first layer to the Kth layer, the power values corresponding to each layer are sequentially increased.
  • the method for the power value allocated by each layer in the K layer and the method for the power value allocated to each layer in the K layer can be referred to the description in the foregoing method embodiment, and details are not described herein again.
  • the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by the processor and various circuits of memory represented by the memory.
  • the bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein.
  • the bus interface provides an interface.
  • the transceiver can be a plurality of components, including a transmitter and a transceiver, providing means for communicating with various other devices on a transmission medium.
  • the processor is responsible for managing the bus architecture and the usual processing, and the memory can store the data that the processor uses when performing operations.
  • the layered technology is used for parallel transmission through multiple layers of low-order modulation, and the spectrum efficiency achieved by using high-order modulation is achieved, so communication based on layering technology is provided.
  • Higher spectral efficiency since each layer uses low-order modulation, FTN demodulation can be performed for each layer at a lower complexity, thereby providing achievability for further improving spectral efficiency. That is to say, the multi-layer low-order modulation parallel transmission achieves the spectral efficiency when using high-order modulation, and the FTN technology can be successfully used for demodulation, thereby further improving the spectral efficiency.
  • embodiments of the present invention can be provided as a method, or a 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.
  • a 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)
  • Spectroscopy & Molecular Physics (AREA)
  • Power Engineering (AREA)
  • Error Detection And Correction (AREA)

Abstract

一种基于FTN的通信方法、相关装置，接收装置接收通过K层并行发送的信号，并将其转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；针对K层中的第i层，i大于等于1且小于等于K，执行：接收装置从待处理符号中分离出第i层待处理符号；接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号；接收装置根据第i层解调后符号，进行判决，得到第i层判决结果。

Description

一种基于FTN的通信方法、相关装置 技术领域
本发明涉及无线通信技术领域，尤其涉及一种基于FTN的通信方法、相关装置。
背景技术
超奈奎斯特(Faster than Nyquist，FTN)在不改变单个符号波形即维持信号带宽的前提下，在时域上通过压缩符号周期实现更高的符号速率。从另一个角度上讲，FTN相当于在符号周期不变的前提下，在频域上通过压缩信号带宽以节省频率资源。总之，采用FTN技术达到了提高频谱效率的目的，有助于减轻日益突出的频谱资源危机。
FTN通信系统中最关键的部分是接收装置的FTN解调。由于FTN对信号带宽进行压缩，接收装置接收到的信号中存在引入码间串扰(Inter-Symbol Interference，简称ISI)的问题。FTN解调的目标是使接收装置去除ISI，进而由待处理符号得到发送装置所发送的数据的过程。解调结果可能是硬判决信息或软判决信息，在有编译码时一般要求得到软判决结果。
现有技术中可使用巴尔-科克-耶里內克-拉维夫(Bahl,Cocke,Jelinek,and Raviv，简称BCJR)算法进行FTN解调。但是，随着调制进制数M的增大，BCJR算法中的状态数及每一级的分支转移情况数均呈幂指数增长。考虑同相正交(In-phase and Quadrature，简称IQ)两路分别作FTN解调，则每一路的电平取值种类数为
Figure PCTCN2016084816-appb-000001
状态数为M(L-1)/2，每一级的分支转移情况数为ML/2，其中L代表所考虑的ISI长度。以L＝10为例，表1给出了不同调制方式下的状态数及分支转移情况数(考虑IQ两路，表中的状态数及分支转移情况数是上述结果的两倍)。
表1不同调制方式下的状态数及分支转移情况数
调制方式 状态数 分支转移情况数
QPSK 1024 2048
16QAM 524288 2.10×106
64QAM 2.68×108 2.15×109
256QAM 1.37×1011 2.20×1012
1024QAM 7.04×1013 2.25×1015
4096QAM 3.60×1016 2.31×1018
16384QAM 1.84×1019 2.36×1021
状态数和分支转移情况数直接决定了FTN解调的复杂度，已有的研究中，BCJR算法仅只考虑用于二进制相移键控(Binary Phase Shift Keying，简称BPSK)(FTN解调为单路)、正交相移键控(Quadrature Phase Shift Keying，简称QPSK)(FTN解调为IQ两路)这些简单的调制方式，而难以用于高阶调制模式。
然而，实际通信系统中，在低阶调制模式下通过FTN技术很难达到较高的频谱效率，为了进一步提高频谱效率，需要使用高阶调制模式，而现有技术中的FTN解调算法又很难对高阶调制模式进行解调。
基于上述论述，亟需一种基于FTN的通信方案，以通过较低复杂度实现对等效高阶调制模式的FTN解调，从而达到较高的频谱效率。
发明内容
本发明实施例提供一种基于FTN的通信方法、相关装置，可应用于等效高阶调制模式的通信系统，进而实现较高的频谱效率。
本发明实施例提供一种基于FTN的通信方法，包括：
接收装置接收到发送装置通过K层并行发送的信号，并将其转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
针对K层中的第i层，i大于等于1且小于等于K，执行：
接收装置从待处理符号中分离出第i层待处理符号；接收装置在确定i等于K时，将待处理符号作为第i层待处理符号；接收装置在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，接收装置从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号；接收装置根据第i层解调后符号，进行判决，得到第i层判决结果。
采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
可选地，在i等于1时，接收装置对第1层待处理符号进行FTN解调，得到第i层解调后符号，包括：接收装置针对第1层生成第1层的状态转移网格图；接收装置根据第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：接收装置根据第1层期望输出符号，计算出第1层的对数似然比LLR。由于第1层已不受其它层的干扰，因此可采用常规的FTN解调，即不带干扰的FTN解调，如此，可更好的与现有技术兼容。
可选地，在i不等于1时，接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号，包括：接收装置针对第j层至第i层生成第i层的状态转移网格图；接收装置根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号；其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。如此，则在生成第i层的状态转移网格图时还考虑了第j层至第i-1层的影响，从而可更加准确的进行FTN解调。
可选地，接收装置针对第j层至第i层生成第i层的状态转移网格图，包括：接收装置针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。由于将第j层至第i-1层中每层的显著ISI抽头纳入状态转移网格图中考虑，之后将其余干扰加噪声看做高斯分布，则较为准确，不会存在较大的误差。在图2h中存在一些其它干扰情况下的噪声分布，此时不做讨论。
可选地，接收装置根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号，包括：接收装置根据状态转移网格图，针对每个分支转移生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；接收装置根据第i层期望输出符号，计算出第i层的对数似然比LLR。如此，则在生成第i层期望输出符号时还考虑了第j层至第i-1层的影响，从而可更加准确的进行FTN解调。
可选地，接收装置根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合下述公式要求：
Figure PCTCN2016084816-appb-000002
其中，Pi为第i层符号对应的功率值；Pi-1为第i-1层符号对应的功率值；Pi-m为第i-m层符号对应的功率值；Pj为第j层符号对应的功率值；
Figure PCTCN2016084816-appb-000003
为第i层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000004
为第i-1层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000005
为第i-m层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000006
为第j层符号对应的功率值因子；L为预设的第i层的ISI抽头的长度；L1为预设的第i-1层的显著ISI抽头的长度；Lm为预设的第i-m层的显著ISI抽头的长度；Li-j为预设的第j层的显著ISI抽头的长度；
Figure PCTCN2016084816-appb-000007
为第i层的符号分量；
Figure PCTCN2016084816-appb-000008
为第i-1层考虑显著ISI抽头下的符号分量；
Figure PCTCN2016084816-appb-000009
为第i-m层考虑显著ISI抽头下的符号 分量；
Figure PCTCN2016084816-appb-000010
为第j层考虑显著ISI抽头下的符号分量；m为整数，m取遍[1,i-j]中的每一个整数；fl为ISI抽头系数；
Figure PCTCN2016084816-appb-000011
为与状态转移网格图对应的第i层数据；
Figure PCTCN2016084816-appb-000012
为与状态转移网格图对应的第i-1层数据；
Figure PCTCN2016084816-appb-000013
为与状态转移网格图对应的第i-m层数据；
Figure PCTCN2016084816-appb-000014
为与状态转移网格图对应的第j层数据；n为数据标号。由于将第j层至第i-1层中每层的显著ISI抽头纳入状态转移网格图中考虑，之后将其余干扰加噪声看做高斯分布，则较为准确，不会存在较大的误差。在图2h中存在一些其它干扰情况下的噪声分布，此时不做讨论。
可选地，接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果，包括：接收装置对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；接收装置根据第i层译码结果进行判决，得到第i层判决结果。如此，则得到的第i层译码结果更加准确，进而根据该第i层译码结果可更加准确的进行判决，从而得到更加准确的第i层判决结果，之后可根据该第i层判决结果，重建出更加准确的第i层的FTN重建符号，进而可更加准确、更加彻底的消除第i层至第K层FTN重建符号对第i-1层待处理符号的干扰，即更加准确的消除功率值更大层对当前层的巨大干扰。
可选地，接收装置对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果，包括：针对多次迭代中的每次迭代，执行：接收装置对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。从而使解调结果更加准确，针对每一层的最后一次迭代的译码结果进行判决，得到最终的信宿。
本发明实施例提供一种基于FTN的通信方法，包括：
发送装置对K层中的所有层的信号分别进行编码、交织和调制，得到K 层中每层的符号；其中，K为大于1的正整数；
发送装置根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波后，并行发送；其中，从第1层至第K层，每层对应的功率值依次增大。
采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
可选地，K层中每层所分配的功率值满足以下条件：系统BER小于BER阈值、第1层的功率值至第K层的功率值总和不大于总功率值阈值。如此，则可既保证了系统BER符合要求，也保证了所有层的功率值总和不超过总功率值阈值的要求，从而使整个系统的性能达到最优状态。
可选地，K层中每层所分配的功率值是通过以下方法得到的：按照从第1层至第K层的顺序，依次为K层中的每层分配功率值。如此，可更加高效且准确的为每层分配功率值。
可选地，K层中每层所分配的功率值是通过以下方法得到的：
为第1层分配第1层的功率值；其中，第1层的功率值为：满足系统BER小于BER阈值的最小功率值；
针对i大于1时，执行：
步骤A，将第i层的功率值设置为第i-1层的功率值；转入步骤B；
步骤B，将第i层的功率值以预设步长增大一次，得到更新后第i层的功率值；转入步骤C；
步骤C，在确定第1层的功率值至第i-1层的功率值、以及更新后第i层的功率值的总和不大于总功率值阈值时，转入步骤D；
步骤D，在确定系统BER小于BER阈值时，转入步骤E，否则，转入步 骤B；
步骤E，将更新后第i层的功率值确定为第i层的功率值；转入步骤F；
步骤F，在确定i小于K0时，令i加1，并转入步骤A。
可选地，还包括：在步骤C中，在确定第1层的功率值至第i-1层的功率值、以及更新后第i层的功率值的总和大于总功率值阈值时，将K的值设置为i-1。可选地，还包括：在步骤F中，在确定i不小于K0时，将K的值设置为K0。通过上述可选地方法，本发明实施例中所设置的K的值一方面可以尽量满足此次传输数据的需求，另一方面可符合系统本身的性能。
本发明实施例提供一种接收装置，包括：
接收单元，用于接收到发送装置通过K层并行发送的信号；
转换单元，用于将信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
处理单元，用于针对K层中的第i层，i大于等于1且小于等于K，执行：
从待处理符号中分离出第i层待处理符号；在确定i等于K时，将待处理符号作为第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；
对第i层待处理符号进行FTN解调，得到第i层解调后符号；
根据第i层解调后符号，进行判决，得到第i层判决结果。
可选地，处理单元，用于：在i等于1时，针对第1层生成第1层的状态转移网格图；根据第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：根据第1层期望输出符号，计算出第1层的对数似然比LLR。
可选地，处理单元，用于：在i不等于1时，针对第j层至第i层生成第i层的状态转移网格图，根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号；其中，第j层至第i-1层中的每层为 预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
可选地，处理单元，在针对第j层至第i层生成第i层的状态转移网格图时，用于：针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
可选地，处理单元，在根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：根据状态转移网格图，针对每个分支转移生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；根据第i层期望输出符号，计算出第i层的对数似然比LLR。
可选地，处理单元根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合方法项中公式要求，在此不再赘述。
可选地，处理单元，在对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果时，用于：对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；根据第i层译码结果进行判决，得到第i层判决结果。
可选地，处理单元，在对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：针对多次迭代中的每次迭代，执行：
对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN 解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
本发明实施例提供一种发送装置，包括：
处理单元，用于对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；其中，K为大于1的正整数；根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波；
发送单元，用于并行发送进行滤波后的K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
可选地，K层中每层所分配的功率值所满足的条件以及K层中每层所分配的功率值的方法可参见上述方法实施例部分的描述，在此不再赘述。
本发明实施例提供一种接收装置，包括：
接收器，用于接收到发送装置通过K层并行发送的信号；
存储器，用于存储程序和指令；
处理器，用于通过调用存储器中存储的程序和指令，执行：
将信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
针对K层中的第i层，i大于等于1且小于等于K，执行：
从待处理符号中分离出第i层待处理符号；在确定i等于K时，将待处理符号作为第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；对第i层待处理符号进行FTN解调，得到第i层解调后符号；根据第i层解调后符号，进行判决，得到第i层判决结果。
可选地，处理器，用于：在i等于1时，针对第1层生成第1层的状态转移网格图；根据第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：根据第1层期望输出符号，计算出第1层的对数似然比 LLR。
可选地，处理器，用于：在i不等于1时，针对第j层至第i层生成第i层的状态转移网格图，根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号；其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
可选地，处理器，在针对第j层至第i层生成第i层的状态转移网格图时，用于：针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
可选地，处理器，在根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：根据状态转移网格图，针对每个分支转移生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；根据第i层期望输出符号，计算出第i层的对数似然比LLR。
可选地，处理器根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则参见方法项中公式要求，在此不再赘述。
可选地，处理器，在对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果时，用于：对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；根据第i层译码结果进行判决，得到第i层判决结果。
可选地，在对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：
针对多次迭代中的每次迭代，执行：
对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
从上述内容可看出，本发明实施例中，采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
本发明实施例提供一种发送装置，包括：
存储器，用于存储程序和指令；
处理器，用于通过调用存储器中存储的程序和指令，执行：
对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；其中，K为大于1的正整数；根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波；
发送器，用于并行发送进行滤波后的K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
可选地，K层中每层所分配的功率值所满足的条件以及K层中每层所分配的功率值的方法可参见上述方法实施例部分的描述，在此不再赘述。
在本发明实施例中，接收装置接收到发送装置通过K层并行发送的信号，并将其转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；针对K层中的第i层，i大于等于1且小于等于K，执行：接收装置从待处理符号中分离出第i层待处理符号；接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号；接收装置根据第i层解调后符号，进行判决，得到第i层判决结果。采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
附图说明
为了更清楚地说明本发明实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简要介绍。
图1a为本发明实施例适用的一种系统结构示意图；
图2a为本发明实施例提供的一种发送装置侧执行的基于FTN的通信方法流程示意图；
图2b为本发明实施例提供的一种接收装置侧执行的基于FTN的通信方法流程示意图；
图2c为本发明实施例提供的另一种接收装置侧执行的基于FTN的通信方法流程示意图；
图2d为本发明实施例提供的一种发送装置和接收装置共同执行的基于FTN的通信方法示意图；
图2e为本发明实施例提供的一种针对i大于1时为每层分配功率值的方法流程示意图；
图2f为本发明实施例提供的一种状态转移网格图的结构示意图；
图2g为本发明实施例提供的一种在i不等于1时第1层至第i-1层干扰加噪声的分布图与高斯分布图的对比示意图；
图2h为本发明实施例提供的一种在i不等于1时从第1层至第i-1层干扰加噪声中去除第j层至第i-1层中每层的显著ISI抽头之后的干扰加噪声的分布图与高斯分布图的对比示意图；
图2i为本发明实施例提供的另一种状态转移网格图的结构示意图；
图2j为本发明实施例提供的一种最小相位系统转化前后的ISI对比示意图；
图2k为本发明实施例提供的一种Matlab平台仿真的BER性能结果示意图；
图3为本发明实施例提供的一种基于FTN的接收装置的结构示意图；
图4为本发明实施例提供的一种基于FTN的发送装置的结构示意图；
图5为本发明实施例提供的一种基于FTN的接收装置的结构示意图；
图6为本发明实施例提供的一种基于FTN的发送装置的结构示意图。
具体实施方式
为了使本发明的目的、技术方案及有益效果更加清楚明白，以下结合附图及实施例，对本发明进行进一步详细说明。应当理解，此处所描述的具体实施例仅仅用以解释本发明，并不用于限定本发明。
图1a示例性示出了本发明实施例适用的一种系统结构示意图，如图1a所示，该系统架构包括发送装置101和接收装置102。发送装置101可为通信系统中的网络设备或终端设备，接收装置102可为通信系统中的网络设备或终端设备。
终端设备可以经无线接入网(Radio Access Network，RAN)与一个或多个核心网进行通信，终端设备可以指用户设备(User Equipment，简称为“UE”)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，简称为“SIP”)电话、无线本地环路(Wireless Local Loop，简称为“WLL”)站、个人数字处理(Personal Digital Assistant，简称为“PDA”)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备等。
网络设备可以是用于与终端设备进行通信的设备，例如，可以是GSM系统或CDMA中的基站(Base Transceiver Station，简称为“BTS”)，也可以是WCDMA系统中的基站(NodeB，简称为“NB”)，还可以是LTE系统中的演进型基站(Evolutional Node B，简称为“eNB”或“eNodeB”)，或者该网络设备可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络侧设备或未来演进的PLMN网络中的网络设备等。
应理解，本发明实施例的技术方案可以应用于各种通信系统，例如：全球移动通讯(Global System of Mobile Communication，简称为“GSM”)系统、码分多址(Code Division Multiple Access，简称为“CDMA”)系统、宽带码分多址(Wideband Code Division Multiple Access，简称为“WCDMA”)通用分组无线业务(General Packet Radio Service，简称为“GPRS”)系统、长期演进(Long Term Evolution，简称为“LTE”)系统、LTE频分双工(Frequency Division Duplex，简称为“FDD”)系统、LTE时分双工(Time Division Duplex，简称为“TDD”)、通用移动通信系统(Universal Mobile Telecommunication System，简称为“UMTS”)、全球互联微波接入(Worldwide Interoperability for Microwave Access，简称为“WiMAX”)通信系统，以及未来的5G通信系统等。
图2a示例性示出了本发明实施例提供的一种发送装置侧执行的基于FTN的通信方法流程示意图。基于上述论述，本发明实施例提供一种发送装置侧执行的基于FTN的通信方法，如图2a所示，该方法包括：
步骤2101，发送装置对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；其中，K为大于1的正整数；
步骤2102，发送装置根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波后，并行发送；其中，从第1层至第K层，每层对应的功率值依次增大。
图2b示例性示出了本发明实施例提供的一种接收装置侧执行的基于FTN的通信方法流程示意图。基于上述论述，本发明实施例提供一种接收装置侧执行的基于FTN的通信方法，如图2b所示，该方法包括：
步骤2201，接收装置接收发送装置通过K层并行发送的信号，并将其转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
针对K层中的第i层，i大于等于1且小于等于K，执行下述步骤2202至步骤2204：
步骤2202，接收装置从待处理符号中分离出第i层待处理符号；接收装置在确定i等于K时，将待处理符号作为第i层待处理符号；接收装置在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，接收装置从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；
步骤2203，接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号；
步骤2204，接收装置根据第i层解调后符号，进行判决，得到第i层判决结果。
可选地，上述步骤2201中，接收装置接收到的信号是通过以下方式得到的：发送装置对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；发送装置根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波后得到的。
可选地，本发明实施例中，发送装置将K层中的所有符号转换为信号进行发送之后，发送装置所发送的信号会受到噪声的影响，之后才会被接收装置接收，接收装置接收到经过噪声影响的信号之后，依次对其进行匹配滤波、最小相位系统转化之后，得到待处理符号，之后，接收装置依次从该待处理符号中分离出第i层待处理符号。
图2c示例性示出了本发明实施例提供的另一种接收装置侧执行的可选地基于FTN的通信方法流程示意图，如图2c所示，本发明实施例提供一种可选地接收装置侧执行的基于FTN的通信方法包括：
步骤2301，方法开始；
步骤2302，接收装置接收发送装置通过K层并行发送的信号，并通过匹配滤波及最小相位系统转换将其转换为待处理符号xn；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
步骤2303，令i等于K，且记第i层待处理符号为
Figure PCTCN2016084816-appb-000015
步骤2304，接收装置根据第i层待处理符号迭代执行FTN解调、解交织及译码，最终经判决得到第i层判决结果；
步骤2305，判断i是否等于1，若i等于1，则执行步骤2308；若i不等于1，则执行步骤2306；
步骤2306，接收装置根据第i层判决结果，重建第i层FTN重建符号；
步骤2307，接收装置令i等于i-1；并从xn中减去第i+1层FTN重建符号至第K层FTN重建符号，得到第i层待处理符号；
步骤2308，结束该方法流程。
可见，本发明实施例中多层低阶调制等效于高阶调制，即通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下使用FTN技术进行解调，从而为进一步提高频谱效率提供了可实现性。
图2d示例性示出了本发明实施例提供的一种发送装置和接收装置共同执行的基于FTN的通信方法示意图。本发明实施例发送装置和接收装置均基于分层技术进行数据传输。
一种可选地具体实施方式为：发送装置可以通过分层技术进行并行传输，发送装置对每层数据分别进行编码，通过不同的交织器进行交织，比如图2d中所示的第K层的交织器πK交织、第K-1层的交织器πK-1交织、……、第1层的交织器π1交织等等。之后发送装置对每层交织后的数据分别进行符号调制，比如QPSK符号调制，映射成星座点，之后对各层进行功率值分配，比如图2d中所示的第K层所分配的功率值PK、第K-1层所分配的功率值PK-1、……、第1层所分配的功率值P1等等，其中，PK＞PK-1＞……＞P1；以保证接收装置对各层数据进行解调时的最佳性能。之后将功率值分配之后的K层中的所有符号通过FTN成型滤波进行滤波，并经过噪声的影响后到达接收 端。可选地，噪声可为加性高斯白噪声(Additive White Gaussian Noise，简称AWGN)。
可选地，K层中每层所分配的功率值是通过以下方法得到的：按照从第1层至第K层的顺序，依次为K层中的每层分配功率值。如此，可更加高效且准确的为每层分配功率值。
可选地，为K层中每层所分配的功率值满足以下条件：系统BER小于BER阈值、第1层的功率值至第K层的功率值总和不大于总功率值阈值。如此，则可既保证了系统BER符合要求，也保证了所有层的功率值总和不超过总功率值阈值的要求，从而使整个系统的性能达到最优状态。
可选地，K层中每层所分配的功率值是通过以下方法得到的：为第1层分配第1层的功率值；其中，第1层的功率值为：满足系统BER小于BER阈值的最小功率值。
图2e示例性示出了本发明实施例提供的一种针对i大于1时为每层分配功率值的方法流程示意图，如图2e所示，
步骤A，将第i层的功率值设置为第i-1层的功率值；转入步骤B；
步骤B，将第i层的功率值以预设步长增大一次，得到更新后第i层的功率值；转入步骤C；
步骤C，在确定第1层的功率值至第i-1层的功率值、以及更新后第i层的功率值的总和不大于总功率值阈值时，转入步骤D；可选地，在步骤C中，在确定第1层的功率值至第i-1层的功率值、以及更新后第i层的功率值的总和大于总功率值阈值时，将K的值设置为i-1；
步骤D，在确定系统BER小于BER阈值时，转入步骤E，否则，转入步骤B；
步骤E，将更新后第i层的功率值确定为第i层的功率值；转入步骤F；
步骤F，在确定i小于K0时，令i加1，并转入步骤A。可选地，在步骤F中，在确定i不小于K0时，将K的值设置为K0。
举个例子，比如将K0设置为5，先为第1层分配功率值，之后为第2层 分配功率值，若第2层分配的功率值满足条件“系统BER小于BER阈值、且第1层的功率值至第2层的功率值总和不大于总功率值阈值”，则为第3层分配功率值。一种可能的实施方式中，假设依次为第3层、第4层、第5层分配了功率值之后，则确定K的值为5，不再设置第6层的功率值。
可选地，发送装置可根据系统的速率需求确定K0的值。具体来说，发送装置可根据待需要的传输速率，计算出K0的值。举个例子，比如发送装置根据此次传输数据的实际情况，觉得设置5层即可满足此次需求，则将K0设置为5，此时，即使前5层均满足预设条件，也不再进行第6层的设置，以避免造成功率资源浪费。
另一种可能的实施方式中，假设为第3层分配了功率值，但是为第4层分配功率值时，第1层至第4层的功率值总和大于功率值阈值，则此时令K的值为3。即此时，K的值不能再大了，否则会超过预设功率值阈值，即超过发送装置本身的能力，从而造成数据发送失败等结果。
通过上述可选地方法，本发明实施例中所设置的K的值一方面可以尽量满足此次传输数据的需求，另一方面可符合系统本身的性能。
具体实施中，层数越多，即K的值越大，则发送装置所需的发送功率值越大，而实际发送装置的最大发送功率值是受总功率值阈值限制的，即发送装置发送的各层数据的发送功率值总和不能大于总功率值阈值。因此，采用上述方法，既保证了系统BER符合要求，也保证了所有层的功率值总和不超过总功率值阈值的要求。
再举一个例子，用于详细说明上述为每一层分配功率值的方法流程，BER阈值为10-6，K0为5：
第一步，此时i为1，先设置第1层的功率值，第1层的功率值为：满足系统BER小于BER阈值的最小功率值；也就是说，满足系统BER小于BER阈值的功率值有很多，第1层的功率值取该范围内的最小值。即在最小功率值需求时系统的BER(此时系统仅有一层)小于BER阈值，比如为5dBm，
第二步，此时i为2，将第2层的功率值设置为第1层的功率值5dBm， 将第2层的功率值从5dBm以预设步长逐次增大，比如预设步长为0.5dB，则第一次增大后得到的更新后第2层的功率值为5.5dBm，在确定第1层的功率值和第2层的功率值之和不大于总功率值阈值时，且进一步确定更新后的第2层的功率值5.5dBm时的系统BER(此时系统有两层)不小于BER阈值时，将第2层的功率值再次增加预设步长，即此时更新后的第2层的功率值为6dBm，假如此时第1层的功率值和更新后的第2层的功率值之和不大于总功率值阈值，且进一步确定更新后的第2层的功率值6dBm对应的系统BER小于BER阈值，则确定第2层的功率值为6dBm。
第三步，此时i为3，将第3层的功率值设置为第2层的功率值6dBm，将第3层的功率值6dBm以预设步长逐次增大，则第一次增大后为6.5dBm，假如此时判断出第1层的功率值5dBm、第二层的功率值6dBm和更新后的第3层的功率值6.5dBm的和大于总功率值阈值，则确定K为2，即发送装置确定的最大层数为2。
另一种可能的实施方式中，假设在第三步中，判断出第1层的功率值5dBm、第二层的功率值6dBm和更新后的第3层的功率值6.5dBm的和不大于总功率值阈值，且更新后的第3层的功率值6.5dBm时的系统BER(此时系统有三层)小于BER阈值，则确定第3层的功率值为6.5dBm；假设之后依据上述类似方法还依次成功分配了第4层的功率值7dBm，以及第5层的功率值7.5dBm。此时，由于之前预设K0为5，因此，此时确定K的值为5，不再配置第6层。
基于上述描述，发送装置将K层中的所有符号通过FTN成型滤波进行滤波，得到一个待发送的信号，之后该信号进行发送，该信号通过噪声的影响后达到接收装置。可选地，噪声可为加性高斯白噪声(Additive White Gaussian Noise，简称AWGN)。可选地，接收装置通过基于正交基模型(Orthogonal Basis Model，简称OBM)的匹配滤波和最小相位系统转化将接收到的信号转化为待处理符号，进一步对待处理符号进行处理。
具体实施中，FTN技术具体为在不改变单个符号波形即维持信号带宽的前提下，在时域上通过压缩符号周期实现更高的符号速率。从另一个角度上 讲，FTN相当于在符号周期不变的前提下，在频域上通过压缩信号带宽以节省频率资源。总之，采用FTN技术达到了提高频谱效率的目的，有助于减轻日益突出的频谱资源危机。发送装置发送的信号经过噪声、FTN成型滤波器处理，接收装置通过OBM匹配滤波处理，可保持各采样符号的噪声相互独立。进一步，由于FTN压缩了符号带宽，因此最佳采样点都会受到其它符号的干扰，从而出现ISI并导致波形失真，因此可添加一个全通滤波器将整体响应进行最小相位转化，此时，第一，全通滤波器不会改变信号和噪声的功率值谱分布，因此得到待处理符号中的噪声仍能保持符号间的相互独立性；第二，在所有具有相同幅频特性的系统中，最小相位系统将能量较大的抽头集中在更短的时延区间内，从而可以减小FTN解调的复杂度。
接收装置经匹配滤波及最小相位系统转化将接收到的信号转成待处理符号之后，需要从待处理符号中得到发送装置所发送的数据，即接收装置需要进行FTN解调、解交织及译码，可选地，FTN解调结果可能是硬判决信息或软判决信息，在有编译码时一般要求得到软判决结果。
可选地，接收装置依据每层对应的功率值的大小，依次分离出第K层待处理符号至第1层待处理符号。可选地，接收装置将接收到的信号转换为待处理符号之后，接收装置从待处理符号中分离出第i层待处理符号，包括：接收装置在确定i等于K时，将待处理符号作为第i层待处理符号；接收装置在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号；接收装置从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号。如此，可针对每一层，先去除比该层的功率值大的层的FTN重建符号，从而去除了比该层的功率值大的层对该层造成的干扰。
具体来说，接收装置得到待处理符号之后，由于第K层为功率值最大层，因此接收装置可直接将待处理符号作为作为第K层待处理符号，之后对第K层待处理符号通过迭代结构进行FTN解调、解交织、译码，并进行判决，输出判决结果。
进一步，可根据第K层判决结果，进行第K层FTN重建符号的重建，得到第K层FTN重建符号。可选地，判决结果为硬信息，如此，根据硬判决信息重建出的第K层FTN重建符号更加准确。
之后，解调第K-1层待处理符号时，从转换后的待处理符号中减去第K层FTN重建符号，将得到的信息作为第K-1层待处理符号，并对其通过迭代结构进行解调、解交织、译码和判决，得到第K-1层判决结果。可见，此时，针对第K-1层待处理符号，已经不包括第K层FTN重建符号，且仅仅只有第K层的功率值大于第K-1层的功率值，即此时已经消除了功率值更大层对第K-1层待处理符号的干扰。
进一步，可根据第K-1层判决结果，进行第K-1层FTN重建符号的重建，得到第K-1层FTN重建符号；之后从待处理符号中减去第K层FTN重建符号和第K-1层FTN重建符号，将得到的信息作为第K-2层待处理符号，并对其通过迭代结构进行解调、解交织、译码和判决，得到第K-2层判决结果。可见，此时，针对第K-2层待处理符号，由于已经不包括第K层FTN重建符号和第K-1层FTN重建符号，且仅仅只有第K层和第K-1层的功率值大于第K-2层的功率值，即此时已经消除了功率值更大层对第K-2层待处理符号的干扰。
具体来说，针对第1层，由于没有功率更小层需要执行FTN解调，此时无需进行第1层FTN符号的重建。
本发明实施例中，针对其余层中的每一层，消除比当前层的功率值大的层的干扰的方法与上述类似，不再赘述，应用上述方法可得到所有层的判决结果，进而估计得到发送装置所发送的数据。
上述过程中，可选地，接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果，包括：
接收装置对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；接收装置根据第i层译码 结果进行判决，得到第i层判决结果
也就是说，针对每一层，本发明实施例中均采用多次迭代的方法得到得到第i层译码结果，如此，则得到的第i层译码结果更加准确，进而根据该第i层译码结果可更加准确的进行判决，从而得到更加准确的第i层判决结果，之后可根据该第i层判决结果，重建出更加准确的第i层的FTN重建符号，进而可更加准确、更加彻底的消除第i层至第K层FTN重建符号对第i-1层待处理符号的干扰，即更加准确的消除功率值更大层对当前层的巨大干扰。
可选地，接收装置对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果，包括：
针对多次迭代中的每次迭代，执行：
接收装置对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息，进而执行下一次迭代中的FTN解调、解交织和译码。
具体来说，本发明实施例中，在第i层，将FTN引入的ISI看作内部编码，将信道编码看作外部编码，并采用涡轮(Turbo)迭代结构进行处理，即将每次译码反馈的软信息作为FTN解调的先验信息，如此，经过多次迭代之后，可得到更加准确的译码结果。可选地，每一层的FTN解调均按IQ两路分开执行。
可选地，由于发送装置通过不同的交织器进行交织，比如图2d中所示的第K层的交织器πK交织、第K-1层的交织器πK-1交织、……、第1层的交织器π1交织等等。接收装置则也通过相应的解交织器进行解交织和并在迭代反馈过程中再次交织。比如图2d中所示的，针对第K层使用解交织器
Figure PCTCN2016084816-appb-000016
进行解交织并在迭代反馈过程中使用交织器πK交织、针对第K-1层使用解交织器
Figure PCTCN2016084816-appb-000017
进行解交织并在迭代反馈过程中使用交织器πK-1交织、……、针对第1层使用解交织器
Figure PCTCN2016084816-appb-000018
进行解交织并在迭代反馈过程中使用交织器π1交织。
可见，本发明实施例中，接收装置中各层通过迭代环路实现信号解调， 针对功率值更大层的最后一次迭代后的译码结果进行判决并重建FTN信号，并据此从待处理符号中分离出每层待处理符号，从而实现层间干扰消除。之后，各层分别执行FTN解调、解交织以及译码。可选地，译码输出软判决信息，并再次进行交织后，反馈到下一次迭代的FTN解调之中，从而使解调结果更加准确，针对每一层的最后一次迭代的译码结果进行判决，得到最终的信宿。
可选地，针对各层分别执行FTN解调时可使用可采用巴尔-科克-耶里內克-拉维夫(Bahl,Cocke,Jelinek,and Raviv，简称BCJR)算法等进行FTN解调，在解调过程中首先生成状态转移网格图，之后基于状态转移网格图计算对数似然比(Log-Likelihood Ratio，简称LLR)。
针对第1层的FTN解调，由于从待处理符号中减去第2层至第K层的FTN重建符号后，第1层已不受其它层的干扰，因此可采用常规的FTN解调，即不带干扰的FTN解调。但是，针对第K层至第2层中的每一层，虽然均已消除了功率值更大层的对该层的干扰，但是该层中还存在比该层的功率值更小层的干扰，因此针对第K层至第2层的FTN解调可采用本发明实施例中提供的考虑干扰的FTN解调。
可选地，不带干扰的FTN解调具体为：在i等于1时，接收装置对第1层待处理符号进行FTN解调，可选地，可采用BCJR算法，该算法包括：
接收装置针对第1层生成第1层的状态转移网格图；
接收装置根据第1层的状态转移网格图，可选地，针对多个分支转移生成第1层期望输出符号；可选地，第1层期望输出符号包括：第1层的期望符号与该层对应的功率值因子相乘得到的符号；
接收装置根据第1层期望输出符号，计算出第1层数据的LLR。
接收装置根据第1层的状态转移网格图，生成第1层期望输出符号时的生成规则符合下述公式要求：
Figure PCTCN2016084816-appb-000019
在公式(1)中，P1为第1层符号对应的功率值；
Figure PCTCN2016084816-appb-000020
为第1层符号对应的功率值因子；
L为预设的第i层的ISI抽头的长度；其中，i此时取值为1；
fl为ISI抽头系数；
Figure PCTCN2016084816-appb-000021
为与状态转移网格图对应的第一层数据；
n为数据标号。
具体实施中，用于FTN解调的算法属于解卷积的一个算法，抽头为一个卷积过程中的卷积响应系数，抽头可以是滤波器系数，也可以是线性均衡系数，也可以是码间串扰系数，这里的ISI抽头即指码间串扰系数。
具体来说，以发送装置发送的第一层的数据为
Figure PCTCN2016084816-appb-000022
接收装置从待处理符号中分离出的第1层待处理符号为
Figure PCTCN2016084816-appb-000023
为例进行说明。接收装置进行FTN解调是从
Figure PCTCN2016084816-appb-000024
中得到
Figure PCTCN2016084816-appb-000025
即是一个解卷积的过程，而BCJR算法是解卷积的经典算法，因此也成为FTN解调的可靠方案。
ISI的存在使得每个期望输出符号不仅仅与当前输入符号相关，还与前面若干符号相关，而这前面若干符号的取值即为一个状态。设当前输入符号为发送装置发送的第一层的数据
Figure PCTCN2016084816-appb-000026
ISI长度为L，那么期望输出符号与
Figure PCTCN2016084816-appb-000027
和当前状态
Figure PCTCN2016084816-appb-000028
相关，而下一状态将变为
Figure PCTCN2016084816-appb-000029
如果每个符号的取值种类数为M，即IQ两路单路符号的取值种类数为
Figure PCTCN2016084816-appb-000030
那么单路状态种类数为M(L-1)/2，由当前状态转移到下一状态共有
Figure PCTCN2016084816-appb-000031
个分支，即总分支转移情况数为ML/2。BCJR算法就是以状态转移网格图为基础进行设计。图2f示例性示出了本发明实施例提供的一种状态转移网格图，如图2f所示，为以L＝3，M＝4为例给出相应的网格图，其中“+”与“-”分别代表1和-1，它们对应的二进制比特分别为0和1，记初始状态和结束状态都是“++”。
BCJR算法需要得到每个比特的软信息，通常为LLR，这需要通过分支转移概率，前向状态概率，后向状态概率进行计算。下面通过第一计算量、第 二计算量、第三计算量和第四计算量对这些计算量进行解释。
第一计算量：分支转移概率
分支转移概率用于描述了从一个状态转移到另一个状态的概率。设第n个输入符号使状态从
Figure PCTCN2016084816-appb-000032
转移到
Figure PCTCN2016084816-appb-000033
如果没有噪声，对应的期望输出符号为公式(1)中的
Figure PCTCN2016084816-appb-000034
由于噪声的存在，实际接收符号
Figure PCTCN2016084816-appb-000035
与
Figure PCTCN2016084816-appb-000036
存在一定差距，并据此可以根据公式(2)计算得到由
Figure PCTCN2016084816-appb-000037
转移到
Figure PCTCN2016084816-appb-000038
的分支转移概率可根据公式(2):
Figure PCTCN2016084816-appb-000039
在公式(2)中：
Figure PCTCN2016084816-appb-000040
为第1层待处理符号为
Figure PCTCN2016084816-appb-000041
时对应于从状态
Figure PCTCN2016084816-appb-000042
转移到
Figure PCTCN2016084816-appb-000043
的分支转移概率；
Figure PCTCN2016084816-appb-000044
为第1层的第n个符号取值为
Figure PCTCN2016084816-appb-000045
的先验概率，其由上一次迭代的译码软信息输出通过交织器π1后再计算得到，对于首次迭代，
Figure PCTCN2016084816-appb-000046
取值为1/2；
N为单路噪声功率值；π为圆周率常数；
Figure PCTCN2016084816-appb-000047
为公式(1)中第1层的期望输出符号；
Figure PCTCN2016084816-appb-000048
为第1层待处理符号；
在公式(2)中，s′有M(L-1)/2种可能的取值，而每种取值对应
Figure PCTCN2016084816-appb-000049
种转移情况，因此网格图的每一级需计算ML/2个分支转移概率(除了初始和结尾之外)。
第二计算量：前向状态概率
前向状态概率描述了从前向后递归计算每一级即每个符号采样点时刻处在每种状态的概率，可以表述为公式(3)：
Figure PCTCN2016084816-appb-000050
在公式(3)中：
αn(s)和
Figure PCTCN2016084816-appb-000051
为从前向后递归计算的在时刻n处在状态s的前向状态概率；
Figure PCTCN2016084816-appb-000052
为公式(2)中
Figure PCTCN2016084816-appb-000053
对应于从
Figure PCTCN2016084816-appb-000054
转移到
Figure PCTCN2016084816-appb-000055
的分支转移概率；
αn-1(s′)为从前向后递归计算的在时刻n-1处在状态s′的前向状态概率；s′的取值集合可为所有可以跳转到s的状态集合。
第三计算量：后向状态概率
后向状态概率描述了从后向前递归计算每一级即每个符号采样点时刻处在每种状态的概率，可以表述为公式(4)：
Figure PCTCN2016084816-appb-000056
在公式(4)中：
βn(s)和
Figure PCTCN2016084816-appb-000057
为从后向前递归计算的在时刻n处在状态s的后向状态概率；
Figure PCTCN2016084816-appb-000058
为符号
Figure PCTCN2016084816-appb-000059
对应于
Figure PCTCN2016084816-appb-000060
转移到
Figure PCTCN2016084816-appb-000061
的分支转移概率；其中，
Figure PCTCN2016084816-appb-000062
βn+1(s')为从后向前递归计算的在时刻n+1处在状态s′的后向状态概率；
s′的取值集合可为所有可以从s状态跳转过去的集合。
第四计算量：LLR
LLR可由公式(5)表示：
Figure PCTCN2016084816-appb-000063
在公式(5)中，[s′1,s1]的取值集合为s′1→s1状态转移时对应的当前比特为1 的所有状态组合，而[s′0,s0]的取值集合为s′0→s0状态转移时对应的当前比特为0的所有状态组合；其中，s′1→s1表示从状态s′1转移至状态s1；s′0→s0表示从状态s′0转移至状态s0；
βn(s1)为从后向前递归计算的在时刻n处在状态s1的后向状态概率；
βn(s0)为从后向前递归计算的在时刻n处在状态s0的后向状态概率；
αn-1(s′1)为从前向后递归计算的在时刻n-1处在状态s′1的前向状态概率；
αn-1(s′0)为从前向后递归计算的在时刻n-1处在状态s′0的前向状态概率；
Figure PCTCN2016084816-appb-000064
为
Figure PCTCN2016084816-appb-000065
对应于从s′1转移到s1的分支转移概率；
Figure PCTCN2016084816-appb-000066
为
Figure PCTCN2016084816-appb-000067
对应于从s′0转移到s0的分支转移概率。
可选地，为了进一步降低FTN解调的复杂度，可使用M-BCJR算法进行FTN解调，具体为，对每一级选择出若干概率较大的状态进行递归计算，而不是对所有状态都计算分支转移概率、前向状态概率、后向状态概率，对未选中的状态将相应概率置为0。
图2g示例性示出了本发明实施例提供的一种在i不等于1时第1层至第i-1层干扰加噪声的分布图与高斯分布图的对比示意图，从图2g中可看出，i不等于1时，干扰+噪声的分布2301与高斯分布2302有较大差异，+表示加的意思，因此，若对在i不等于1时对第i层执行不考虑干扰的FTN解调，即将干扰加噪声看做高斯分布图，存在较大误差，则会对分支转移概率计算带来较大的误差。在这种情况下，为了降低在i不等于1时的干扰的影响，只能加大层间功率值差异，这也必然导致更大的功率值开销和更差的性能。在图2g中存在一些其它干扰情况下的噪声分布，此时不做讨论。
可选地，考虑干扰的FTN解调具体为：在i不等于1时，接收装置对第i层待处理符号进行FTN解调，得到第i层解调后符号，包括：
接收装置针对第j层至第i层生成第i层的状态转移网格图，接收装置根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调；其中，第j层至i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j 大于等于1且小于等于i-1。
可选地，接收装置针对第j层至第i层生成第i层的状态转移网格图，包括：接收装置针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
具体说来，在j大于等于1且小于等于i-1时，第j层包括一个或多个ISI抽头，这些ISI抽头分为两类，显著ISI抽头或者非ISI显著抽头。其中，第j层的显著ISI抽头是指第j层的所有ISI抽头中能量大于第i层对应的能量阈值的ISI抽头；第j层的非显著ISI抽头是指第j层的所有ISI抽头中能量不大于第i层对应的能量阈值的ISI抽头。可选地，K层中任意两层所对应的能量阈值不同。
举例来说，比如第5层的功率值为20dBm，此时，第5层对应的能量阈值为2dBm，也就是说，除了第5层的ISI抽头会对第5层的符号造成较为严重的干扰之外，在第1层至第4层中的能量在2dBm以上的显著ISI抽头均会对第5层符号造成严重干扰，此时，能量在2dBm以上的显著ISI抽头对第5层符号造成的干扰不能近似为高斯噪声，因此，需要将能量在2dBm以上的显著ISI抽头也在状态转移网格图中进行考虑，以便更好的处理能量在2dBm以上的显著ISI抽头给第5层符号所带来的干扰。假定只有第3、4层才存在能量在2dBm以上的显著ISI抽头，那么相应的j设置成3。可选地，能量可等效为功率值，能量阈值可等效为功率值阈值。每一层的功率值不同，因此每一层对应的能量阈值也不同。
可选地，接收装置基于状态转移网格图，对第i层待处理符号采用考虑干扰的BCJR算法进行FTN解调，包括：
接收装置根据状态转移网格图，生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与各层对应的功率值因子相乘得到的符号之和；接收装置根据第i层期望输出符号，计算出第i层的对数似然比LLR。
可选地，本发明实施例中，将第j层至第i-1层中每层的显著ISI抽头在状态转移中进行考虑，之后将剩余的第j层至第i-1层的非显著ISI抽头、第1层至第j-1层的ISI抽头，以及噪声看做高斯噪声进行处理，图2h示例性示出了本发明实施例提供的一种在i不等于1时从第1层至第i-1层干扰加噪声中去除第j层至第i-1层中每层的显著ISI抽头之后的干扰加噪声的分布图与高斯分布图的对比示意图，从图2h中可看出，去除第j层至第i-1层中每层的显著ISI抽头之后的干扰+噪声的分布2401与高斯分布2402较为接近，其中，+表示加的意思，即对在i不等于1时对第i层进行考虑干扰的FTN解调，即将第j层至第i-1层中每层的显著ISI抽头纳入状态转移网格图中考虑，之后将其余干扰加噪声看做高斯分布，则较为准确，不会存在较大的误差。在图2h中存在一些其它干扰情况下的噪声分布，此时不做讨论。
举个例子，比如K为5，根据干扰能量阈值预设最大干扰层为2层；此时，对第5层待处理符号进行FTN解调时，需要针对第3层至第5层所生成的状态转移网格图进行FTN解调，也就是说，预设的第4层待处理符号和第3层待处理符号对第5层待处理符号的干扰最强，干扰程度大于干扰阈值，而第2层待处理符号和第1层待处理符号对第5层的影响较弱，可将第1层所有ISI抽头、第2层的所有ISI抽头、第3层的非显著ISI抽头，以及第4层的非显著ISI抽头对第5层的干扰加噪声作为高斯噪声进行处理，即此时i为5时，预设的j为3。对第4层待处理符号进行FTN解调时，因为第4层待处理符号中已经去除了第5层FTN重建符号，因此仅仅此时需要针对第4层的ISI抽头，以及第2层至第3层中每层的显著ISI抽头所生成的状态转移网格图进行FTN解调，也就是说，预设的第2层和第3层对第4层待处理符号的干扰最强，干扰程度大于干扰阈值，而第1层待处理符号对第4层的影响较弱，可将第1层的所有ISI抽头、第2层的非显著ISI抽头，以及第3层的非显著ISI抽头对第4层的干扰加噪声作为高斯噪声进行处理，即此时i为4时，预设的j为2。
进一步，可选地，在上述示例中，对第5层待处理符号进行FTN解调时， 针对第5层中的ISI抽头，以及第3层至第4层中每层的显著ISI抽头生成的状态转移网格图进行FTN解调，也就是说，除了考虑第5层中的ISI抽头之外，还需考虑在干扰程度大于干扰阈值的层中，选出对第5层干扰较为严重的几个显著ISI抽头进行考虑，将第3层至第4层中除显著ISI抽头之外的ISI抽头以及第1层至第2层的每层的ISI抽头均看做高斯噪声进行处理。
可选地，接收装置根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合下述公式要求：
Figure PCTCN2016084816-appb-000068
在公式(6)中，Pi为第i层符号对应的功率值；Pi-1为第i-1层符号对应的功率值；Pi-m为第i-m层符号对应的功率值；Pj为第j层符号对应的功率值；
Figure PCTCN2016084816-appb-000069
为第i层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000070
为第i-1层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000071
为第i-m层符号对应的功率值因子；
Figure PCTCN2016084816-appb-000072
为第j层符号对应的功率值因子；
L为预设的第i层的ISI抽头的长度；L1为预设的第i-1层的显著ISI抽头的长度；Lm为预设的第i-m层的显著ISI抽头的长度；Li-j为预设的第j层的显著ISI抽头的长度；
Figure PCTCN2016084816-appb-000073
为第i层的符号分量；
Figure PCTCN2016084816-appb-000074
为第i-1层考虑显著ISI抽头下的符号分量；
Figure PCTCN2016084816-appb-000075
为第i-m层考虑显著ISI抽头下的符号分量；
Figure PCTCN2016084816-appb-000076
为第j层考虑显著ISI抽头下的符号分量；
m为整数，m取遍[1,i-j]中的每一个整数；
fl为ISI抽头系数
Figure PCTCN2016084816-appb-000077
为与状态转移网格图对应的第i层数据；
Figure PCTCN2016084816-appb-000078
为与状态转移网格图对应的第i-1层数据；
Figure PCTCN2016084816-appb-000079
为与状态转移网格图对应的第i-m层数据；
Figure PCTCN2016084816-appb-000080
为与状态转移网格图对应的第j层数据；
n为数据标号。
具体实施中，使第i层待处理符号中的干扰加噪声分布远离高斯分布的通常是最强的少数干扰抽头，因此在状态转移中仅需考虑干扰程度超过干扰阈值的干扰层的少数显著ISI抽头。图2i示例性示出了本发明实施例提供的另一种状态转移网格图的结构示意图，如图2i所示，设当前层考虑的ISI长度为L，干扰程度超过干扰阈值的干扰层(即第j层至第i-1层，这里假设j＝i-1，则所考虑的干扰层仅为第i-1层)考虑的ISI长度为L1，用
Figure PCTCN2016084816-appb-000081
及
Figure PCTCN2016084816-appb-000082
分别代表当前层和所考虑干扰层的符号，则一次状态转移过程可以记为
Figure PCTCN2016084816-appb-000083
在QPSK调制下，IQ两路单路的状态数目为
Figure PCTCN2016084816-appb-000084
每个状态转移到下一个状态的分支数为4(注：
Figure PCTCN2016084816-appb-000085
及
Figure PCTCN2016084816-appb-000086
均可取值为1或-1)，在图2i中，以L＝3，L1＝2为例。
具体来说，以发送装置发送的数据为
Figure PCTCN2016084816-appb-000087
接收装置从待处理符号xn中分离出的第i层待处理符号为
Figure PCTCN2016084816-appb-000088
为例进行说明。基于图2i所示的网格图，计算分支转移概率时也需将干扰程度超过干扰阈值的干扰层的显著干扰抽头考虑进去。以第i层举例，对于第i层FTN解调，设干扰程度超过干扰阈值的干扰层仅为第i-1层，第n个输入符号使状态从
Figure PCTCN2016084816-appb-000089
转移到
Figure PCTCN2016084816-appb-000090
不考虑噪声及其它干扰，对应的期望输出符号为根据公式(6)计算得到的
Figure PCTCN2016084816-appb-000091
由于噪声和其它干扰的存在，实际接收到的第i层待处理符号
Figure PCTCN2016084816-appb-000092
与
Figure PCTCN2016084816-appb-000093
存在一定差距，并据此可以计算得到由
Figure PCTCN2016084816-appb-000094
转移到
Figure PCTCN2016084816-appb-000095
的分支转移概率可根据公式(7)计算得到：
Figure PCTCN2016084816-appb-000096
在公式(7)中，
Figure PCTCN2016084816-appb-000097
为
Figure PCTCN2016084816-appb-000098
使从
Figure PCTCN2016084816-appb-000099
转移到
Figure PCTCN2016084816-appb-000100
的分支转移概率；
Figure PCTCN2016084816-appb-000101
为第i层的第n个符号取值为
Figure PCTCN2016084816-appb-000102
的先验概率，其由上一次迭代的译码软信息输出通过交织器πi后再计算得到，对于首次迭代，
Figure PCTCN2016084816-appb-000103
取值为1/2；
N代表单路噪声及其它未在状态转移过程中考虑的干扰的功率值之和，由于这部分不包含能量较大的干扰抽头，其分布特性与高斯分布比较接近；
π为圆周率常数；
Figure PCTCN2016084816-appb-000104
为根据公式(6)计算得到的第i层期望输出符号；
Figure PCTCN2016084816-appb-000105
为第i层待处理符号。
之后，应用上述公式(3)、公式(4)和公式(5)分别计算前向状态概率、后向状态概率及比特LLR。此时，根据公式(3)、公式(4)和公式(5)分别计算时，需要将
Figure PCTCN2016084816-appb-000106
代入进行计算；其次，需要将公式(3)、公式(4)和公式(5)中状态进行更改，即
Figure PCTCN2016084816-appb-000107
转移到
Figure PCTCN2016084816-appb-000108
可选地，在具体实施中，除了BCJR算法之外，维特比等算法也可用于解卷积，其也是基于状态转移网格图执行，本发明考虑干扰的FTN解调方法也可采用这类方法。也就是说，本发明实施例中在i不等于1时，接收装置针对第j层至第i层的符号所生成的状态转移网格图，对第i层待处理符号进行FTN解调的具体算法有多种，可为BCJR算法，也可为其它比如维特比等解卷积算法。
通过本发明实施例提供的上述方法，以及基于图2i所示的网格图，可分析出：对于传统的MQAM调制，在本发明实施例中对应的层数为log4M(考虑每层为QPSK调制)。每一层采用IQ两路分别作FTN解调，同样假定干扰程度超过干扰阈值的干扰层仅为最强干扰层，对于第K层至第2层，L为当 前层的ISI长度，L1为最强干扰层的显著ISI抽头的长度；此时单路状态数为
Figure PCTCN2016084816-appb-000109
分支转移种类数为
Figure PCTCN2016084816-appb-000110
对于第1层，单路状态数为2L-1，分支转移情况数为2L。如此，总状态数为
Figure PCTCN2016084816-appb-000111
分支转移情况数为
Figure PCTCN2016084816-appb-000112
其关于调制进制数成对数关系。以L＝10，L1＝5为例，表2给出了不同调制方式下多层结构的状态数及分支转移情况数的具体数值(这里也只考虑了单次迭代)。
表2不同调制方式下多层结构的状态数及分支转移情况数
Figure PCTCN2016084816-appb-000113
可见，相对于背景技术中表1所示的状态数及分支转移情况数，数值大大减少，即本发明实施例相对于采用高阶QAM调制直接作基于BCJR算法的FTN解调，复杂度可以得到大幅度降低。不仅如此，在实际操作时，可以采用M-BCJR算法的思路，选择出少数概率较大的状态进行计算，这样状态数及分支转移种类数将远小于表2中的结果。
为了进一步说明本发明实施例所提供的上述方法以及有益效果，下面举一个具体示例用于说明。主要条件包括：(1)FTN压缩比为4/7，采用根升余弦(Root-Raised Consine，简称RRC)成型滤波器的滚降系数为0.2；(2)要求实现16384QAM调制的频谱效率；(3)编码方式为码率为0.8的低密度奇偶校验码(Low Density Parity Check Code，简称LDPC)码。
图2j示例性示出了本发明实施例提供的一种最小相位系统转化前后的ISI 对比示意图，如图2j所示，在进行最小相位系统转化之前，FTN产生的ISI以n＝0为中心成对称分布；进行最小相位系统转化之后，ISI相对更加集中，n<-6时的ISI可以忽略不计。由于最小相位系统转化是全通滤波过程，因此这两个ISI对应的频域幅度谱相同。
在实施过程中，对于FTN解调的当前层，从图2j中n＝-6开始，考虑的ISI长度为10，即为[0.2782 0.7162 0.5489-0.1054-0.2435 0.0996 0.1100-0.0973-0.0417 0.0555]；除第一层之外的其它各层考虑最强干扰层(这里假定j＝i-1)的显著ISI抽头的长度，取为上述前5个抽头系数。
为了取得16384QAM调制相同的频谱效率，在压缩比为4/7时对应4层。第2层至第4层单路解调时共涉及213＝8192个状态和215＝32768种分支转移，第1层共涉及29＝512个状态和210＝1024种分支转移；在状态转移网格图中，每一级仅保留概率最大的128个状态，如此第2至第4层的单路只涉及512种分支转移，而第1层的单路只涉及256种分支转移。
在发送装置侧，预先设置目标BER为10-6，按本发明实施例上述内容中提供的一种可选地发送装置分配功率值方法进行功率值分配，假定最大信号功率值允许4层传输，可以得到层间功率值差异。以第1层的功率值为基准，第2-4层的功率值将需要依次增加8.9141dB、9.0781dB、8.9297dB。在BER性能测试过程中，对于不同Eb/N0(其中，Eb代表平均到每个比特上的信号能量，N0代表噪声的功率值谱密度)的情况，都需保证层间功率值差异不变。
图2k示例性示出了本发明实施例提供的一种Matlab平台仿真的BER性能结果示意图，如图2k所示，与不采用FTN的16384QAM调制相比，本发明实施例中每一层解调都需多次迭代，其中迭代次数设置为10，可见，本发明实施例所得到的BER性能更优。
从图2k中可以发现，相对于传统的16384QAM调制，本发明实施例在BER为10-6时可以取得0.5dB性能增益。除了直接的Eb/N0性能增益之外，本发明实施例采用的4层结构对应于256QAM调制，并且可以接受更小的功率值放大器(Power Amplifier，简称PA)功率值回退，可以取得额外的3-5dB 系统增益，因此总增益为3.5-5.5dB。
基于上述论述，可看出，本发明实施例中不会对FTN压缩比产生限制，允许对信号带宽进行充分压缩以提高频谱效率；且通过分层传输架构，解决了FTN难以用于高阶调制的难题，便于在具备高阶调制频谱效率的基础上应用FTN；有效实现了层间干扰消除，保证了BER性能要求。对于每一层解调，将功率值更大层信号重建反馈，干扰消除彻底；在状态转移关系中考虑功率值更小层的显著ISI抽头，降低了干扰对FTN解调的影响；相对于相同频谱效率下的高阶QAM调制，降低了对PA功率值回退的要求，进一步提高了系统增益。
可选地，本发明实施例中主要针对AWGN信道进行描述，其也可以用于多径信道环境之下，只需在进入多层FTN解调之前先执行信道均衡，以去除信道多径的影响即可。其次，可选地，本发明实施例以白噪声为例进行阐述，当匹配滤波器与发送装置成型滤波器严格匹配即采用Ungerboeck匹配滤波时，噪声将是相关的，如果将BCJR算法改进至色噪声环境下实现，本发明实施例也可以继续用于这种情况的FTN解调。第三，本发明实施例中考虑干扰的FTN解调方法除了用于多层FTN解调之外，也可以用于其它在有干扰及ISI环境下的信号解调，或者在有干扰下的卷积码译码。
从上述内容可看出，在本发明实施例中，采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
图3示例性示出了本发明实施例提供的一种接收装置的结构示意图。
基于相同构思，本发明实施例提供一种接收装置，用于执行上述方法流程，如图3所示，接收装置300包括接收单元301、转换单元302和处理单元 303：
接收单元，用于接收到发送装置通过K层并行发送的信号；
转换单元，用于将信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
处理单元，用于针对K层中的第i层，i大于等于1且小于等于K，执行：
从待处理符号中分离出第i层待处理符号；在确定i等于K时，将待处理符号作为第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；
对第i层待处理符号进行FTN解调，得到第i层解调后符号；
根据第i层解调后符号，进行判决，得到第i层判决结果。
可选地，处理单元，用于：在i等于1时，针对第1层生成第1层的状态转移网格图；根据第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：根据第1层期望输出符号，计算出第1层的对数似然比LLR。
可选地，处理单元，用于：在i不等于1时，针对第j层至第i层生成第i层的状态转移网格图，根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号；其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
可选地，处理单元，在针对第j层至第i层生成第i层的状态转移网格图时，用于：针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
可选地，处理单元，在根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：根据状态转移网格图， 针对每个分支转移生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；根据第i层期望输出符号，计算出第i层的对数似然比LLR。
可选地，处理单元根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合上述方法项实施例中公式(6)要求。
可选地，处理单元，在对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果时，用于：对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；根据第i层译码结果进行判决，得到第i层判决结果。
可选地，处理单元，在对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：针对多次迭代中的每次迭代，执行：
对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
从上述内容可以看出：采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
图4示例性示出了本发明实施例提供的一种发送装置的结构示意图。
基于相同构思，本发明实施例提供一种发送装置，用于执行上述方法流程，如图4所示，发送装置400包括处理单元401和发送单元402：
处理单元，用于对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；其中，K为大于1的正整数；根据K层中每层分配 的功率值，将K层中的所有符号通过FTN成型滤波进行滤波；
发送单元，用于并行发送进行滤波后的K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
可选地，K层中每层所分配的功率值所满足的条件以及K层中每层所分配的功率值的方法可参见上述方法实施例部分的描述，在此不再赘述。
从上述内容可以看出：采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
图5示例性示出了本发明实施例提供的一种接收装置的结果示意图。
基于相同构思，本发明实施例提供一种接收装置，用于执行上述方法流程，接收装置500包括处理器501、接收器502、存储器503：
接收器，用于接收到发送装置通过K层并行发送的信号；
存储器，用于存储程序和指令；
处理器，用于通过调用存储器中存储的程序和指令，执行：
将信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
针对K层中的第i层，i大于等于1且小于等于K，执行：
从待处理符号中分离出第i层待处理符号；在确定i等于K时，将待处理符号作为第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从待处理符号中去除获取的第i+1层FTN重建符号至第K层的FTN重建符号，得到第i层待处理符号；对第i层待处理符号进行FTN解调，得到第i层解调后符号；根据第i层解调后符号，进行判决，得到第i层判决结果。
可选地，处理器，用于：在i等于1时，针对第1层生成第1层的状态转 移网格图；根据第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：根据第1层期望输出符号，计算出第1层的对数似然比LLR。
可选地，处理器，用于：在i不等于1时，针对第j层至第i层生成第i层的状态转移网格图，根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号；其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
可选地，处理器，在针对第j层至第i层生成第i层的状态转移网格图时，用于：针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；其中，第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
可选地，处理器，在根据第i层的状态转移网格图，对第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：根据状态转移网格图，针对每个分支转移生成第i层期望输出符号；其中，第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；根据第i层期望输出符号，计算出第i层的对数似然比LLR。
可选地，处理器根据状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则上述方法项实施例中公式(6)要求。
可选地，处理器，在对第i层待处理符号进行FTN解调，得到第i层解调后符号，根据第i层解调后符号，进行判决，得到第i层判决结果时，用于：对第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；根据第i层译码结果进行判决，得到第i层判决结果。
可选地，在对第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：
针对多次迭代中的每次迭代，执行：
对第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第 i层译码结果；将该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
其中，总线架构可以包括任意数量的互联的总线和桥，具体由处理器代表的一个或多个处理器和存储器代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。收发器可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元。处理器负责管理总线架构和通常的处理，存储器可以存储处理器在执行操作时所使用的数据。
从上述内容可看出，本发明实施例中，采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
图6示例性示出了本发明实施例提供的一种发送装置的结构示意图。
基于相同构思，本发明实施例提供一种发送装置600，用于执行上述方法流程，包括处理器601、发送器602、存储器603：
存储器，用于存储程序和指令；
处理器，用于通过调用存储器中存储的程序和指令，执行：
对K层中的所有层的信号分别进行编码、交织和调制，得到K层中每层的符号；其中，K为大于1的正整数；根据K层中每层分配的功率值，将K层中的所有符号通过FTN成型滤波进行滤波；
发送器，用于并行发送进行滤波后的K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
可选地，K层中每层所分配的功率值所满足的条件以及K层中每层所分配的功率值的方法可参见上述方法实施例部分的描述，在此不再赘述。
其中，总线架构可以包括任意数量的互联的总线和桥，具体由处理器代表的一个或多个处理器和存储器代表的存储器的各种电路链接在一起。总线架构还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行进一步描述。总线接口提供接口。收发器可以是多个元件，即包括发送机和收发机，提供用于在传输介质上与各种其他装置通信的单元。处理器负责管理总线架构和通常的处理，存储器可以存储处理器在执行操作时所使用的数据。
从上述内容可看出，在本发明实施例中，采用分层技术通过多层低阶调制并行传输，达到了使用高阶调制时所达到的频谱效率，因此基于分层技术进行通信，提供了较高的频谱效率；另一方面，由于每层均使用低阶调制，针对每层可在较低复杂度情况下进行FTN解调，从而为进一步提高频谱效率提供了可实现性。也就是说，通过多层低阶调制并行传输，达到使用高阶调制时的频谱效率，且可采用FTN技术成功进行解调，从而进一步提高频谱效率。
本领域内的技术人员应明白，本发明的实施例可提供为方法、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包括有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例，但本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然，本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样，倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内，则本发明也意图包括这些改动和变型在内。

Claims (42)

  1. 一种基于超奈奎斯特FTN的通信方法，其特征在于，包括：
    接收装置接收到发送装置通过K层并行发送的信号，并将其转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
    针对所述K层中的第i层，i大于等于1且小于等于K，执行：
    所述接收装置从所述待处理符号中分离出第i层待处理符号；所述接收装置在确定i等于K时，将所述待处理符号作为所述第i层待处理符号；所述接收装置在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，所述接收装置从所述待处理符号中去除获取的所述第i+1层FTN重建符号至第K层的FTN重建符号，得到所述第i层待处理符号；
    所述接收装置对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    所述接收装置根据所述第i层解调后符号，进行判决，得到第i层判决结果。
  2. 如权利要求1所述的方法，其特征在于，在所述i等于1时，所述接收装置对所述第1层待处理符号进行FTN解调，得到第i层解调后符号，包括：
    所述接收装置针对第1层生成第1层的状态转移网格图；
    所述接收装置根据所述第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：
    所述接收装置根据所述第1层期望输出符号，计算出第1层的对数似然比LLR。
  3. 如权利要求1所述的方法，其特征在于，在所述i不等于1时，所述接收装置对所述第i层待处理符号进行FTN解调，得到第i层解调后符号， 包括：
    所述接收装置针对第j层至第i层生成第i层的状态转移网格图；
    所述接收装置根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
  4. 如权利要求3所述的方法，其特征在于，所述接收装置针对第j层至第i层生成第i层的状态转移网格图，包括：
    所述接收装置针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；
    其中，所述第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
  5. 如权利要求4所述的方法，其特征在于，所述接收装置根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号，包括：
    所述接收装置根据所述状态转移网格图，针对每个分支转移生成所述第i层期望输出符号；其中，所述第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；
    所述接收装置根据所述第i层期望输出符号，计算出第i层的对数似然比LLR。
  6. 如权利要求5所述的方法，其特征在于，所述接收装置根据所述状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合下述公式要求：
    Figure PCTCN2016084816-appb-100001
    其中，Pi为第i层符号对应的功率值；Pi-1为第i-1层符号对应的功率值；Pi-m为第i-m层符号对应的功率值；Pj为第j层符号对应的功率值；
    Figure PCTCN2016084816-appb-100002
    为第i 层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100003
    为第i-1层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100004
    为第i-m层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100005
    为第j层符号对应的功率值因子；
    L为预设的第i层的ISI抽头的长度；L1为预设的第i-1层的显著ISI抽头的长度；Lm为预设的第i-m层的显著ISI抽头的长度；Li-j为预设的第j层的显著ISI抽头的长度；
    Figure PCTCN2016084816-appb-100006
    为第i层的符号分量；
    Figure PCTCN2016084816-appb-100007
    为第i-1层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100008
    为第i-m层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100009
    为第j层考虑显著ISI抽头下的符号分量；
    m为整数，m取遍[1,i-j]中的每一个整数；
    fl为ISI抽头系数
    Figure PCTCN2016084816-appb-100010
    为与状态转移网格图对应的第i层数据；
    Figure PCTCN2016084816-appb-100011
    为与状态转移网格图对应的第i-1层数据；
    Figure PCTCN2016084816-appb-100012
    为与状态转移网格图对应的第i-m层数据；
    Figure PCTCN2016084816-appb-100013
    为与状态转移网格图对应的第j层数据；
    n为数据标号。
  7. 如权利要求1至6任一权利要求所述的方法，其特征在于，所述接收装置对所述第i层待处理符号进行FTN解调，得到第i层解调后符号，根据所述第i层解调后符号，进行判决，得到第i层判决结果，包括：
    所述接收装置对所述第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；
    所述接收装置根据所述第i层译码结果进行判决，得到第i层判决结果。
  8. 如权利要求7所述的方法，其特征在于，所述接收装置对所述第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果，包括：
    针对所述多次迭代中的每次迭代，执行：
    所述接收装置对所述第i层待处理符号进行FTN解调、解交织和译码， 得到该次迭代的第i层译码结果；
    将所述该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
  9. 一种基于超奈奎斯特FTN的通信方法，其特征在于，包括：
    发送装置对K层中的所有层的信号分别进行编码、交织和调制，得到所述K层中每层的符号；其中，K为大于1的正整数；
    所述发送装置根据所述K层中每层分配的功率值，将所述K层中的所有符号通过FTN成型滤波进行滤波后，并行发送；其中，从第1层至第K层，每层对应的功率值依次增大。
  10. 如权利要求9所述的方法，其特征在于，所述K层中每层所分配的功率值满足以下条件：
    系统BER小于BER阈值、第1层的功率值至第K层的功率值总和不大于总功率值阈值。
  11. 如权利要求9或10所述的方法，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    按照从第1层至第K层的顺序，依次为K层中的每层分配功率值。
  12. 如权利要求9至11任一权利要求所述的方法，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    为第1层分配第1层的功率值；其中，所述第1层的功率值为：满足系统BER小于BER阈值的最小功率值；
    针对i大于1时，执行：
    步骤A，将第i层的功率值设置为第i-1层的功率值；转入步骤B；
    步骤B，将所述第i层的功率值以预设步长增大一次，得到更新后第i层的功率值；转入步骤C；
    步骤C，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和不大于总功率值阈值时，转入步骤D；
    步骤D，在确定系统BER小于BER阈值时，转入步骤E，否则，转入步 骤B；
    步骤E，将所述更新后第i层的功率值确定为第i层的功率值；转入步骤F；
    步骤F，在确定i小于K0时，令i加1，并转入步骤A。
  13. 如权利要求12所述的方法，其特征在于，还包括：
    在所述步骤C中，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和大于总功率值阈值时，将K的值设置为i-1。
  14. 如权利要求12或13所述的方法，其特征在于，还包括：
    在所述步骤F中，在确定i不小于所述K0时，将K的值设置为所述K0。
  15. 一种基于超奈奎斯特FTN的接收装置，其特征在于，包括：
    接收单元，用于接收到发送装置通过K层并行发送的信号；
    转换单元，用于将所述信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
    处理单元，用于针对所述K层中的第i层，i大于等于1且小于等于K，执行：
    从所述待处理符号中分离出第i层待处理符号；在确定i等于K时，将所述待处理符号作为所述第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从所述待处理符号中去除获取的所述第i+1层FTN重建符号至第K层的FTN重建符号，得到所述第i层待处理符号；
    对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    根据所述第i层解调后符号，进行判决，得到第i层判决结果。
  16. 如权利要求15所述的接收装置，其特征在于，所述处理单元，用于：
    在所述i等于1时，针对第1层生成第1层的状态转移网格图；
    根据所述第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：
    根据所述第1层期望输出符号，计算出第1层的对数似然比LLR。
  17. 如权利要求15所述的接收装置，其特征在于，所述处理单元，用于：
    在所述i不等于1时，针对第j层至第i层生成第i层的状态转移网格图；
    根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
  18. 如权利要求17所述的接收装置，其特征在于，所述处理单元，在针对第j层至第i层生成第i层的状态转移网格图时，用于：
    针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；
    其中，所述第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
  19. 如权利要求18所述的接收装置，其特征在于，所述处理单元，在根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：
    根据所述状态转移网格图，针对每个分支转移生成所述第i层期望输出符号；其中，所述第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；
    根据所述第i层期望输出符号，计算出第i层的对数似然比LLR。
  20. 如权利要求19所述的接收装置，其特征在于，所述处理单元根据所述状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合下述公式要求：
    Figure PCTCN2016084816-appb-100014
    其中，Pi为第i层符号对应的功率值；Pi-1为第i-1层符号对应的功率值；Pi-m为第i-m层符号对应的功率值；Pj为第j层符号对应的功率值；
    Figure PCTCN2016084816-appb-100015
    为第i层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100016
    为第i-1层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100017
    为第 i-m层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100018
    为第j层符号对应的功率值因子；
    L为预设的第i层的ISI抽头的长度；L1为预设的第i-1层的显著ISI抽头的长度；Lm为预设的第i-m层的显著ISI抽头的长度；Li-j为预设的第j层的显著ISI抽头的长度；
    Figure PCTCN2016084816-appb-100019
    为第i层的符号分量；
    Figure PCTCN2016084816-appb-100020
    为第i-1层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100021
    为第i-m层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100022
    为第j层考虑显著ISI抽头下的符号分量；
    m为整数，m取遍[1,i-j]中的每一个整数；
    fl为ISI抽头系数
    Figure PCTCN2016084816-appb-100023
    为与状态转移网格图对应的第i层数据；
    Figure PCTCN2016084816-appb-100024
    为与状态转移网格图对应的第i-1层数据；
    Figure PCTCN2016084816-appb-100025
    为与状态转移网格图对应的第i-m层数据；
    Figure PCTCN2016084816-appb-100026
    为与状态转移网格图对应的第j层数据；
    n为数据标号。
  21. 如权利要求15至20任一权利要求所述的接收装置，其特征在于，所述处理单元，在对所述第i层待处理符号进行FTN解调，得到第i层解调后符号，根据所述第i层解调后符号，进行判决，得到第i层判决结果时，用于：
    对所述第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；
    根据所述第i层译码结果进行判决，得到第i层判决结果。
  22. 如权利要求21所述的接收装置，其特征在于，所述处理单元，在对所述第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：
    针对所述多次迭代中的每次迭代，执行：
    对所述第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；
    将所述该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先验信息进而执行下一次迭代中的FTN解调、解交织和译码。
  23. 一种基于超奈奎斯特FTN的发送装置，其特征在于，包括：
    处理单元，用于对K层中的所有层的信号分别进行编码、交织和调制，得到所述K层中每层的符号；其中，K为大于1的正整数；根据所述K层中每层分配的功率值，将所述K层中的所有符号通过FTN成型滤波进行滤波；
    发送单元，用于并行发送进行滤波后的所述K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
  24. 如权利要求23所述的发送装置，其特征在于，所述K层中每层所分配的功率值满足以下条件：
    系统BER小于BER阈值、第1层的功率值至第K层的功率值总和不大于总功率值阈值。
  25. 如权利要求23或24所述的发送装置，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    按照从第1层至第K层的顺序，依次为K层中的每层分配功率值。
  26. 如权利要求23至25任一权利要求所述的发送装置，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    为第1层分配第1层的功率值；其中，所述第1层的功率值为：满足系统BER小于BER阈值的最小功率值；
    针对i大于1时，执行：
    步骤A，将第i层的功率值设置为第i-1层的功率值；转入步骤B；
    步骤B，将所述第i层的功率值以预设步长增大一次，得到更新后第i层的功率值；转入步骤C；
    步骤C，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和不大于总功率值阈值时，转入步骤D；
    步骤D，在确定系统BER小于BER阈值时，转入步骤E，否则，转入步骤B；
    步骤E，将所述更新后第i层的功率值确定为第i层的功率值；转入步骤F；
    步骤F，在确定i小于K0时，令i加1，并转入步骤A。
  27. 如权利要求26所述的发送装置，其特征在于，在所述步骤C中，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和大于总功率值阈值时，将K的值设置为i-1。
  28. 如权利要求26或27所述的发送装置，其特征在于，在所述步骤F中，在确定i不小于所述K0时，将K的值设置为所述K0。
  29. 一种基于超奈奎斯特FTN的接收装置，其特征在于，包括：
    接收器，用于接收到发送装置通过K层并行发送的信号；
    存储器，用于存储程序和指令；
    处理器，用于通过调用所述存储器中存储的程序和指令，执行：
    将所述信号转换为待处理符号；K为大于1的正整数；从第1层至第K层，每层对应的功率值依次增大；
    针对所述K层中的第i层，i大于等于1且小于等于K，执行：
    从所述待处理符号中分离出第i层待处理符号；在确定i等于K时，将所述待处理符号作为所述第i层待处理符号；在确定i不等于K时，获取根据第i+1层判决结果至第K层判决结果重建出的第i+1层FTN重建符号至第K层的FTN重建符号，从所述待处理符号中去除获取的所述第i+1层FTN重建符号至第K层的FTN重建符号，得到所述第i层待处理符号；
    对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    根据所述第i层解调后符号，进行判决，得到第i层判决结果。
  30. 如权利要求29所述的接收装置，其特征在于，所述处理器，用于：
    在所述i等于1时，针对第1层生成第1层的状态转移网格图；
    根据所述第1层的状态转移网格图，针对每个分支转移生成第1层期望输出符号；其中：
    根据所述第1层期望输出符号，计算出第1层的对数似然比LLR。
  31. 如权利要求30所述的接收装置，其特征在于，所述处理器，用于：
    在所述i不等于1时，针对第j层至第i层生成第i层的状态转移网格图；
    根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号；
    其中，第j层至第i-1层中的每层为预设的、且对第i层的干扰程度大于干扰阈值的层；j大于等于1且小于等于i-1。
  32. 如权利要求31所述的接收装置，其特征在于，所述处理器，在针对第j层至第i层生成第i层的状态转移网格图时，用于：
    针对第i层ISI抽头，以及第j层至第i-1层中每层的显著ISI抽头生成的状态转移网格图；
    其中，所述第j层至第i-1层中每层的显著ISI抽头为：第j层至第i-1层中每层中能量大于第i层对应的能量阈值的ISI抽头。
  33. 如权利要求32所述的接收装置，其特征在于，所述处理器，在根据所述第i层的状态转移网格图，对所述第i层待处理符号进行FTN解调，得到第i层解调后符号时，用于：
    根据所述状态转移网格图，针对每个分支转移生成所述第i层期望输出符号；其中，所述第i层期望输出符号包括：第j层至第i层中每层的符号与该层对应的功率值因子相乘得到的符号之和；
    根据所述第i层期望输出符号，计算出第i层的对数似然比LLR。
  34. 如权利要求33所述的接收装置，其特征在于，所述处理器根据所述状态转移网格图针对每个分支转移生成第i层期望输出符号时的生成规则符合下述公式要求：
    Figure PCTCN2016084816-appb-100027
    其中，Pi为第i层符号对应的功率值；Pi-1为第i-1层符号对应的功率值；Pi-m为第i-m层符号对应的功率值；Pj为第j层符号对应的功率值；
    Figure PCTCN2016084816-appb-100028
    为第i层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100029
    为第i-1层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100030
    为第 i-m层符号对应的功率值因子；
    Figure PCTCN2016084816-appb-100031
    为第j层符号对应的功率值因子；
    L为预设的第i层的ISI抽头的长度；L1为预设的第i-1层的显著ISI抽头的长度；Lm为预设的第i-m层的显著ISI抽头的长度；Li-j为预设的第j层的显著ISI抽头的长度；
    Figure PCTCN2016084816-appb-100032
    为第i层的符号分量；
    Figure PCTCN2016084816-appb-100033
    为第i-1层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100034
    为第i-m层考虑显著ISI抽头下的符号分量；
    Figure PCTCN2016084816-appb-100035
    为第j层考虑显著ISI抽头下的符号分量；
    m为整数，m取遍[1,i-j]中的每一个整数；
    fl为ISI抽头系数
    Figure PCTCN2016084816-appb-100036
    为与状态转移网格图对应的第i层数据；
    Figure PCTCN2016084816-appb-100037
    为与状态转移网格图对应的第i-1层数据；
    Figure PCTCN2016084816-appb-100038
    为与状态转移网格图对应的第i-m层数据；
    Figure PCTCN2016084816-appb-100039
    为与状态转移网格图对应的第j层数据；
    n为数据标号。
  35. 如权利要求29至34任一权利要求所述的接收装置，其特征在于，所述处理器，在对所述第i层待处理符号进行FTN解调，得到第i层解调后符号，根据所述第i层解调后符号，进行判决，得到第i层判决结果时，用于：
    对所述第i层待处理符号采用迭代结构重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果；
    根据所述第i层译码结果进行判决，得到第i层判决结果。
  36. 如权利要求35所述的接收装置，其特征在于，所述处理器，在对所述第i层待处理符号重复进行FTN解调、解交织和译码，得到经过多次迭代得到的第i层译码结果时，用于：
    针对所述多次迭代中的每次迭代，执行：
    对所述第i层待处理符号进行FTN解调、解交织和译码，得到该次迭代的第i层译码结果；
    将所述该次迭代的第i层译码结果作为下一次迭代过程中FTN解调的先 验信息进而执行下一次迭代中的FTN解调、解交织和译码。
  37. 一种基于超奈奎斯特FTN的发送装置，其特征在于，包括：
    存储器，用于存储程序和指令；
    处理器，用于通过调用所述存储器中存储的程序和指令，执行：
    对K层中的所有层的信号分别进行编码、交织和调制，得到所述K层中每层的符号；其中，K为大于1的正整数；根据所述K层中每层分配的功率值，将所述K层中的所有符号通过FTN成型滤波进行滤波；
    发送器，用于并行发送进行滤波后的所述K层中的所有符号；其中，从第1层至第K层，每层对应的功率值依次增大。
  38. 如权利要求37所述的发送装置，其特征在于，所述K层中每层所分配的功率值满足以下条件：
    系统BER小于BER阈值、第1层的功率值至第K层的功率值总和不大于总功率值阈值。
  39. 如权利要求37或38所述的发送装置，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    按照从第1层至第K层的顺序，依次为K层中的每层分配功率值。
  40. 如权利要求37至39任一权利要求所述的发送装置，其特征在于，所述K层中每层所分配的功率值是通过以下方法得到的：
    为第1层分配第1层的功率值；其中，所述第1层的功率值为：满足系统BER小于BER阈值的最小功率值；
    针对i大于1时，执行：
    步骤A，将第i层的功率值设置为第i-1层的功率值；转入步骤B；
    步骤B，将所述第i层的功率值以预设步长增大一次，得到更新后第i层的功率值；转入步骤C；
    步骤C，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和不大于总功率值阈值时，转入步骤D；
    步骤D，在确定系统BER小于BER阈值时，转入步骤E，否则，转入步 骤B；
    步骤E，将所述更新后第i层的功率值确定为第i层的功率值；转入步骤F；
    步骤F，在确定i小于K0时，令i加1，并转入步骤A。
  41. 如权利要求40所述的发送装置，其特征在于，在所述步骤C中，在确定第1层的功率值至第i-1层的功率值、以及所述更新后第i层的功率值的总和大于总功率值阈值时，将K的值设置为i-1。
  42. 如权利要求40或41所述的发送装置，其特征在于，在所述步骤F中，在确定i不小于所述K0时，将K的值设置为所述K0。
PCT/CN2016/084816 2016-06-03 2016-06-03 一种基于ftn的通信方法、相关装置 WO2017206188A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP16903573.0A EP3454517B1 (en) 2016-06-03 2016-06-03 Ftn-based communication method and relevant apparatus
CN201680079239.XA CN108476195B (zh) 2016-06-03 2016-06-03 一种基于ftn的通信方法、相关装置和系统
PCT/CN2016/084816 WO2017206188A1 (zh) 2016-06-03 2016-06-03 一种基于ftn的通信方法、相关装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2016/084816 WO2017206188A1 (zh) 2016-06-03 2016-06-03 一种基于ftn的通信方法、相关装置

Publications (1)

Publication Number Publication Date
WO2017206188A1 true WO2017206188A1 (zh) 2017-12-07

Family

ID=60478359

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/084816 WO2017206188A1 (zh) 2016-06-03 2016-06-03 一种基于ftn的通信方法、相关装置

Country Status (3)

Country Link
EP (1) EP3454517B1 (zh)
CN (1) CN108476195B (zh)
WO (1) WO2017206188A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113852581A (zh) * 2021-09-16 2021-12-28 电子科技大学 一种单载波thp-ftn系统相位噪声估计与消除方法
CN115276895A (zh) * 2021-04-30 2022-11-01 维沃移动通信有限公司 数据传输方法、装置、设备及存储介质

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10715276B2 (en) 2018-05-26 2020-07-14 Ntwine, Llc Bandwidth constrained communication systems with optimized low-density parity-check codes
US11240083B2 (en) 2020-03-10 2022-02-01 Ntwine, Llc Bandwidth constrained communication systems with frequency domain information processing
US11990922B2 (en) 2021-01-11 2024-05-21 Ntwine, Llc Bandwidth constrained communication systems with neural network based detection

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015006380A1 (en) * 2013-07-08 2015-01-15 Hughes Network Systems, Llc System and method for iterative compensation for linear and nonlinear interference in system employing ftn symbol transmission rates
CN105099968A (zh) * 2015-07-10 2015-11-25 广东顺德中山大学卡内基梅隆大学国际联合研究院 一种多径信道中的超奈奎斯特速率通信系统
CN105493460A (zh) * 2013-08-29 2016-04-13 交互数字专利控股公司 用于超奈奎斯特速率多载波调制的方法及设备

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104811276B (zh) * 2015-05-04 2018-04-03 东南大学 一种超奈奎斯特速率通信的dl‑cnn解调器
EP3430727B1 (en) * 2016-04-13 2020-05-13 Huawei Technologies Canada Co., Ltd. System and method for faster-than-nyquist (ftn) transmission

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015006380A1 (en) * 2013-07-08 2015-01-15 Hughes Network Systems, Llc System and method for iterative compensation for linear and nonlinear interference in system employing ftn symbol transmission rates
CN105493460A (zh) * 2013-08-29 2016-04-13 交互数字专利控股公司 用于超奈奎斯特速率多载波调制的方法及设备
CN105099968A (zh) * 2015-07-10 2015-11-25 广东顺德中山大学卡内基梅隆大学国际联合研究院 一种多径信道中的超奈奎斯特速率通信系统

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
KIM, Y.J.D. ET AL.: "Binary Faster than Nyquist Optical Transmission via Non-uniform Power Allocation", 2013 13TH CANADIAN WORKSHOP ON INFORMATION THEORY, 18 June 2013 (2013-06-18), pages 180 - 184, XP032495673 *
See also references of EP3454517A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115276895A (zh) * 2021-04-30 2022-11-01 维沃移动通信有限公司 数据传输方法、装置、设备及存储介质
CN115276895B (zh) * 2021-04-30 2024-05-24 维沃移动通信有限公司 数据传输方法、装置、设备及存储介质
CN113852581A (zh) * 2021-09-16 2021-12-28 电子科技大学 一种单载波thp-ftn系统相位噪声估计与消除方法

Also Published As

Publication number Publication date
EP3454517A1 (en) 2019-03-13
EP3454517A4 (en) 2019-05-15
CN108476195B (zh) 2021-02-23
CN108476195A (zh) 2018-08-31
EP3454517B1 (en) 2021-02-24

Similar Documents

Publication Publication Date Title
WO2017206188A1 (zh) 一种基于ftn的通信方法、相关装置
US10608783B2 (en) Reception device and reception method
CN110519191B (zh) 一种时频二维压缩的高谱效单载波通信方法
US11743096B2 (en) Reception device and reception method
JP5622404B2 (ja) 無線通信システム、および通信装置
US11184041B2 (en) Transmission device, reception device, transmission method, and reception method
Shukla et al. Analysis and design of tree based interleaver for multiuser receivers in IDMA scheme
AU2015400707B2 (en) Apparatus and method for non-orthogonal transmissions
US11876610B2 (en) Transmission device, reception device, transmission method, and reception method
WO2012176695A1 (ja) 分散推定装置
Kim et al. Successive MAP detection with soft interference cancellation for iterative receivers in hierarchical M-ary QAM systems
Yan et al. Recursive Estimation of the Partial Clipping Noise in IDMA System with Limited Peak
Ghosh et al. Performance of turbo coded MC-CDMA with iterative multiuser detection and decoding in nonlinear fading channel
Rasadurai et al. Performance Enhancement of Asynchronous MC-CDMA system through Turbo MUD
JP2020109878A (ja) 送信装置、受信装置、送信方法および受信方法

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 16903573

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2016903573

Country of ref document: EP

Effective date: 20181204