초록 ▼

General binary design criteria for PSK-modulated space-time codes are provided. For linear binary PSK (BPSK) codes and quadrature PSK (QPSK) codes, the rank (i.e., binary projections) of the unmodulated code words, as binary matrices over the binary field, is used as a design criterion. Fundamental

General binary design criteria for PSK-modulated space-time codes are provided. For linear binary PSK (BPSK) codes and quadrature PSK (QPSK) codes, the rank (i.e., binary projections) of the unmodulated code words, as binary matrices over the binary field, is used as a design criterion. Fundamental code constructions for both quasi-static and time-varying channels are provided.

대표청구항 ▼

General binary design criteria for PSK-modulated space-time codes are provided. For linear binary PSK (BPSK) codes and quadrature PSK (QPSK) codes, the rank (i.e., binary projections) of the unmodulated code words, as binary matrices over the binary field, is used as a design criterion. Fundamental

General binary design criteria for PSK-modulated space-time codes are provided. For linear binary PSK (BPSK) codes and quadrature PSK (QPSK) codes, the rank (i.e., binary projections) of the unmodulated code words, as binary matrices over the binary field, is used as a design criterion. Fundamental code constructions for both quasi-static and time-varying channels are provided. 0700, Wu et al., 375/227 te. 2. A method according to claim 1 further comprising the step of creating a template structure in memory and wherein the template packet comprises a pointer to the template structure in memory. 3. A method according to claim 2 wherein the template structure includes an identifier that the packet is a template packet. 4. A method according to claim 2 wherein the step of using the routing information to form the template comprising copying the routing information from the template packet to the template structure. 5. A method according to claim 1 wherein the step of subsequently identifying the packet as a template packet is performed at the data link layer. 6. A method according to claim 1 wherein a new template is created periodically during the duration of the data stream. 7. A method according to claim 1 further comprising determining the type of packet and only performing the steps of generating a template and applying the template on selected packet types. 8. A method according to claim 7 wherein the steps of generating and applying the template are performed for at least one of: Realtime Transport Protocol (RTP) and User Datagram Protocol (UDP) packet types. 9. A method according to claim 1 wherein the packets are internet protocol (IP) packets. 10. A method according to claim 1 wherein the step of forming the data into packets forms packets having an equal length payload and wherein a checksum for a packet is calculated once and forms part of the template for applying to the stream of packets. 11. A method according to claim 1 wherein the step of creating the template packet is performed by a first processor and the step of applying the template to the data is performed by a second processor. 12. A method according to claim 11 wherein the second processor is a processor that has lower functionality than the first. 13. A method according to claim 12 wherein the second processor is one of: a co-processor of the first processor; a reduced instruction set (RISC) processor, and a field programmable gate array (FPGA). 14. Apparatus for processing a received data stream which is intended for transmission in packet form over a data network, the apparatus comprising: a processor arranged to form the received data stream into a stream of packets, each packet comprising a payload section of data and an overhead section; said stream of packets being formed by creating a template, applying the template to the received data to form the stream of packets and without passing that data through a routing stack; and wherein said processor is arranged to form said template by: generating a packet which can subsequently be identified as a template packet; sending that template packet through a routing stack such that routing information is applied to the template packet; subsequently identifying that packet as a template packet; and using the routing information that has been applied to the template packet by the routing stack to form the template. 15. Software code stored on a machine-readable medium for causing a data stream processing apparatus which processes a received data stream for transmission over a data network by receiving a data stream and forming the data into a stream of packets, each packet comprising a payload section of data and an overhead section, to perform the steps of: creating a template and applying the template to the received data to form the stream of packets and without passing that data through a routing stack; and wherein said software code is arranged to cause said data stream processing apparatus to form said template by: generating a packet which can subsequently be identified as a template packet; sending that template packet through a routing stack such that routing information is applied to the template packet; subsequently identifying that packet as a template packet; and using the routing information that has been applied to the template packet by the routing stack to form the