CN102237967B - A kind of data block processing method and its device of network code - Google Patents
A kind of data block processing method and its device of network code Download PDFInfo
- Publication number
- CN102237967B CN102237967B CN201110215585.5A CN201110215585A CN102237967B CN 102237967 B CN102237967 B CN 102237967B CN 201110215585 A CN201110215585 A CN 201110215585A CN 102237967 B CN102237967 B CN 102237967B
- Authority
- CN
- China
- Prior art keywords
- information
- data
- data length
- length
- network code
- 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.)
- Active
Links
Abstract
A kind of data block processing method and its device of network code, method, including：Receive multiple information from multiple source nodes；Isometric data processing is carried out to each information received, keeps the data length of each information equal；Network code is carried out to each information Jing Guo isometric data processing, and the information after coding is sent to destination node；Wherein described carries out isometric data processing to each information received, and the step for keeping the data length of each information equal further includes determining the data length of each information, therefrom finds longest data length；Be set equal to or more than the longest data length reference data length；It is filled by data, the data length of each information is made to be equal to the reference data length.
Description
Technical field
The present invention relates to the network coding systems in wireless communication, more particularly to a kind of data block size in network code
Processing method and its device.
Background technology
The mode of traditional communication network transmission data is storage forwarding, i.e., in addition to the sending node of data and receiving node
Node in addition does not do any processing to data content, only serves the effect of transponder.
Network code (Network Coding) theory is an important breakthrough in information theory field at the beginning of 21 century, it
Core concept is to carry out linear or nonlinear processing to the information received on each channel on each node in a network,
It is then forwarded to downstream node, intermediate node or relaying play the role of encoder or signal processor, rather than simple
Amplification sends (Amplify-and-Forward) or decoding forwarding (Decode-and-Forward), to further improve
The handling capacity of network.In the network communication of single point-to-multipoint, information can be made to transmit by way of meshed network coding
Rate reaches the maximum stream flow of network, thus network code be can with the effective ways of Approximation Network Capacity Theory transmission limit,
Fundamental change is brought for network communication.
Physical-layer network coding PNC (the Physical-layer Network developed on the basis of network code
Coding transmission time slot) can further be saved.Since the signal that wireless network is sent is electromagnetic wave (Electro-
Magnetic) signal, its one are noteworthy characterized by the characteristic with broadcast, and the signal that node is sent can be by other many sections
Point receives, and a node can also receive the signal that many nodes are sent simultaneously.The agreement of many wireless networks, such as
IEEE802.11 treats multiple signals received as interference, all attempts to suppress interference signal in processing, for example adopt
With receiver design or transmitting terminal precoding etc.；And physical-layer network coding is utilized this symbol that is multiple while receiving and increases nothing
The capacity of gauze network.It realizes such function, becomes mesh in the signal processing that relay node is required to by while being received
The signal that mark node can identify, destination node are also required to therefrom extract the signal needed inside the information of transmission.
In wireless communications, either network code or physical-layer network coding are required for node to receive multiple nodes
Information process, therefore inevitably encounter and receive information situation of different sizes, to can not directly do information
Merging treatment.
Invention content
The main object of the present invention is to solve in existing wireless communications network code to receiving different size of information
The merging treatment that information can not directly be done, the present invention provides a kind of processing method of data block in wireless communication system, the party
Method can be unified by multiple sizes for receiving information, is handled for follow-up.
According to an aspect of the present invention, the present invention provides a kind of data block processing methods of network code, including：
Receive multiple information from multiple source nodes；
Isometric data processing is carried out to each information received, keeps the data length of each information equal；
Network code is carried out to each information Jing Guo isometric data processing, and the information after coding is sent to purpose section
Point.
Wherein, the described pair of each information received carries out isometric data processing, keeps the data length of each information equal
Step includes：
It determines the data length of each information, therefrom finds longest data length；
Be set equal to or more than the longest data length reference data length；
It is filled by data, the data length of each information is made to be equal to the reference data length.
In addition, described filled by data, the data length of each information is made to be equal to the reference data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to each information, given data is added behind each information respectively.
Wherein, described to be filled by data, so that the data length of each information is equal to the reference data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to each information, adds respective partial data respectively behind each information.
Wherein, described to be filled by data, so that the data length of each information is equal to the reference data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to partial information adds given data behind the partial information；
The quantity that filling data are needed according to other information, adds the part of each self-information respectively behind other information
Data.
Wherein, described to be filled by data, so that the data length of each information is equal to the reference data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are at least needed according to an information, adds another information behind one information
Partial data.
According to another aspect of the present invention, the present invention also provides a kind of data block processing units of network code, including：
Receiving module receives multiple information from multiple source nodes；
Processing module carries out isometric data processing to each information received, keeps the data length of each information equal；
Network code module carries out network code to each information Jing Guo isometric data processing, and by the letter after coding
Breath is sent to destination node.
In addition, the processing module further includes：
Determining module, determines the data length of each information, therefrom finds longest data length；
Setup module, be set equal to or more than the longest data length reference data length；
Module is filled, is filled by data, the data length of each information is made to be equal to the reference data length.
Compared with prior art, the beneficial effects of the present invention are：
1, the present invention will receive multiple information from multiple source nodes and carry out isometric data processing, make the number of each information
According to equal length, it is convenient for subsequent network coded treatment.
2, the information data of Selective filling can be given data, can also be receive the respective partial data of information or
Other data, filling position is unlimited, convenient for the isometric processing to information data.
Description of the drawings
Fig. 1 is the flow chart of the data block processing method of inventive network coding；
Fig. 2 is the uplink communication structure diagram of two users of the invention；
Fig. 3 is the size of data processing block diagram of the embodiment of the present invention one；
Fig. 4 is the size of data processing block diagram of the embodiment of the present invention two；
Fig. 5 is the uplink communication structure diagram of the multiple users of the present invention；
Fig. 6 is the size of data processing block diagram of the embodiment of the present invention three；
Fig. 7 is the size of data processing block diagram of the embodiment of the present invention four；
Fig. 8 is the size of data processing block diagram of the embodiment of the present invention five；
Fig. 9 is the structure diagram of the data block processing unit of inventive network coding.
Specific implementation mode
Below in conjunction with attached drawing to a preferred embodiment of the present invention will be described in detail, it should be understood that described below is excellent
Select embodiment only for the purpose of illustrating and explaining the present invention and is not intended to limit the present invention.
The present invention provides a kind of data block processing methods of network code, and process flow is as shown in Figure 1, include：
S11 receives multiple information from multiple source nodes；
S12 carries out isometric data processing to each information received, keeps the data length of each information equal；
S13 carries out network code to each information Jing Guo isometric data processing, and the information after coding is sent to mesh
Node.
Wherein, step S12 includes：
It determines the data length of each information, therefrom finds longest data length；
Be set equal to or more than the longest data length reference data length；
It is filled by data, the data length of each information is made to be equal to the reference data length.
The data block processing of network coding wherein of the present invention can be in any communications system such as base station, terminal, relaying
Information process unit processing；The node of any information processing unit can be single antenna, can also be multiple antennas.
For the information of multiple and different source nodes of reception, different modulating coding mode may be used in information, can also
Using identical modulation coding scheme；
The processing of information can be in electromagnetism wave zone, can also be in the domains GF or other domains；Different size of information can adopt
Reach same size with the method that Given information is filled, filling position is unlimited, and filling content is unlimited；
Operation to multiple information networks coding can be binary system exclusive or, and signal merges modulus, and signal domain merges extension,
It can also be the processing mode that other information merges.
The mode being filled can be a variety of, filled by data, and the data length of each information is made to be equal to the benchmark
Data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to each information, given data is added behind each information respectively.
Either, described to be filled by data, so that the data length of each information is equal to the reference data length, packet
It includes：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to each information, adds respective partial data respectively behind each information.
Can also be, it is described to be filled by data, so that the data length of each information is equal to the reference data length, packet
It includes：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are needed according to partial information adds given data behind the partial information；
The quantity that filling data are needed according to other information, adds the part of each self-information respectively behind other information
Data.
Alternatively, described filled by data, the data length of each information is made to be equal to the reference data length, including：
According to the reference data length, calculates separately each information and need to fill the quantity of data；
The quantity that filling data are at least needed according to an information, adds another information behind one information
Partial data.
Specifically application is in a communication network for it：
Embodiment one
As shown in Fig. 2, there are one base station and two users in a region of communication, number is sent from user to base station
According to thus constituting a uplink communication model.
Step 1：Base station receives the information of two users transmission, and message length differs；
Step 2：Base station needs to make network code to the information of two users, first has to the message length of user becoming one
It causes.
As shown in figure 3, using one of them longer information (information of user 1) as benchmark, calculate compared with short message (user
2 information) required for fill information content, the Given information of the quantity is added to compared with behind short message；
Step 3：Base station the information of two equal lengths is done into network code.
Information after network code can be re-modulated and be encoded by base station, be sent to user and done information exchange.
Embodiment two
As shown in Fig. 2, there are one base station and two users in a region of communication, number is sent from user to base station
According to thus constituting a uplink communication model.
Step 1：Base station receives the information of two users transmission, and message length differs；
Step 2：Base station needs to make network code to the information of two users, first has to the message length of user becoming one
It causes.
As shown in figure 4, using one of them longer information as benchmark, calculate big compared with the information filled required for short message
It is small, it will be blocked according to the size of required filling position compared with short message so that exercising result is consistent with required filling length,
Add the information to the filling position compared with short message；
Step 3：Base station the information of two equal lengths is done into network code.
Information after network code can be re-modulated and be encoded by base station, be sent to user and done information exchange.
Embodiment three
As shown in figure 5, there are one base station and multiple users in a region of communication, number is sent from user to base station
According to thus constituting a uplink communication model.
Step 1：Base station receives the information that multiple users send, and message length differs；
Step 2：Base station needs to merge the information work of multiple users, needs the message length of user becoming consistent.
The Information Number filled required for the information of other users can be calculated separately using longest message length as benchmark
Amount, may be used different filling modes and processes user information so that exercising result and required filling information length one
It causes, adds the information to the filling position of user information, as shown in Figure 6；The length on the basis of the length of user 1, user 2 adopt
With the mode of filling Given information, for user 3 using repetition self information and by the way of blocking, user 4 takes filling own partial
The mode of information.
Step 3：Base station the information of multiple equal lengths is done into merging treatment.
Information after merging can be re-modulated and be encoded by base station, be sent to user and done information exchange.
Example IV
As shown in Fig. 2, there are one base station and two users in a region of communication, number is sent from user to base station
According to thus constituting a uplink communication model.
Step 1：Base station receives the information of two users transmission, and message length differs；
Step 2：Base station needs to make network code to the information of two users, first has to the message length of user becoming one
It causes.
As shown in fig. 7, using one of them longer information (such as information of user 1) as benchmark, calculates and (used compared with short message
The information at family 2) required for fill information content；Intercept a part for the information of user 1, the length of length and required filling information
It spends identical, which is added in behind 2 information of user；
Step 3：Base station the information of two equal lengths is done into network code.
Information after network code can be re-modulated and be encoded by base station, be sent to user and done information exchange.
Embodiment five
As shown in Fig. 2, there are one base station and two users in a region of communication, number is sent from user to base station
According to thus constituting a uplink communication model.
Step 1：Base station receives the information of two users transmission, and message length differs；
Step 2：Base station needs to make physical-layer network coding to the information of two users, first has to the message length of user
Become consistent.
As shown in figure 8, prime information one can be repeated for user 1 using 2 times of the message length of user 1 as benchmark
It is secondary, and information is put on filling position.For user 2, the information content filled required for the information of user 2 is calculated；Interception
A part for the information of user 1, length is identical with the length of required filling information, which is added in 2 information of user
Below；
Step 3：Base station the information of two equal lengths is done into network code.
Information after network code can be re-modulated and be encoded by base station, be sent to user and done information exchange.
According to another aspect of the present invention, the present invention also provides a kind of data block processing unit of network code, such as Fig. 9
It is shown, including：
Receiving module receives multiple information from multiple source nodes；
Processing module carries out isometric data processing to each information received, keeps the data length of each information equal；
Network code module carries out network code to each information Jing Guo isometric data processing, and by the letter after coding
Breath is sent to destination node.
In addition, the processing module further includes：
Determining module, determines the data length of each information, therefrom finds longest data length；
Setup module, be set equal to or more than the longest data length reference data length；
Module is filled, is filled by data, the data length of each information is made to be equal to the reference data length.
The above content is a further detailed description of the present invention in conjunction with specific preferred embodiments, and it cannot be said that
The specific implementation of the present invention is confined to these explanations.For those of ordinary skill in the art to which the present invention belongs, exist
Under the premise of not departing from present inventive concept, a number of simple deductions or replacements can also be made, all shall be regarded as belonging to the present invention's
Protection domain.
Claims (3)
1. a kind of data block processing method of network code, which is characterized in that including：
After receiving multiple information from more than two multiple source nodes, each information of the multiple information is determined
Data length；
According to the data length of identified each information, the longest data length in the multiple information is found；
Reference data length more than the longest data length is set；
The information for needing to fill data is determined according to the reference data length, and is respectively each to need according to reference data length
The information for filling data calculates the quantity for needing to fill data；
According to the quantity for needing to fill data calculated, added respectively behind each information for needing to fill data respective
The partial data of partial data or another information makes the data length of each information be equal to the reference data length；
The multiple information isometric to data carry out the network code based on merging treatment, and the information after coding is sent to purpose
Node.
2. according to the method described in claim 1, it is characterized in that, the multiple information isometric to data carry out being based on merging treatment
Network code include：Signal merges modulus, the processing mode that signal domain merges extension or other information merges.
3. a kind of data block processing unit of network code, which is characterized in that including：
Receiving module receives multiple information from more than two multiple source nodes；
Determining module, the data length of each information for determining the multiple information, according to identified each information
Data length finds the longest data length in the multiple information；
Setup module, reference data length of the setting more than the longest data length；
Processing module determines the information for needing to fill data according to the reference data length, and according to reference data length point
The information for filling data Wei not be needed each to calculate the quantity for needing to fill data；
Module is filled, according to the quantity for needing to fill data calculated, behind each information for needing to fill data respectively
The partial data for adding respective partial data or another information makes the data length of each information be equal to the reference data
Length；
Network code module carries out the network code based on merging treatment to each information Jing Guo isometric data processing, and will
Information after coding is sent to destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110215585.5A CN102237967B (en) | 2011-07-29 | 2011-07-29 | A kind of data block processing method and its device of network code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110215585.5A CN102237967B (en) | 2011-07-29 | 2011-07-29 | A kind of data block processing method and its device of network code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102237967A CN102237967A (en) | 2011-11-09 |
| CN102237967B true CN102237967B (en) | 2018-08-14 |
Family
ID=44888232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110215585.5A Active CN102237967B (en) | 2011-07-29 | 2011-07-29 | A kind of data block processing method and its device of network code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102237967B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115037419B (en) * | 2022-08-11 | 2023-01-31 | 德州鲲程电子科技有限公司 | Method for serial transmission of variable-length coded data in chip testing process |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867451A (en) * | 2010-06-02 | 2010-10-20 | 北京邮电大学 | Multi-user network coding communication method with high-speed parallel encoding and decoding structure |
| CN102130746A (en) * | 2011-04-25 | 2011-07-20 | 北京理工大学 | Network coding feedback method for coordinated multi-point transmission system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140032013A (en) * | 2009-10-07 | 2014-03-13 | 니폰덴신뎅와 가부시키가이샤 | Wireless communication system, radio relay station apparatus, radio terminal station apparatus, and wireless communication method |
-
2011
- 2011-07-29 CN CN201110215585.5A patent/CN102237967B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101867451A (en) * | 2010-06-02 | 2010-10-20 | 北京邮电大学 | Multi-user network coding communication method with high-speed parallel encoding and decoding structure |
| CN102130746A (en) * | 2011-04-25 | 2011-07-20 | 北京理工大学 | Network coding feedback method for coordinated multi-point transmission system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102237967A (en) | 2011-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Abbasi et al. | Cooperative NOMA with full‐duplex amplify‐and‐forward relaying | |
| CN101394255B (en) | Two-user collaboration communication method in multi-user wireless network | |
| CN105049388B (en) | A kind of Shortwave Communication System and its transmission method based on fountain codes and single carrier frequency domain equalization | |
| CN104837110A (en) | Transfer strategy realization method based on interruption performance improvement in cellular D2D communication system | |
| Firooz et al. | Wireless network coding via modified 802.11 MAC/PHY: Design and implementation on SDR | |
| CN102684824A (en) | Data transmission method and system | |
| CN103036647B (en) | Wireless communication method of physical layer network coding based on multi-frequency-shift keying (MFSK) modulation mode | |
| Yousefi et al. | Comfort applications in vehicular ad hoc networks based on fountain coding | |
| CN101588339B (en) | Method for reducing wireless relaying redundant forwarding on the basis of iterated code | |
| Al‐Zubi et al. | Outage performance of cognitive two‐way amplify‐and‐forward relay network under different transmission schemes | |
| KR102120945B1 (en) | Base station, member node of transmitting data based on cooperation of member node under multicast group and methodes thereof | |
| CN101562506B (en) | Data transmission method | |
| CN101009531B (en) | Error control method and mutual-help forwarding system | |
| CN102237967B (en) | A kind of data block processing method and its device of network code | |
| CN101790194A (en) | Mixed automatic retransmission request method, device and system for relay uplink | |
| CN104023369B (en) | The dynamic decoder forward relay method distributed based on optimal time | |
| Silveira et al. | CodePLC: A network coding MAC protocol for power line communication | |
| CN105722146A (en) | Communication method and communication device of wireless local area network, access point and station | |
| Lu et al. | Capacity of random wireless networks: Impact of physical-layer network coding | |
| US10638465B2 (en) | Method and system of bi-directional transmission to improve uplink performance | |
| CN106953681A (en) | Network broadcasting communication high throughput network coding and transmission method between star | |
| Jeyalakshmi | Channel Precoding for Compute and Forward relaying in Two way Relay Network model | |
| Chiti et al. | Optimal links selection procedure in buffer‐aided relaying for point‐to‐multipoints communications | |
| Valle et al. | Experimental assessment of using network coding and cooperative diversity techniques in IEEE 802.15. 4 wireless sensor networks | |
| Ke et al. | Improvement of physical-layer network coding method in relay networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |