CN115208480A - Under-ice underwater acoustic communication method based on joint message transfer - Google Patents

Under-ice underwater acoustic communication method based on joint message transfer Download PDF

Info

Publication number
CN115208480A
CN115208480A CN202210770475.3A CN202210770475A CN115208480A CN 115208480 A CN115208480 A CN 115208480A CN 202210770475 A CN202210770475 A CN 202210770475A CN 115208480 A CN115208480 A CN 115208480A
Authority
CN
China
Prior art keywords
node
message
iteration
representing
underwater acoustic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202210770475.3A
Other languages
Chinese (zh)
Other versions
CN115208480B (en
Inventor
韩笑
朱广军
殷敬伟
郭龙祥
葛威
李林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Xinguang Photoelectric Technology Co ltd
Original Assignee
Harbin Engineering University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Harbin Engineering University filed Critical Harbin Engineering University
Priority to CN202210770475.3A priority Critical patent/CN115208480B/en
Publication of CN115208480A publication Critical patent/CN115208480A/en
Application granted granted Critical
Publication of CN115208480B publication Critical patent/CN115208480B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B13/00Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
    • H04B13/02Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/0224Channel estimation using sounding signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/024Channel estimation channel estimation algorithms
    • H04L25/0256Channel estimation using minimum mean square error criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03891Spatial equalizers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/03592Adaptation methods
    • H04L2025/03598Algorithms
    • H04L2025/03611Iterative algorithms
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Power Engineering (AREA)
  • Filters That Use Time-Delay Elements (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides an under-ice underwater acoustic communication method based on joint message transmission, which is based on a single-carrier phase shift keying modulation system, and information source bit information is mapped into symbols after being processed by a channel encoder and a random interleaver. And determining the decoding flow of the communication signal of the receiving end. The communication receiver fully utilizes the sparsity of the underwater acoustic communication channel, and adopts belief propagation to solve the posterior probability of the estimated symbol, so as to reduce the computational complexity of the receiver. At the same time, the expected propagation is used to project the delivered message into the family of exponential distributions to obtain an accurate approximate posterior probability. The receiver adopts a three-layer iteration structure, wherein the first layer is a cyclic belief propagation iteration process, the second layer is an expected propagation iteration process, and the third layer is a turbo iteration process. The invention can greatly reduce the computational complexity while obtaining performance equivalent to a linear minimum mean square error equalizer (LMMSE).

Description

Under-ice underwater acoustic communication method based on joint message transfer
Technical Field
The present invention relates to the field of underwater acoustic communication, and more particularly, to a method capable of effectively reducing the complexity of an underwater acoustic communication receiver and easily extending to a multi-element system.
Background
With the global warming, the ice covers of the two poles gradually fade, and the arctic region gradually pays attention to people because of abundant underwater resources and natural channel advantages. The underwater acoustic communication technology is widely applied to the fields of underwater resource exploration, marine environment monitoring, data acquisition, detection and early warning and the like. Therefore, research and development of underwater acoustic communication technology have great significance in the process of development in the arctic.
Through analysis of experimental data of the arctic, the arctic under-ice underwater acoustic channel is found to have a rich multi-path time delay structure, and during remote data transmission, the multi-path time delay can reach more than 100 ms. However, due to less human activity in arctic regions and the presence of ice coverage, the signal-to-noise ratio of the collected data is higher and more importantly, the time variation of its channel is slower. For the characteristics of the arctic ice-water acoustic channel, the traditional high-complexity adaptive channel tracking equalization method is not suitable for the scene any more, and the block-by-block equalization method based on channel estimation has relatively low computational complexity, but still has high computational complexity in the case of facing most of the time delay. More importantly, in the case of a multi-array element system, the problem of computational complexity is more acute, which greatly hinders the application of the conventional algorithm in underwater communication equipment.
Therefore, the research of the low-complexity multi-array element system receiver algorithm is of great significance aiming at the arctic ice-low slow time-varying channel characteristics.
Disclosure of Invention
The invention aims to provide an ice region underwater acoustic communication method based on combined message transmission.
The purpose of the invention is realized as follows: the method comprises the following steps:
(1) The receiving symbol collected by the receiving array is y = [ y = 1 ,...,y m ,...,y M ]Wherein M isNumber of receiving array elements, y m The symbol received on the m-th receive array element. Transmitted bit data sequence b = [ b ] 1 ,...,b n ,...,b N ]Obtaining a transmission symbol x = [ x ] through convolutional coding, interleaving and mapping 1 ,...,x n ,...,x N ],x n The symbol transmitted for the nth transmitting array element. And the receiving end knows the pilot sequence of the transmitted signal
Figure BDA0003723777620000011
wherein ,
Figure BDA0003723777620000012
and the pilot sequence transmitted for the nth transmitting array element. And setting the times of three-layer iteration of the receiver, namely the maximum BP iteration time U, the maximum EP iteration time S and the iteration balancing and decoding time T according to the received data.
(2) And (4) channel estimation. In the first turbo iteration, a known pilot sequence is used
Figure BDA0003723777620000013
And estimating a channel by a low-complexity sparse Bayesian algorithm. In subsequent turbo iterations, a priori symbols from feedback
Figure BDA0003723777620000021
And performing channel estimation.
(3) Message transmitted by calculation variable node to balance node
Figure BDA0003723777620000022
Is shown as
Figure BDA0003723777620000023
wherein ,
Figure BDA0003723777620000024
a message indicating that the kth variable node passes to the jth equalization node,
Figure BDA0003723777620000025
and
Figure BDA0003723777620000026
represents the mean and variance of the Gaussian distribution message, k ∈ [1,K ]],j∈[1,J]。
(4) Message transmitted by calculation balance node to variable node
Figure BDA0003723777620000027
Is shown as
Figure BDA0003723777620000028
(5) And (3) judging: and if the current iteration number U = U is true, executing the next step. Otherwise, repeating the BP iterative process of the steps (3) - (5).
(6) Message passed by compute variable node to demapping node
Figure BDA0003723777620000029
Is shown as
Figure BDA00037237776200000210
wherein ,
Figure BDA00037237776200000211
and
Figure BDA00037237776200000212
representing the mean and variance of the message.
(7) Computing unmapped node to variable node messages
Figure BDA00037237776200000213
Is shown as
Figure BDA00037237776200000214
Wherein the mean and variance of the gaussian distribution messages in the above equation are obtained by moment matching.
(8) And (3) judging: and if the current iteration number S = S is true, executing the next step. Otherwise, repeating the EP iteration process from the step (3) to the step (8).
(9) Message L delivered by demapping node to bit node e (d k,j ),L e (d k,j ) Representing a log-likelihood ratio (LLR).
(10) And according to the message transmitted to the bit node by the demapping node, performing deinterleaving and channel decoding, and taking the external information output by the channel decoder as prior information of the next turbo iteration.
(11) And (3) judging: if the current iteration time T = T is true, outputting the channel decoder
Figure BDA00037237776200000215
As a final decoding result. Otherwise, repeating the turbo iteration process from the step (2) to the step (11).
Compared with the prior art, the invention has the beneficial effects that: the difference between the method and the traditional LMMSE (mean square error) balanced underwater acoustic communication method is that the sparsity of an underwater acoustic channel is fully utilized, the posterior probability of an estimated symbol is solved by using a belief propagation algorithm, the calculation complexity of the algorithm is only related to the number of nonzero coefficients of the sparse underwater acoustic channel, and the calculation complexity is greatly reduced. At the same time, a desired propagation algorithm is used to obtain a more accurate approximate posterior probability. The algorithm can be simply and efficiently extended from a SISO system to a SIMO system, a MIMO system or an MU system, thereby effectively reducing the computational complexity of the multi-array element system.
Drawings
FIG. 1 is a flow diagram of an arctic ice-water acoustic communication technique based on federated messaging;
FIG. 2 is a depth of a trial transmit receive array element;
FIGS. 3 (a 1) - (b 4) are graphs of results of the iterative process performed by the user 5; fig. 3 (a 1) shows the output constellation of the BP-EP first iteration equalizer, fig. 3 (a 2) shows the output constellation of the BP-EP second iteration equalizer, fig. 3 (a 3) shows the output constellation of the BP-EP first iteration decoder, and fig. 3 (a 4) shows the output constellation of the BP-EP second iteration decoder; FIG. 3 (b 1) the LMMSE first iteration equalizer outputs a constellation diagram, and FIG. 3 (b 2) the LMMSE second iteration equalizer outputs a constellation diagram; fig. 3 (b 3) LMMSE first iteration decoder outputs a constellation, fig. 3 (b 4) LMMSE second iteration decoder outputs a constellation;
FIG. 4 is a table of the bit error rate results of the data processing of the BP-EP method and the LMMSE method.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
The specific implementation process of the invention is as follows:
(1) A multi-array-element underwater acoustic communication system is set up, and baseband signals obtained by sampling and demodulating acoustic signals collected by a hydrophone are received
Figure BDA0003723777620000031
wherein ,hn,m,j,l Is channel h n,m The channel between the nth transmitting array element and the mth receiving array element is h at the ith coefficient of time j n,m =[h n,m,0 ,...,h n,m,l ,...,h n,m,L-1 ],w m,j Means that the mean value collected at the mth hydrophone at time j is 0 and the variance is σ m,j White Gaussian noise, i.e.
Figure BDA0003723777620000032
Expressing the above formula in a matrix form
Figure BDA0003723777620000033
wherein
Figure BDA0003723777620000041
Figure BDA0003723777620000042
Figure BDA0003723777620000043
Figure BDA0003723777620000044
(2) The receiving symbol collected by the receiving array is y = [ y 1 ,...,y m ,...,y M ]Wherein M is the number of receiving array elements, y m Is the symbol received on the mth receive array element. Transmitted bit data sequence b = [ b ] 1 ,...,b n ,...,b N ]Obtaining a transmission symbol x = [ x ] through convolutional coding, interleaving and mapping 1 ,...,x n ,...,x N ],x n The symbol transmitted for the nth transmit array element. And the receiving end knows the pilot sequence of the transmitted signal
Figure BDA0003723777620000045
wherein ,
Figure BDA0003723777620000046
and the pilot sequence transmitted for the nth transmitting array element. And setting the times of three-layer iteration of the receiver, namely the maximum BP iteration time U, the maximum EP iteration time S and the iteration balancing and decoding time T according to the received data.
(3) And (4) channel estimation. In the first turbo iteration, a known pilot sequence is used
Figure BDA0003723777620000047
And estimating a channel by a low-complexity sparse Bayesian algorithm. In subsequent turbo iterations, a priori symbols from feedback
Figure BDA0003723777620000048
And performing channel estimation.
(4) Compute variable nodeMessages delivered to balancing nodes
Figure BDA0003723777620000049
Is shown as
Figure BDA00037237776200000410
wherein ,
Figure BDA00037237776200000411
a message indicating that the kth variable node passes to the jth equalization node,
Figure BDA00037237776200000412
and
Figure BDA00037237776200000413
represents the mean and variance of the Gaussian distribution message, k ∈ [1,K],j∈[1,J]。
Figure BDA00037237776200000414
A message indicating that the kth demapping node passes to the kth variable node,
Figure BDA00037237776200000415
indicating the message passed by the jth' equalization node to the kth variable node. ne { x k Denotes with x k All nodes except for the nodes j, k that are adjacent. The product property of Gaussian distribution is used to obtain the value of the mean value and the variance in the formula as
Figure BDA0003723777620000051
Figure BDA0003723777620000052
wherein ,
Figure BDA0003723777620000053
and
Figure BDA0003723777620000054
representing Gaussian messages
Figure BDA0003723777620000055
The mean and the variance of (a) is,
Figure BDA0003723777620000056
and
Figure BDA0003723777620000057
representing Gaussian messages
Figure BDA0003723777620000058
Mean and variance of.
(5) Message transmitted by calculation balance node to variable node
Figure BDA0003723777620000059
Is shown as
Figure BDA00037237776200000510
wherein ,fequ (x) Representing a likelihood function, x \ x k Represents a vector [ x 1 ,...x k-1 ,x k+1 ,...,x k ]. By the product property of Gaussian distribution, the mean and variance of the formula are obtained
Figure BDA00037237776200000511
Figure BDA00037237776200000512
wherein ,Hj,k The (j, k) th value of the cyclic convolution channel matrix is represented.
(6) And (3) judging: and if the current iteration number U = U is true, executing the next step. Otherwise, repeating the BP iteration process of the steps (3) to (5).
(7) Message passed by compute variable node to demapping node
Figure BDA00037237776200000513
Is shown as
Figure BDA00037237776200000514
wherein ,
Figure BDA00037237776200000515
and
Figure BDA00037237776200000516
representing the mean and variance of the message. According to the nature of the Gaussian distribution product, obtaining
Figure BDA00037237776200000517
Figure BDA00037237776200000518
(8) Computing unmapped node to variable node messages
Figure BDA00037237776200000519
Is shown as
Figure BDA0003723777620000061
Wherein, proj [ ·]Representing the projection operation, C representing a normalization factor, f dem (x k ,d k ) A mapping function representing a demapping node,
Figure BDA0003723777620000062
representing the message that the ith bit node passes to the demapping node. On the upper partThe mean and variance of the gaussian distribution message in the formula are obtained by moment matching.
(9) And (3) judging: and if the current iteration number S = S is true, executing the next step. Otherwise, repeating the EP iteration process from the step (3) to the step (8).
(10) Message L delivered by demapping node to bit node e (d k,j ),
Figure BDA0003723777620000063
wherein ,Le (d k,j ) Represents a log-likelihood ratio (LLR),
Figure BDA0003723777620000064
which represents the variance of the estimated symbols,
Figure BDA0003723777620000065
representing the estimated symbols, alpha representing the standard constellation point,
Figure BDA0003723777620000066
and
Figure BDA0003723777620000067
representing mapping and demapping operations, χ k Represents a constellation set, q ∈ [1,Q]Denotes the q-th bit, L, corresponding to a symbol a (d k,q ) Representing a priori information fed back by a last turbo channel decoder.
(11) And according to the message transmitted to the bit node by the demapping node, performing deinterleaving and channel decoding, and taking the external information output by the channel decoder as prior information of the next turbo iteration.
(12) And (3) judging: if the current iteration time T = T is true, outputting the channel decoder
Figure BDA0003723777620000068
As a final decoding result. Otherwise, repeating the turbo iteration process of steps (2) - (11).
The test process of the invention is as follows:
the test conditions are as follows:
the proposed receiver algorithm was validated using experimental data collected in 11 th north pole scientific investigation in china, 8 months 2020. The experimental site was carried out at a high altitude sea area within the 85 ° north latitude line, as shown in fig. 2, and the experimental site had a water depth of about 2690m and an ice layer covering about 50 cm. The position of the receiving array is R1 and is kept unchanged, communication tests are carried out at the positions T1 and T2 respectively on 24 th and 25 th days in 8 months, and the positions from the receiving array are 0.225km and 11.112km respectively. Fig. 2 shows detailed depth information of the receiving array and the transmitting transducer during the communication experiment. The multi-user data transmitted in the test are all single-carrier phase shift keying modulation signals, the sampling rate of the system is 48kHz, the carrier frequency is 4kHz, and the roll-off factor of the root-raised cosine filter is 1. The transmission symbol period is 1ms, so the bandwidth is 2kHz, and 8 array elements of received data are used for decoding.
FIGS. 3 (a) and (b) are the results of processing the test data for the North Pole 11.112km by the BP-EP algorithm and the LMMSE algorithm, respectively. The constellation diagram result shows that the BP-EP algorithm and the LMMSE algorithm show similar performance, and the output result of the decoder after two iterations can realize convergence.
The table of FIG. 4 shows the bit error rate results of the BP-EP algorithm and the LMMSE algorithm for the processing of the test data of the north pole 11.112km. The data results show that the performance of the two algorithms is similar in the results of the first iteration process. In the equalizer output result in the second iteration, the BP-EP algorithm exhibits better bit error rate performance, and the output of the decoder is zero.
In summary, the invention discloses an ice region underwater acoustic communication method based on joint message transmission, and belongs to the technical field of underwater acoustic communication. The invention is realized by the following technical scheme: based on a single-carrier phase shift keying modulation system, information source bit information is mapped into symbols after being processed by a channel encoder and a random interleaver. And determining the decoding flow of the communication signal of the receiving end. The communication receiver fully utilizes the sparsity of the underwater acoustic communication channel, and adopts Belief Propagation (BP) to obtain the posterior probability of an estimated symbol, so as to reduce the computational complexity of the receiver. At the same time, the exact approximate posterior probability is obtained by projecting the delivered message into a family of exponential distributions using Expectation Propagation (EP). The receiver adopts a three-layer iteration structure, wherein the first layer is a cyclic belief propagation iteration process, the second layer is an expected propagation iteration process, and the third layer is a turbo iteration process. And finally, the BP-EP combined message transfer algorithm is popularized to a multi-array element system, so that the computational complexity of the multi-array element underwater acoustic communication system is reduced. The invention has the advantages that (1) the computational complexity can be greatly reduced while the performance equivalent to a linear minimum mean square error equalizer (LMMSE) is obtained; (2) The algorithm is applicable to single-input single-output (SISO), single-input multiple-output (SIMO), multiple-input multiple-output (MIMO), or multi-user (MU) systems; (3) The method can be used for realizing data transmission between underwater wireless networks.

Claims (7)

1. An under-ice underwater acoustic communication method based on joint message transmission is characterized by comprising the following steps:
the method comprises the following steps: setting the number of three-layer iteration of the receiver according to the received data, wherein the number of three-layer iteration of the receiver comprises the maximum number of BP iteration U, EP maximum iteration number S, iteration balance and decoding number T;
step two: channel estimation, in the first turbo iteration, using a known pilot sequence
Figure FDA0003723777610000011
Estimating a channel by using a low-complexity sparse Bayesian algorithm; in subsequent turbo iterations, a priori symbols from feedback
Figure FDA0003723777610000012
Performing channel estimation;
step three: message transmitted by variable calculation node to balance node
Figure FDA0003723777610000013
Step four: message transmitted by calculation balance node to variable node
Figure FDA0003723777610000014
Step five: and (3) judging: if the current iteration times U = U is true, executing the next step; otherwise, repeating the BP iteration process of the third step to the fifth step;
step six: message passed by compute variable node to demapping node
Figure FDA0003723777610000015
Step seven: computing unmapped node to variable node messages
Figure FDA0003723777610000016
Step eight: and (3) judging: if the current iteration times S = S is true, executing the next step; otherwise, repeating the EP iteration process of the third step to the eighth step;
step nine: message L delivered by demapping node to bit node e (d k,j ),L e (d k,j ) Representing a log-likelihood ratio (LLR);
step ten: de-interleaving and channel decoding are carried out according to the information transmitted to the bit nodes by the de-mapping nodes, and the external information output by the channel decoder is used as the prior information of the next turbo iteration;
step eleven: and (3) judging: if the current iteration time T = T is true, outputting the channel decoder
Figure FDA0003723777610000017
As a final decoding result, communication is effected; otherwise, the turbo iteration process of steps two-eleven is repeated.
2. The method for underwater acoustic communication based on combined messaging according to claim 1, wherein the receiving data in the first step comprises: the receiving array collects the receiving symbols y = [ y 1 ,...,y m ,...,y M ]Wherein M is the number of receiving array elements, y m For m receiving array element up connectionA received symbol; transmission bit data sequence b = [ b ] 1 ,...,b n ,...,b N ]Obtaining a transmission symbol x = [ x ] through convolutional coding, interleaving and mapping 1 ,...,x n ,...,x N ],x n A symbol transmitted for the nth transmit array element; and the receiving end knows the pilot sequence of the transmitted signal
Figure FDA0003723777610000018
wherein ,
Figure FDA0003723777610000019
and the pilot sequence transmitted for the nth transmitting array element.
3. The method of claim 1, wherein the step three comprises an underwater acoustic communication method based on joint message delivery
Figure FDA0003723777610000021
Comprises the following steps:
Figure FDA0003723777610000022
wherein ,
Figure FDA0003723777610000023
a message indicating that the kth variable node passes to the jth equalization node,
Figure FDA0003723777610000024
and
Figure FDA0003723777610000025
represents the mean and variance of the Gaussian distribution message, k ∈ [1,K],j∈[1,J];
Figure FDA0003723777610000026
A message indicating that the kth demapping node passes to the kth variable node,
Figure FDA0003723777610000027
a message indicating that the jth equalizing node passes to the kth variable node; ne { x k Denotes with x } \ j, k k All neighboring nodes except for node { j, k }; by the product property of the gaussian distribution, the values of the mean and variance in the above formula are obtained as:
Figure FDA0003723777610000028
Figure FDA0003723777610000029
wherein ,
Figure FDA00037237776100000210
and
Figure FDA00037237776100000211
representing Gaussian messages
Figure FDA00037237776100000212
The mean and the variance of (a) is,
Figure FDA00037237776100000213
and
Figure FDA00037237776100000214
representing Gaussian messages
Figure FDA00037237776100000215
Mean and variance of (c).
4. The method for underwater acoustic communication based on combined message passing as claimed in claim 1, wherein the step four is
Figure FDA00037237776100000216
Comprises the following steps:
Figure FDA00037237776100000217
wherein ,fequ (x) Representing a likelihood function, x \ x k Represents a vector [ x 1 ,...x k-1 ,x k+1 ,…,x K ](ii) a By the product property of the gaussian distribution, the mean and variance of the above formula are obtained:
Figure FDA00037237776100000218
Figure FDA00037237776100000219
wherein ,Hj,k The (j, k) th value of the cyclic convolution channel matrix is represented.
5. The method for underwater acoustic communication based on united message passing as claimed in claim 1, wherein the sixth step is
Figure FDA00037237776100000220
Comprises the following steps:
Figure FDA0003723777610000031
wherein ,
Figure FDA0003723777610000032
and
Figure FDA0003723777610000033
means and variance representing the message; according to the Gaussian distribution productOf obtaining
Figure FDA0003723777610000034
6. The method for underwater acoustic communication based on combined message passing as claimed in claim 1, wherein step seven is performed
Figure FDA0003723777610000035
Comprises the following steps:
Figure FDA0003723777610000036
wherein, proj [ ·]Representing projection operations, C representing a normalization factor, f dem (x k ,d k ) A mapping function representing a demapping node,
Figure FDA0003723777610000037
a message indicating that the ith bit node passes to the demapping node; the mean and variance of the gaussian distribution message in the above equation are obtained by moment matching.
7. The method for underwater acoustic communication based on combined message passing as claimed in claim 1, wherein L of the ninth step e (d k,j ) Comprises the following steps:
Figure FDA0003723777610000038
wherein ,Le (d k,j ) Represents a log-likelihood ratio (LLR),
Figure FDA0003723777610000039
which represents the variance of the estimated symbols,
Figure FDA00037237776100000310
representing the estimated symbols, alpha representing the standard constellation point,
Figure FDA00037237776100000311
and
Figure FDA00037237776100000312
representing mapping and demapping operations, χ k Represents a constellation set, q ∈ [1,Q ]]Denotes the q-th bit, L, corresponding to a symbol a (d k,q ) Representing a priori information fed back by a last turbo channel decoder.
CN202210770475.3A 2022-06-30 2022-06-30 Ice underwater acoustic communication method based on joint message transmission Active CN115208480B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210770475.3A CN115208480B (en) 2022-06-30 2022-06-30 Ice underwater acoustic communication method based on joint message transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210770475.3A CN115208480B (en) 2022-06-30 2022-06-30 Ice underwater acoustic communication method based on joint message transmission

Publications (2)

Publication Number Publication Date
CN115208480A true CN115208480A (en) 2022-10-18
CN115208480B CN115208480B (en) 2023-05-12

Family

ID=83578632

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210770475.3A Active CN115208480B (en) 2022-06-30 2022-06-30 Ice underwater acoustic communication method based on joint message transmission

Country Status (1)

Country Link
CN (1) CN115208480B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116016061A (en) * 2022-12-16 2023-04-25 重庆邮电大学 Short wave double-selection channel double-iteration Turbo equalization method for high maneuvering platform

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2144413A1 (en) * 2008-07-11 2010-01-13 Mitsubishi Electric R&D Centre Europe B.V. Iterative channel estimation and decoding using belief propagation with Gaussian approximation
CN106301517A (en) * 2016-08-10 2017-01-04 清华大学 The satellite multi-beam joint-detection propagated based on expectation and interpretation method and system
CN109246039A (en) * 2018-08-09 2019-01-18 华南理工大学 A kind of Soft Inform ation iteration receiving method based on two-way time domain equalization
WO2019018017A2 (en) * 2017-04-08 2019-01-24 Zheng Yahong Rosa Improved turbo receivers for single-input single-output underwater acoustic communications
US20190068294A1 (en) * 2017-08-25 2019-02-28 Yahong Rosa Zheng Turbo receivers for multiple-input multiple-output underwater acoustic communications
CN109743118A (en) * 2018-12-24 2019-05-10 哈尔滨工程大学 A kind of double OFDM underwater acoustic communication methods for expanding the spectral efficient under channel condition of time-varying
CN112953653A (en) * 2021-03-01 2021-06-11 哈尔滨工程大学 Single-carrier multi-user underwater acoustic communication method
CN114401172A (en) * 2021-10-26 2022-04-26 郑州大学 Joint estimation and detection method based on Turbo equalization framework and VAMP

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2144413A1 (en) * 2008-07-11 2010-01-13 Mitsubishi Electric R&D Centre Europe B.V. Iterative channel estimation and decoding using belief propagation with Gaussian approximation
CN106301517A (en) * 2016-08-10 2017-01-04 清华大学 The satellite multi-beam joint-detection propagated based on expectation and interpretation method and system
WO2019018017A2 (en) * 2017-04-08 2019-01-24 Zheng Yahong Rosa Improved turbo receivers for single-input single-output underwater acoustic communications
US20190068294A1 (en) * 2017-08-25 2019-02-28 Yahong Rosa Zheng Turbo receivers for multiple-input multiple-output underwater acoustic communications
CN109246039A (en) * 2018-08-09 2019-01-18 华南理工大学 A kind of Soft Inform ation iteration receiving method based on two-way time domain equalization
CN109743118A (en) * 2018-12-24 2019-05-10 哈尔滨工程大学 A kind of double OFDM underwater acoustic communication methods for expanding the spectral efficient under channel condition of time-varying
CN112953653A (en) * 2021-03-01 2021-06-11 哈尔滨工程大学 Single-carrier multi-user underwater acoustic communication method
CN114401172A (en) * 2021-10-26 2022-04-26 郑州大学 Joint estimation and detection method based on Turbo equalization framework and VAMP

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116016061A (en) * 2022-12-16 2023-04-25 重庆邮电大学 Short wave double-selection channel double-iteration Turbo equalization method for high maneuvering platform
CN116016061B (en) * 2022-12-16 2024-05-07 重庆邮电大学 Short wave double-selection channel double-iteration Turbo equalization method for high maneuvering platform

