CN103731234A - United network-channel coding method and device and relay node - Google Patents
United network-channel coding method and device and relay node Download PDFInfo
- Publication number
- CN103731234A CN103731234A CN201210387332.0A CN201210387332A CN103731234A CN 103731234 A CN103731234 A CN 103731234A CN 201210387332 A CN201210387332 A CN 201210387332A CN 103731234 A CN103731234 A CN 103731234A
- Authority
- CN
- China
- Prior art keywords
- bit
- sequence
- sequences
- burst
- estimated
- 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.)
- Pending
Links
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The embodiment of the invention discloses a united network-channel coding method and device and a relay node, and relates to the technical field of communication. The united network-channel coding method and device and the relay node are beneficial to improving signal forwarding efficiency, and reducing energy consumption in the signal forwarding process. The method comprises the steps that signal sequences of a plurality of users are received, and a plurality of estimation sequences corresponding to the signal sequences of the users are obtained; the estimation sequences are interlaced, and bit sequences are obtained; according to the bit sequences, signal forwarding sequences are generated; the signal forwarding sequences are sent to a target node, so that the target node can conduct united network and channel iterative decoding according to the signal sequences of the users and the signal forwarding sequences conveniently. The united network-channel coding method and device and the relay node are applied to united network-channel coding of a wireless multiple access relay network.
Description
Technical field
The present invention relates to wireless communication technology field, relate in particular to a kind of joint network channel code method, equipment and via node.
Background technology
Relay cooperative communication technology, by inquiring into signal directly and trunk channel transmits, obtains transmission diversity, can effectively resist the impact of multipath faidng.When obtaining transmission diversity, obtain diversity gain, relay cooperative communication can also improve the throughput of system, reduces user's transmitted power, reduces presence of intercell interference, the covering of extended network.
In relay cooperative mechanics of communication, communication is after more than the coding punching of source node is deleted, by coding after information modulated signal broadcast transmission to destination node and via node, the signal of via node reception sources node now also carries out respectively decoding, cyclic redundancy check (CRC) (CyclicRedundancy Check, be called for short CRC), after coding, by deleting remaining modulation, the information sequence that via node generates two users adopts the strategy forwarding to be one by one forwarded to destination node.
State in realization via node and forward in the process of user data, inventor finds when multiple users access a via node simultaneously, if adopt forwarding strategy one by one, can cause signal forward efficiency significantly to reduce and in signal forwarding energy consumption large.
Summary of the invention
Embodiments of the invention provide a kind of joint network channel code method, equipment and via node, are conducive to improve signal forward efficiency and reduce the energy consumption in signal repeating process simultaneously.
For achieving the above object, embodiments of the invention adopt following technical scheme:
First aspect, provides a kind of method of joint network channel code, comprising:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
To destination node, send described forward signal sequence, so that described destination node carries out joint network channel iterative decoding according to described subscriber signal sequence and described forward signal sequence.
In the first mode in the cards, in conjunction with first aspect, specifically comprise: described described multiple estimated sequences are interweaved, obtain bit sequence and comprise:
After described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and described multiple bit sequences are alternately obtained to described bit sequence by bit.
In the second mode in the cards, in conjunction with obtaining corresponding multiple bit sequences after described multiple estimated sequences being interweaved separately respectively described in the first mode in the cards, and described multiple bit sequences alternately obtained to described bit sequence by bit specifically comprise:
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence.
In the third possible implementation, in conjunction with first aspect, described described multiple estimated sequences are interweaved, obtain bit sequence and comprise:
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence.
In the 4th kind of mode in the cards, in conjunction with interweaving after described multiple estimated sequences being replaced by bit described in the third mode in the cards, obtain described bit sequence and specifically comprise:
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode.
In the 5th kind of mode in the cards, in conjunction with first aspect, described destination node carries out joint network channel iterative decoding according to described user's burst and described forward signal sequence and comprises:
Described multiple users' burst is obtained to multiple posteriority log-likelihood ratio sequences that described multiple users' burst is corresponding with described forward signal sequence by iterative decoding respectively;
Respectively described multiple posteriority log-likelihood ratio sequences are done to hard decision and obtain corresponding multiple estimated information sequences.
Second aspect, provides a kind of equipment of joint network channel code, comprising:
Source signal coding unit, for encoding user's data sequence, delete remaining and the user's that modulation generation is corresponding burst and being sent to relay process unit;
Relay process unit, for:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
To the target decoding unit as destination node, send described forward signal sequence, so that described destination node carries out joint network channel iterative decoding according to described user's burst and described forward signal sequence;
Target decoding unit, for described forward signal sequence and described multiple users' burst being carried out to joint network channel iterative decoding, obtains respectively multiple users' estimated information sequence, recovers described multiple users' data sequence.
In the possible implementation of the first, in conjunction with second aspect, described relay process unit specifically for:
After described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and described multiple bit sequences are alternately obtained to described bit sequence by bit.
In the possible implementation of the second, in conjunction with the possible implementation of the first, described relay process unit specifically for:
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence.
In the third possible implementation, in conjunction with second aspect, described relay process unit specifically also for:
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence.
In the 4th kind of mode in the cards, in conjunction with the third mode in the cards, described relay process unit specifically for:
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode.
In the 5th kind of mode in the cards, in conjunction with second aspect, comprise:
Described target decoding unit specifically for:
Described multiple users' burst is obtained to multiple posteriority log-likelihood ratio sequences that described multiple users' burst is corresponding with described forward signal sequence by iterative decoding respectively;
Respectively described multiple posteriority log-likelihood ratio sequences are done to hard decision and obtain corresponding multiple estimated information sequences.
The third aspect, provides a kind of via node, comprising: receiver, processor and transmitter;
Described receiver is for multiple users' burst;
Described processor is used for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
Described estimated sequence is interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
Described transmitter is for sending described forward signal sequence to destination node, receives multiple users' burst and obtains multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
To destination node, send described forward signal sequence, so that described destination node carries out joint network channel iterative decoding according to described subscriber signal sequence and described forward signal sequence.
Described destination node carries out joint network channel iterative decoding according to described user's burst and described forward signal sequence.
In the possible implementation of the first, in conjunction with the third aspect, described processor also for: after described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and described multiple bit sequences alternately obtained to described bit sequence by bit.
In the possible implementation of the second, in conjunction with the possible implementation of the first, described processor specifically for:
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence.
In the third mode in the cards, in conjunction with the third aspect, described processor also for:
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence.
In the 4th kind of mode in the cards, in conjunction with the third mode in the cards, described processor specifically for:
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode.
Method, equipment and the via node of the joint network channel code that the embodiment of the present invention provides, can improve the efficiency that signal forwards by multiple user data sequences being carried out to network-channel combined coding and corresponding joint iterative decoding processing, reduce the energy consumption in signal forwarding simultaneously, improved the performance of system.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
The schematic flow sheet of the method for a kind of joint network channel code that Fig. 1 provides for embodiments of the invention;
A kind of encoding efficiency analogous diagram of the method for the joint network channel code that Fig. 2 provides for embodiments of the invention;
The another kind of encoding efficiency analogous diagram of the method for the joint network channel code that Fig. 3 provides for embodiments of the invention;
Another encoding efficiency analogous diagram of the method for the joint network channel code that Fig. 4 provides for embodiments of the invention;
Another encoding efficiency analogous diagram of the method for the joint network channel code that Fig. 5 provides for embodiments of the invention;
The device structure schematic diagram of a kind of joint network channel code that Fig. 6 provides for embodiments of the invention;
A kind of via node structural representation that Fig. 7 provides for embodiments of the invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Based on the embodiment in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
Multiple estimated sequences of multiple users' that the present invention is received and processed by via node burst, wherein multiple estimated sequences of multiple users' burst can be by least two source nodes by independently user's the data sequence u of statistics receiving
1and u
2(in embodiments of the invention, as an example of two users example, describing), length is respectively K; Then by u
1and u
2adopt respectively two-dimentional Turbo coding independently to encode, obtain coded sequence c
1and c
2, length is respectively 3k, here c
iby u
i, p
i1and p
i2form i ∈ { 1,2}, p
i1and p
i2for to user S
idata sequence u
icarry out two-dimentional Turbo two the check bit data sequences that obtain of encoding; Finally to the coded sequence c obtaining
1and c
2more than deleting, after modulation, obtain two users' burst x
1and x
2, via node receives x
1and x
2burst after plus noise is designated as y
r, 1and y
r, 2.What the embodiment of the present invention provided is designated as y to burst
r, 1and y
r, 2processing method be specially with reference to shown in Fig. 1, the method for a kind of joint network channel code providing, comprises following flow process:
101, via node receives multiple users' burst and obtains multiple estimated sequences of corresponding multiple users' burst.
Take two users' burst as example:
Be specially the reception signal y of relay process unit in the joint network channel code equipment burst to two users
r, 1and y
r, 2carry out respectively Turbo decoding, obtain the first corresponding estimated sequence
with the second estimated sequence
length is respectively K.
102, via node interweaves to multiple estimated sequences, obtains bit sequence.
Concrete, the relay process unit in joint network channel code equipment is by the first estimated sequence
with the second estimated sequence
carry out respectively cyclic redundancy check (CRC), through verification, there is no mistake, two estimated sequences are interweaved respectively, after interweaving, obtain bit sequence, wherein this bit sequence length is 2k.
Refer to interweaving here to multiple estimated sequences are changed message structure to greatest extent and do not change the mode of the information content, for example, estimated sequence comprises that 4 message that are comprised of 4 bits divide into groups, be the data that comprise 4 bits in each message grouping, the 1st bit in 4 in this estimated sequence message groupings in succession taken out, and allow these 4 the 1st bits form a new bit groupings, be called the first frame, 2～4 bits in 4 message groupings, also do same processing, then transmit successively the frame of the 1st bit composition, the frame of the 2nd bit composition, ..., during the transmission, if frame 2 is lost, if do not interweaved, that will lose a certain whole message grouping, but adopted, interweave, and only the 2nd bit drop-out of each message grouping, recycling chnnel coding, all the message in grouping still can be recovered.
Optionally, step 102 replaces the bit sequence of multiple estimated sequences and then interweaves for via node.
What this process was concrete comprises:
A, multiple estimated sequences are carried out to alternative arrangement according to the mode by bit obtain corresponding estimated sequence;
Here replace specific as follows described in:
For example, 3 estimated sequence { a that length is N
1, a
2..., a
n-1, a
n, { b
1, b
2..., b
n-1, b
nand { c
1, c
2..., c
n-1, c
n, after replacing by bit, obtain the estimated sequence { a that length is 3N
1, b
1, c
1, a
2, b
2, c
2..., a
n-1, b
n-1, c
n-1, a
n, b
n, c
n, be certainly equally applicable to multiple estimated sequences alternately, just take 3 as example, describe here.
B, the corresponding estimated sequence that the mode by by bit is carried out obtaining after alternative arrangement are arranged and are obtained bit sequence according to new arrangement mode.
The process interweaving can, with reference to step 102, not describe in detail here.
Same two users' that receive take via node burst is as example: now via node by the first estimated sequence
with the second estimated sequence
two users' burst replaces by bit, and the length after replacing is respectively 2k, then interweaves, and then obtains bit sequence, and length is 2k.
Or optional, step 102 is to obtain corresponding multiple bit column after via node interweaves described multiple estimated sequences separately respectively, and described multiple bit sequences are alternately obtained to described bit sequence by bit.
What this process was concrete comprises:
A, the bit in multiple estimated sequences is arranged according to new arrangement mode respectively;
The process interweaving can, with reference to step 102, not describe in detail here.
B, by re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain bit sequence.
Here replace specific as follows described in:
For example, 3 estimated sequences that re-start after bit arrangement are that length is the estimated sequence { a of N
1, a
2..., a
n-1, a
n, { b
1, b
2..., b
n-1, b
nand { c
1, c
2..., c
n-1, c
n, after replacing by bit, obtain the estimated sequence { a that length is 3N
1, b
1, c
1, a
2, b
2, c
2..., a
n-1, b
n-1, c
n-1, a
n, b
n, c
n, be certainly equally applicable to multiple estimated sequences alternately, just take 3 as example, describe here.
Same two users' that receive take via node burst is as example: now via node by the first estimated sequence
with the second estimated sequence
interweave and then replace separately respectively, after replacing, obtain the bit sequence that bit sequence length is 2k.
103, according to bit sequence, generate forward signal sequence.
Via node carries out the alternately list entries as encoder using the bit sequence obtaining by interweaving by bit, and encoder list entries length is 2k, the sequence c obtaining after coding
r, length is 2k, here c
rfor passing through the encoder output verification sequence p of via node
r, with p
i1and p
i2correspondence, i ∈ { 1,2}.To c
rafter deleting remaining modulation, obtain forward signal sequence x
r, destination node receives x
rforward signal sequence after plus noise is designated as y
dR.
After the bit number of the bit sequence that can encode by adjustment before coding here and coding, the bit number of the bit sequence of output is adjusted effectiveness, here can adopt RSC (Recursive Systematic Convolutional Code, recursive system volume and code) encoder to encode.By above process, to the processing of multiple user data sequences, can reduce the additional check bit number in via node signal repeating process, improved the relay process cell signal forward efficiency as via node, and then can obtain better spectrum efficiency, save the energy loss that signal forwards.
For each user Si (i ∈ { 1,2}), its data sequence u
ivia the two-dimentional Turbo coding of source signal coding unit and the RSC coding of via node, entirety is rendered as a three-dimensional Turbo code.Two-dimentional Turbo coding by source signal coding unit improves the correct decoding probability of via node, thereby improve via node, participates in the probability cooperating.By the combined coding of relaying, improve the forward efficiency of via node, obtain higher coding gain simultaneously.
104, to destination node, send forward signal sequence, so that destination node carries out joint network channel iterative decoding according to user's burst and forward signal sequence.
The method of the joint network channel code that the embodiment of the present invention provides, thereby can improve the efficiency that signal forwards by multiple users' data sequence being carried out to network-channel combined coding at via node place, reduce the energy consumption in signal forwarding simultaneously, improved the performance of system.
Further, described destination node carries out joint network channel iterative decoding according to user's burst and forward signal sequence and specifically comprises:
A, destination node obtain by iterative decoding multiple posteriority log-likelihood ratio sequences that multiple users' burst is corresponding with forward signal sequence respectively by multiple users' burst.
B, destination node do hard decision to multiple posteriority log-likelihood ratio sequences respectively and obtain corresponding multiple estimated information sequences.
Destination node is according to the reception signal y of two users' burst
d, i, i ∈ { 1,2}, (the wherein reception signal y of two subscriber signal sequences
d, 1and y
d, 2to two subscriber signal sequence x
1and x
2after plus noise, obtain) and the reception signal y of forward signal sequence
dRcarry out joint network-channel iterative decoding, be specially by 5 parallel decoders and will receive respectively burst y
d, i, i ∈ { 1,2} and y
dRthe corresponding likelihood ratio sequence that demodulation process obtains
with
(i ∈ 1,2}), wherein
with
(i ∈ { 1,2}) is for respectively by burst y
d, i, i ∈ { 1,2} and y
dRthe u calculating
i, p
i1, p
i2, p
rthe likelihood ratio sequence that the log-likelihood ratio of middle bit forms, p
i1and p
i2for the data sequence u to user
icarry out two-dimentional Turbo two the check bit data sequences that obtain of encoding, u
i, p
i1and p
i2formation is to u
icoded sequence c after coding
i; p
rfor the check bit data sequence of the encoder output of via node.Through iterative decoding, finally obtain user's burst u
1and u
2posteriority log-likelihood ratio sequence L (u
1) and L (u
2), and by posteriority log-likelihood ratio sequence is done to final hard decision, obtain estimated sequence
with
Due to the symmetry of system in decode procedure, so with to y
d, 1and y
dRiterative decoding is example, is specially: destination node receives user's burst y
d, 1with forward signal sequences y
dRcalculate the likelihood ratio sequence of the log-likelihood ratio formation of the bit in bit sequence in burst.
To user data sequence u
1, the external information transmittance process of three decoders (three decoders are soft inputting and soft output (Soft-In and Soft-Out is called for short SISO) decoder here) of its correspondence is:
Here
with
expression is corresponding to user's data sequence u
1the external information sequence of three SISO decoders output, with the irrelevant data sequence u about user of SISO decoder input
1log-likelihood ratio sequence;
with
represent the prior information sequence of three SISO decoders input, about user's data sequence u
1priori log-likelihood ratio sequence.At each, take turns in iterative decoding process the input prior information sequence of each SISO decoder
by the output external information sequence of two other SISO decoder in previous round iterative decoding process
(j=1,2,3, and j ≠ i) conversion obtains.In first iterative decoding process, the input prior information sequence of each SISO decoding
be zero; π
i(), i ∈ { 1, the 2} conversion that represents to interweave, π
1() is corresponding with the interleaver in two-dimentional Turbo encoder in source signal encoder, π
2() is corresponding with the interleaver in relay process device.
After several iteration of taking turns, finally obtain user's data sequence u
1posteriority log-likelihood ratio sequence be
Do according to this final hard decision, obtain estimated sequence
Due to the symmetry of system, user's data sequence u
2according to the method, draw corresponding estimated sequence
Above-mentioned destination node combined channel-network decode procedure carries out obtaining after combined channel-network code at via node place, can realize like this fast decoding, and then improve system effectiveness and performance.
Concrete, for each user Si (i ∈ { 1,2}), its data sequence ui encodes via the two-dimentional Turbo coding of source signal coding unit and the RSC of relay process unit, and entirety is rendered as a three-dimensional Turbo code.Two-dimentional Turbo coding by source signal coding unit improves the correct decoding probability of via node, thereby improve via node, participates in the probability cooperating.By the combined coding of relaying, improve the forward efficiency of via node, obtain higher coding gain simultaneously.
The present invention has carried out verification according to Computer Simulation to the method for joint network-channel combined coding provided by the invention, shown in Fig. 2 and Fig. 3 or Fig. 4 and Fig. 5, is described as follows:
Fig. 2 and Fig. 3 be and via node decoding errorless two kind scenes wrong for via node decoding respectively, wherein provided Distributed T urbo code (Distributed Turbo Code, be called for short DTC), based on 4 joint network-Turbo code (the Joint Network TurboCode (4) that take turns iterative decoding, be called for short JNTC (4)) and based on 16 joint network-Turbo code (the Joint Network Turbo Code (16) that take turns iterative decoding, be called for short JNTC (16)) system stage engineering (Phase Engineering Report, be called for short PER) performance and source node and via node signal noise ratio of upper link (Signal Noise Ratio, be called for short SNR) curve.As can be seen from the figure joint network-Turbo encoding scheme that the present invention proposes has very large performance gain compared with Distributed T urbo code.To the errorless scene of via node decoding, at PER, be 10
-2time, the present invention puies forward combined coding scheme respectively the performance gain of 4dB (4 take turns iterative decoding) and 5dB (16 take turns iterative decoding).For the wrong scene of via node decoding, there is similar performance gain.Under the wrong model of via node decoding, destination node end performance is slightly better than the errorless model of via node decoding, be because the present invention adopt be Turbo code, when via node is positioned at source user 1/4 position, as the source node of source signal coding unit and via node signal noise ratio of upper link than source node and high more than 20 dB of destination node up link SNR, so the probability correct decoding that via node can be very high, cooperation transmission; Due in the wrong situation of via node decoding, the up link SNR of via node and destination node is than the high dB more than 4 of the up link SNR of source and destination node again, so final performance is better than errorless situation.
Fig. 4 and Fig. 5 are respectively Distributed T urbo code under the wrong and errorless two kinds of scenes of via node decoding of via node decoding, based on 4, take turns joint network-Turbo code JNTC (4) of iterative decoding and based on 16 error rate (the Bit Error Rate that take turns the system of joint network-Turbo code JNTC (16) of iterative decoding, be called for short BER) curve of performance and source node and via node signal noise ratio of upper link (Signal Noise Ratio, abbreviation SNR).The present invention puies forward combined coding scheme has significant performance gain compared with Distributed T urbo code plan.
To sum up simulation result shows, compared with traditional multiple step format Turbo code, it is 2 gain that this programme can obtain order of diversity, effectively improves error bit ability and the mistake frame performance of system.
The method of the joint network channel code that the embodiment of the present invention provides, can be by multiple users' data sequence being carried out at via node place the processing of the joint iterative decoding of joint network-channel combined coding and correspondence, thereby improved the efficiency that signal forwards, reduce the energy consumption in signal forwarding simultaneously, improved the performance of system.
The invention provides a kind of equipment 2 of joint network channel code, shown in Fig. 6, comprise source signal coding unit 21, relay process unit 22 and target decoding unit 23, wherein:
Source signal coding unit 21, for generating user's data sequence corresponding user's burst and being sent to relay process unit;
Receive multiple users' burst and obtain multiple estimated sequences of corresponding multiple users' burst;
Multiple estimated sequences are interweaved, obtain bit sequence;
According to bit sequence, generate forward signal sequence;
To the target decoding unit as destination node, send forward signal sequence;
In the present embodiment, source signal coding unit 21, can be used as source node user's data sequence is encoded, deleted remaining and the user's that modulation generation is corresponding burst and is sent to relay process unit.
In the present embodiment, target decoding unit 23, can carry out forward signal sequence and multiple users' burst joint network channel iterative decoding, obtains respectively multiple users' estimated information sequence, recovers multiple users' data sequence.
The equipment of the joint network channel code that the embodiment of the present invention provides, can be by multiple users' data sequence being carried out to joint network-channel combined coding, thereby improved the efficiency that signal forwards, reduced the energy consumption in signal forwarding simultaneously, improved the performance of system.
Optionally, relay process unit 22 specifically for:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding multiple users' burst;
After multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and multiple bit sequences are alternately obtained to bit sequence by bit;
According to bit sequence, generate forward signal sequence;
To target decoding unit, send forward signal sequence.
Optionally, relay process unit 22 specifically for:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding multiple users' burst;
Bit in multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain bit sequence;
According to bit sequence, generate forward signal sequence;
To target decoding unit, send forward signal sequence.
Optionally, relay process unit 22 specifically for:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding multiple users' burst;
After multiple estimated sequences are replaced by bit, interweave and obtain bit sequence;
According to bit sequence, generate forward signal sequence;
To target decoding unit, send forward signal sequence.
Optionally, relay process unit 22 specifically for:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding multiple users' burst;
Multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that mode by by bit is carried out obtaining after alternative arrangement is arranged and is obtained bit sequence according to new arrangement mode;
According to bit sequence, generate forward signal sequence;
To target decoding unit, send forward signal sequence.
Optionally, target decoding unit 23 specifically for, multiple users' burst is obtained to multiple posteriority log-likelihood ratio sequences that multiple users' burst is corresponding with forward signal sequence by iterative decoding respectively;
Respectively multiple posteriority log-likelihood ratio sequences are done to hard decision and obtain corresponding multiple estimated information sequences, recover multiple users' data sequence.
The equipment of the network channel code that the embodiment of the present invention provides, can to multiple users' data sequence, carry out by via node the processing of the joint iterative decoding of joint network-channel combined coding and correspondence, thereby improved the efficiency that signal forwards, reduce the energy consumption in signal forwarding simultaneously, improved the performance of system.
The invention provides a kind of via node 3, the relay process unit of the equipment of the joint network channel code providing as above-described embodiment, shown in Fig. 7, comprising: receiver 31, processor 32 and transmitter 33;
Described receiver 31 is for multiple users' burst;
Described processor 32 for:
Obtain multiple estimated sequences of corresponding multiple users' burst;
Estimated sequence is interweaved, obtain bit sequence;
According to bit sequence, generate forward signal sequence;
Optionally, processor 32 specifically for:
Obtain multiple estimated sequences of corresponding multiple users' burst;
After multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and multiple bit sequences are alternately obtained to bit sequence by bit;
According to bit sequence, generate forward signal sequence.
Optionally, described processor 32 specifically for:
Obtain multiple estimated sequences of corresponding multiple users' burst;
Bit in multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain bit sequence;
According to bit sequence, generate forward signal sequence.
Optionally, processor 32 specifically for:
Obtain multiple estimated sequences of corresponding multiple users' burst;
After multiple estimated sequences are replaced by bit, interweave and obtain bit sequence;
According to bit sequence, generate forward signal sequence.
Optionally, described processor 32 specifically for:
Obtain multiple estimated sequences of corresponding multiple users' burst;
Multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that mode by by bit is carried out obtaining after alternative arrangement is arranged and is obtained bit sequence according to new arrangement mode;
According to bit sequence, generate forward signal sequence.
Here this via node can also comprise at least one memory 34, wherein processor 32, memory 34, receiver 31 and transmitter 33 are connected by bus 35 and complete mutual communication, this bus 35 can be industry standard architecture (Industry StandardArchitecture, referred to as ISA) bus, peripheral component interconnect (Peripheral Component, referred to as PCI) bus or extended industry-standard architecture (Extended IndustryStandard Architecture, referred to as EISA) bus etc.This bus 35 can be divided into address bus, data/address bus, control bus etc.For ease of representing, in Fig. 7, only with a thick line, represent, but do not represent only to have the bus of a bus or a type.Wherein:
The via node that the embodiment of the present invention provides, can process the joint network channel code of multiple user data sequences and corresponding joint iterative decoding, thereby has improved the efficiency that signal forwards, and reduces the energy consumption in signal forwarding simultaneously.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can complete by the relevant hardware of program command, aforesaid program can be stored in a computer read/write memory medium, this program, when carrying out, is carried out the step that comprises said method embodiment; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CDs.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited to this, any be familiar with those skilled in the art the present invention disclose technical scope in; can expect easily changing or replacing, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of described claim.
Claims (16)
1. a method for joint network channel code, is characterized in that, comprising:
Receive multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
To destination node, send described forward signal sequence, so that described destination node carries out joint network channel iterative decoding according to described subscriber signal sequence and described forward signal sequence.
2. method according to claim 1, is characterized in that, described described multiple estimated sequences is interweaved, and obtains bit sequence and comprises:
After described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit column, and described multiple bit sequences are alternately obtained to described bit sequence by bit.
3. method according to claim 2, it is characterized in that, describedly obtain corresponding multiple bit sequences after described multiple estimated sequences are interweaved separately respectively, and described multiple bit sequences are alternately obtained to described bit sequence by bit specifically comprise:
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence.
4. method according to claim 1, is characterized in that, described described multiple estimated sequences is interweaved, and obtains bit sequence and comprises:
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence.
5. method according to claim 4, is characterized in that, described interweaving after described multiple estimated sequences are replaced by bit obtains described bit sequence and specifically comprise:
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode.
6. an equipment for joint network channel code, is characterized in that, comprises source signal coding unit, relay process unit and target decoding unit, wherein:
Described source signal coding unit, for generating multiple users' data sequence corresponding multiple users' burst and be sent to described relay process unit;
Described relay process unit, for:
Receive described multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
To described target decoding unit, send described forward signal sequence;
Described target decoding unit, for carrying out described forward signal sequence and described multiple users' burst joint network channel iterative decoding.
7. equipment according to claim 6, is characterized in that, described relay process unit specifically for:
Receive described multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
After described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and described multiple bit sequences are alternately obtained to described bit sequence by bit;
According to described bit sequence, generate forward signal sequence;
To described target decoding unit, send described forward signal sequence.
8. equipment according to claim 6, is characterized in that, described relay process unit specifically for:
Receive described multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence;
According to described bit sequence, generate forward signal sequence;
To described target decoding unit, send described forward signal sequence.
9. equipment according to claim 6, is characterized in that, described relay process unit specifically for:
Receive described multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence;
According to described bit sequence, generate forward signal sequence;
To described target decoding unit, send described forward signal sequence.
10. equipment according to claim 6, is characterized in that, described relay process unit specifically for:
Receive described multiple users' burst and obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode;
According to described bit sequence, generate forward signal sequence;
To described target decoding unit, send described forward signal sequence.
11. according to the equipment described in claim 6 to 10 any one, it is characterized in that, described target decoding unit specifically for:
Described multiple users' burst is obtained to multiple posteriority log-likelihood ratio sequences that described multiple users' burst is corresponding with described forward signal sequence by iterative decoding respectively;
Respectively described multiple posteriority log-likelihood ratio sequences are done to hard decision and obtain corresponding multiple estimated information sequences, recover described multiple users' data sequence.
12. 1 kinds of via nodes, is characterized in that, comprising: receiver, processor and transmitter;
Described receiver is for multiple users' burst;
Described processor is used for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
Described estimated sequence is interweaved, obtain bit sequence;
According to described bit sequence, generate forward signal sequence;
Described transmitter is for sending described forward signal sequence to destination node, so that described destination node carries out joint network channel iterative decoding according to described user's burst and described forward signal sequence.
13. via nodes according to claim 12, is characterized in that, described processor specifically for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
After described multiple estimated sequences are interweaved separately respectively, obtain corresponding multiple bit sequences, and described multiple bit sequences are alternately obtained to described bit sequence by bit;
According to described bit sequence, generate forward signal sequence.
14. via nodes according to claim 12, is characterized in that, described processor specifically for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
Bit in described multiple estimated sequences is arranged according to new arrangement mode respectively;
By re-starting multiple estimated sequences after bit arrangement, according to the mode by bit, carry out alternative arrangement and obtain described bit sequence;
According to described bit sequence, generate forward signal sequence.
15. via nodes according to claim 12, is characterized in that, described processor specifically for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
After described multiple estimated sequences are replaced by bit, interweave and obtain described bit sequence;
According to described bit sequence, generate forward signal sequence.
16. via nodes according to claim 12, is characterized in that, described processor specifically for:
Obtain multiple estimated sequences of corresponding described multiple users' burst;
Described multiple estimated sequences are carried out to alternative arrangement according to the mode by bit and obtain corresponding estimated sequence;
The corresponding estimated sequence that is undertaken obtaining after alternative arrangement by the described mode by bit is arranged and obtained described bit sequence according to new arrangement mode;
According to described bit sequence, generate forward signal sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210387332.0A CN103731234A (en) | 2012-10-12 | 2012-10-12 | United network-channel coding method and device and relay node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210387332.0A CN103731234A (en) | 2012-10-12 | 2012-10-12 | United network-channel coding method and device and relay node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103731234A true CN103731234A (en) | 2014-04-16 |
Family
ID=50455175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210387332.0A Pending CN103731234A (en) | 2012-10-12 | 2012-10-12 | United network-channel coding method and device and relay node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103731234A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107005502A (en) * | 2014-12-16 | 2017-08-01 | 大陆汽车有限公司 | Method and receiving device for receiving radio signal in receiving device |
-
2012
- 2012-10-12 CN CN201210387332.0A patent/CN103731234A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107005502A (en) * | 2014-12-16 | 2017-08-01 | 大陆汽车有限公司 | Method and receiving device for receiving radio signal in receiving device |
| CN107005502B (en) * | 2014-12-16 | 2020-08-25 | 大陆汽车有限公司 | Method for receiving a radio signal in a receiving device and receiving device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106100794B (en) | Coding cooperation method based on punched polarization code | |
| CN101710850B (en) | Convolution Turbo encoding method and device for realizing encoding method | |
| CN104137464A (en) | Method of transmitting a digital signal for a semi-orthogonal ms-marc system, and corresponding programme product and relay device | |
| CN105122654A (en) | Systems and methods for encoding and decoding of check-irregular non-systematic ira codes | |
| CN106100795B (en) | Polar code coding cooperation method based on Plotkin construction and information bit re-dormancy | |
| CN102742201B (en) | Method for transmitting a digital signal for a semi-orthogonal frame system having half-duplex relay, and corresponding program product and relay device | |
| CN101867451A (en) | Multi-user network coding communication method with high-speed parallel encoding and decoding structure | |
| CN103269229A (en) | Mixed iterative decoding method for LDPC-RS two-dimensional product code | |
| CN104137456A (en) | Method for transmitting a digital signal for a non-orthogonal ms-marc system, and corresponding programme product and relay device | |
| CN103347202B (en) | EWF code coding method in a kind of wireless communication system | |
| CN102724021A (en) | Collaborative transmission method based on distributed interweaved and group encoding | |
| CN103069728A (en) | Method and device for relaying in a communication network | |
| CN105453467A (en) | Transmission and receiving method in a wireless communication system | |
| CN103338091A (en) | Cooperative transmission method based on distributed non-binary LDPC code | |
| Hu et al. | Exploiting Slepian-Wolf codes in wireless user cooperation | |
| CN103078716A (en) | Distributed 3-D Turbo code-based relay transmission method | |
| CN113037298A (en) | System and method for filling interference information based on low-code-rate LDPC code | |
| CN102412935B (en) | Multiple Access Relay accesses channel based on the network coding system of soft bit information and method | |
| CN100486235C (en) | Iterative receiving method for maintaining soft information | |
| CN102497250B (en) | Multiple access channel adaptive coding relay system and method | |
| CN116418395A (en) | Relay laser communication coding method for FSO system | |
| CN103731234A (en) | United network-channel coding method and device and relay node | |
| Hatefi et al. | Joint channel-network coding for the semi-orthogonal multiple access relay channel | |
| CN107257244A (en) | A kind of fountain code encoding method based under broadcast environment | |
| CN111031559B (en) | Energy-carrying transmission protocol implementation method applied to coding energy-carrying relay cooperation system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140416 |