Also Published As

Publication number Publication date
CN115208480B (en) 2023-05-12

Similar Documents

Publication Publication Date Title
EP1233565B1 (en) Turbo-reception method and turbo-receiver for a MIMO system
CN104301267B (en) The multistage iteration detection method and device of a kind of mimo wireless communication receiver
CN109246039A (en) A kind of Soft Inform ation iteration receiving method based on two-way time domain equalization
CN111106877B (en) Underwater acoustic communication transmission method based on Farrow filtering and code word matching
CN113381951A (en) MFTN joint channel estimation and equalization method under time-frequency conversion selective fading channel
CN107124213B (en) Direct self-adaptive bidirectional turbo equalization method in multi-input multi-output system
CN108848043B (en) Low-complexity underwater sound sparse time-varying channel estimation method based on compressed sensing
US8139669B2 (en) Space domain filter detecting method in a multi-antenna wireless communication system
CN104836603A (en) MIMO signal detection method
CN115208480B (en) Ice underwater acoustic communication method based on joint message transmission
US20040161059A1 (en) Signal estimation methods and apparatus
CN105610484B (en) Extensive MIMO Low-complexity iterative receiver methods
CN101277279A (en) Method and apparatus for eliminating serial interference of multi-aerial system
US8107546B2 (en) Detection method of space domain maximum posteriori probability in a wireless communication system
CN104135455B (en) Iterative receiving method for communication system
CN105429711B (en) Software- redundancy based on receiving hydrophone battle array is from the soft balanced underwater acoustic communication method of iteration
CN115883298A (en) Underwater acoustic communication method based on Haar distribution domain coding diversity
CN106856462B (en) Detection method under spatial modulation multidiameter fading channel
CN111682924B (en) Bidirectional frequency domain Turbo equalization method adopting expected propagation
CN101714885B (en) Serial belief propagation detection method of multi-antenna system
Kim et al. Soft data detection algorithms for an iterative turbo coded MIMO OFDM systems
CN116016055B (en) Self-adaptive underwater acoustic channel equalization method based on vector approximation message transmission
Si et al. An Iterative Receiver for Coded Faster-than-Nyquist Signaling over Rayleigh Fading Channels
CN114050853B (en) Multi-user MIMO transmission method based on joint non-orthogonal codebook and pre-coding design
Wan et al. Joint channel estimation and Markov Chain Monte Carlo detection for frequency-selective channels

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20230925

Address after: 1294 Chuangxin Road, Songbei District, Harbin City, Heilongjiang Province, 150001

Patentee after: HARBIN XINGUANG PHOTOELECTRIC TECHNOLOGY Co.,Ltd.

Address before: 150001 Intellectual Property Office, Harbin Engineering University science and technology office, 145 Nantong Avenue, Nangang District, Harbin, Heilongjiang

Patentee before: HARBIN ENGINEERING University

TR01 Transfer of patent right