Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
  • H04L1/0077—Cooperative coding
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
  • H03M13/2933—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using a block and a convolutional code
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
  • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
  • H03M13/2957—Turbo codes and decoding
  • H03M13/296—Particular turbo code structure
  • H03M13/2972—Serial concatenation using convolutional component codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0056—Systems characterized by the type of code used
  • H04L1/0059—Convolutional codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0056—Systems characterized by the type of code used
  • H04L1/0064—Concatenated codes
  • H04L1/0065—Serial concatenated codes
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
  • H04L1/0056—Systems characterized by the type of code used
  • H04L1/0071—Use of interleaving
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L1/00—Arrangements for detecting or preventing errors in the information received
  • H04L2001/0092—Error control systems characterised by the topology of the transmission link
  • H04L2001/0097—Relays

Definitions

• the subject disclosure relates to cooperative concatenated coding for wireless communication systems.
• AF decode-and- forward
• CC coded cooperation
• cooperative concatenated coding is provided for wireless communications between at least two users and a base station.
• a network system employing cooperative concatenated coding of communications.
• the network system can include at least two cooperating user devices each configured to encode and transmit at least a portion of a joint message.
• the joint message includes at least a portion of a first message from a first cooperating user device and at least a portion of a second message from a second cooperating user device.
• the cooperative concatenated coding methodology includes encoding a first message from a first cooperating user, receiving a second message from a second cooperating user, and decoding the second message.
• the methodology also includes re-encoding at least a portion of the decoded message with at least a portion of the first message to form a combined message, and then transmitting at least a portion of the combined message.
• Figure 1 illustrates a flowchart of a method of cooperative concatenated coding
• Figure 2 illustrates a high-level block diagram of a cooperative concatenated coding system
• Figure 3 comparatively illustrates a two-user system with a fixed timeslot allocation ratio using conventional non-cooperation, conventional coded cooperation
• Figure 4 illustrates a high-level block diagram of a serial concatenated convolution code encoder, including a joint-user cooperative encoder
• Figure 5 illustrates a block diagram of the joint-user cooperative encoder of Figure 4;
• Figure 6 illustrates a block diagram of an iterative decoder in connection with a cooperative concatenated code
• Figure 7 shows the bit error rate for different number of users in a spatial-diversity deficient scenario
• Figure 8 shows the bit error rate with three cooperating users for different input block sizes in a spatial-diversity deficient scenario
• Figure 9 shows the bit error rate for different inter-user channel conditions with a reduced-complexity cooperative encoder in a spatial-diversity deficient scenario
• Figure 10 is a block diagram representing an exemplary non-limiting networked environment in which various embodiments described herein can be implemented;
• Figure 11 is a block diagram representing an exemplary non-limiting computing system or operating environment in which various embodiments described herein can be implemented.
• Figure 12 illustrates an overview of a network environment suitable for service by one or more embodiments described herein. DETAILED DESCRIPTION OVERVIEW
• a coded cooperation architecture is provided where the cooperating users benefit not only from spatial diversity gain, but also from a more powerful joint-user channel code.
• an interleaver gain is realized in data communications that increases with the number of cooperating users. This additional performance gain occurs even when the receive SNR of all of the cooperating users are kept the same at the base station.
• cooperation among more than two users with unequal message sizes is easily achieved with various techniques described herein.
• a reduced-complexity cooperation method can be used.
• a cooperative code architecture and its features are now described in conjunction with an embodiment providing a cooperative serial concatenated convolutional code (SCCC) as the channel code that comprises a joint-user recursive systematic convolutional (RSC) inner code.
• SCCC cooperative serial concatenated convolutional code
• RSC joint-user recursive systematic convolutional
• TDMA Time-division-multiple-access uplink transmission is used with half-duplex communication where users can either transmit or receive at a particular time.
• Figure 1 illustrates a flowchart of a method of cooperative concatenated coding in accordance with an exemplary, non-limiting embodiment.
• a user device also referred to herein as a user
• the user encodes its own message.
• the user decodes cooperating partner(s)' message(s).
• the user re-encodes the cooperating partner(s)' message(s) along with the user's own message to form a combined message.
• the user transmits a subset of the combined message.
• Figure 2 illustrates a high-level block diagram of a cooperative concatenated coding system in accordance with another exemplary non-limiting embodiment.
• the cooperative concatenated coding system 200 includes a base station 210 and two cooperating user devices - a first user device 220 and a second user device 230.
• the base station 210 is operable to receive data transmitted by the first user device 220 and/or by the second user device 230.
• the first user device 220 transmits a first message Sl to the base station
• the second user device 230 transmits a second message S2 to the base station.
• each cooperating user device listens to the channel and attempts to decode the other user device(s)' message(s). Upon successful decoding, a joint message Q is encoded jointly using all cooperating users' messages. Each user device then transmits a subset of Q to the base station.
• the invention is not limited to two cooperating user devices, but rather any number of cooperating user devices can be used.
• ⁇ 1 ' -2 ' • '-' ' ' J represents a set of blocks of bits , ⁇ > s , of user k.
• the coded bits of the ith-coded block of user k are divided into two subsets, c(i) p(i) denoted by -' and- 1 , as shown in Figure 3.
• the superscript is discarded.
• the scheme either returns to a non-cooperative mode or results in a partly cooperative mode.
• the failed user informs its partner about the failure, and both of the users p then transmit their own - without cooperation.
• the failed user p also transmits its own - instead in the cooperating timeslots, but without informing its partner of the failure.
• Q (All) user transmits a subset of — accordingly.
• a preliminary cooperating group is assumed to be formed prior to the transmissions.
• the users first transmit their first set of coded bits - sequentially, which corresponds to their outer codewords in embodiments using SCCC-based systems. Then, a short period is dedicated to every user to report simultaneously to the cooperating partners and the base station about the occurrence of any decoding failures. Users encountering a decoding failure of any other user's messages can be excluded from the cooperating group and return to their own message encoding. The users then take turns transmitting the next set of coded bits, either their own coded bits or the cooperatively encoded ones.
• the coded cooperation architecture described herein provides another dimension of performance boost in addition to a gain in spatial diversity by exploiting the interleaver gain of concatenated codes.
• the interleaver gain can be increased significantly so that a more powerful overall channel code is formed.
• this framework enables cooperative flexibility in terms of the number of cooperating users and message block lengths.
• the ideas can also be extended to multiple users as shown in subset "(b)" of Figure 3 or to all users transmitting together. If all users are transmitting together, for instance, channel state information at the transmitters can be used.
• SCCC is used in various embodiments of the cooperative code structure, and the encoder for a particular user k is illustrated in Figure 4. — denotes the user's source messages to be encoded using outer encoder 410, interleaver
• ⁇ received from another user k' that passes through a fading channel with additive white Gaussian noise (AWGN).
• AWGN additive white Gaussian noise
• Q (All) of parity bits — can be the only bits that are transmitted in the cooperating timeslots, with each user transmitting only a subset according to respective numbers of allocated timeslots.
• An exemplary iterative decoder 600 at the base station with single- input-single-output (SISO) component decoders 620 is illustrated in Figure 6. and — represent the sets of inner codeword bits — and outer codeword bits received from user k at the base station, respectively. They are first passed through a codeword mixer 610 that rearranges the bits into proper positions of the corresponding codeword sequence of the joint-user inner code before feeding them into the inner SISO decoder 620 and deinterleaver 630.
• e " ' represents the ] extrinsic information of represents the extrinsic information of - output from the outer SISO decoder k 640.
• ⁇ IM ) 1S the a posteriori information of user k's messages from which decisions can be made.
• a trade-off for error rate improvement is users' input decoding delay, which can be defined as the time period starting from a user's message being input into the encoder until the output of a corresponding valid codeword from which the message is to be recovered. Since the inner codeword is jointly encoded from all users' messages, the maximum input decoding delay D m ⁇ a 1S experienced by the first transmitting user and is characterized by Equation (1):
• embodiments described herein further reduce the overall complexity of the system. For instance, in one embodiment, when the inter-user channels are of acceptable quality, the K-I cooperating users' outer decoders, together with the corresponding encoders, can simply be replaced by ⁇ rOUt, k(k')
• K-I demodulators where hard-decisions are made directly on the received — 's. This reduction in complexity is not possible in many conventional systems. Moreover, in conventional systems with cooperation based on punctured concatenated codes, the complexity issue is substantial where iterative decoders are required at the helping partner.
• an interleaver gain can be achieved that increases with the number of cooperating users.
• a first issue is whether to use parallel or serial concatenation codes.
• Both Turbo codes and SCCC achieve an interleaver gain, which has the following relationship with the bit error rate (BER) b at high SNR for a given interleaver size N, as shown in Equation (2):
• N" M is the interleaver gain and a M the maximum exponent achieved depending on the code structure and characteristics of the component codes.
• a M - ⁇ is always true for using a Turbo code while for SCCC the maximum exponent is given by Equation (3): with d f ° denoting the free distance of the outer code and
• SCCC is an optional alternative to using a Turbo code.
• codeword separability if a code is to be used for coded cooperation, the codewords can be partitioned into two sets as described above where the first set is powerful enough for partners to decode the message, as well as the overall code.
• the interleaver gain can be improved by user cooperation. Therefore, in general, the users' messages can be jointly encoded in some ways at each cooperating user after the first sets received from their partners being decoded. The chosen code(s) favor this operation so that the individually encoded first sets and the jointly encoded second sets from all cooperating users together form a robust concatenated code with an improved interleaver gain.
• an SCCC structure with a systematic inner code (e.g., a joint user RSC) can be adopted.
• each user's outer codeword serves as their first set S and is combined with other users' S 's after successfully decoding and re-encoding to form a larger outer codeword for the joint-user SCCC.
• the RSC inner code only the parity bits of the joint-user inner codeword are required to serve as the second setQ (A11) .
• the combined codeword is similar to an ordinary single-user SCCC codeword with an enlarged input data block adopting a larger interleaver.
• the equivalent outer code is a concatenation of the cooperating users' outer codes.
• the equivalent input-output weight enumerating function (IO WEF) ⁇ c ° (w,H ) is expressed by Equation (4):
• Equation (3) 1 k J with d/° k referring to the free distance of user k's outer convolutional code. Due to space limitation, the exact analysis of this cooperative code is not discussed herein. The analysis is a bit different from the SCCC for the different nature of the equivalent outer code. However, it can be shown that the maximum exponent of N, i.e., the interleaver size, of an SCCC with such an equivalent outer code will be upper- bounded by Equation (3) using Equation (5). Hence, it suffices to use Equations (3) and (5) as design criteria where the corresponding interleaver gain specified can be guaranteed.
• both the overall equivalent code and the individual component code should be good codes. Therefore, a desired code should feature a significant improvement of the overall code at the same time when the component code is improved.
• SCCC is a good option because its interleaver gain is characterized by only the free distance of the equivalent outer code as shown in Equations (3) and (5) provided that the inner code is recursive.
• conventional systems have demonstrated that a simple inner code is sufficient for delivering great error performance in both AWGN and fading channels. This implies that the additional decoding complexity due to the extended input block size in user cooperation can be kept minimal, which is shown by the joint-user inner decoder in Figure 6.
• Figures 7 and 8 show the performance of an embodiment of the cooperative coding architecture for different numbers of cooperative users and input block sizes, respectively. Quasi-static fading is assumed where the channels are constant during the transmissions. In order to better illustrate the features of this embodiment, the scenario of an adaptive system is considered where the receive SNRs of all users are kept constant at the base station. In many conventional coded cooperation systems, the architecture will be reduced to the single -user case when spatial diversity is not available.
• Figure 9 shows an embodiment of the reduced- complexity cooperative encoding structure for different inter-user channel conditions.
• a rate- 1/3 SCCC is adopted for all users with a 4-state outer code and a 4-state inner code (in observer canonical form) that are characterized by the generating matrices Gout and Gin, respectively, as l + zr
• G nut ⁇ + D + D ⁇ ⁇ + D ']. l + D + D 1 ⁇ + D o, l,
• the free distance of the outer code is 5 that corresponds to an interleaver gain of N ⁇ .
• N corresponds to the total length of all outer codewords from the users.
• Quadrature phase shift keying (QPSK) is chosen in one embodiment as the modulation scheme in which each orthogonal channel carries one independent coded bit.
• the inter-user channel is assumed perfect unless otherwise specified. In practice, coded cooperation is desired when inter-user channels are reasonably good. Suppose that the inter-user channels are independent. For a given frame error rate (FER) for the inter-user channels, the probability of full cooperation among K users is
• the error rate is significantly reduced by user cooperation over conventional CC as represented by curve 700.
• the interleaver gain refers to the performance of maximum- likelihood (ML) decoding
• ML maximum- likelihood
• a similar gain can be obtained for an iterative decoder with only 6 iterations starting from 1.5 dB.
• the BER is reduced from 2x10 ⁇ 2 to 2x10 ⁇ 3 ( ⁇ 1 -order gain) and is further reduced to 4x10 ⁇ 4 ( ⁇ 2- order gain) when two more users participate in the cooperative transmission, as shown by curve 720, which are close to the predicted curves.
• an embodiment of a coded cooperation is evaluated with an exemplary reduced-complexity cooperative encoder for various inter-user channels conditions in terms of their uncoded BERs.
• uncoded BER 10 "6 the performance is essentially the same at curve 900 as the case of perfect inter-user channels at curve 910.
• the uncoded BER is 10 "4 or 10 "3 at curves 920 and 930, a gain of one order can generally still be achieved.
• error propagation can become a serious issue in this situation, or can become even worse in the inter-user situation.
• Curve 940 is presented for comparison as the case of no cooperation, with 6 iterations, and curve 950 is representative of the case with no iteration.
• the cooperative coding architecture described in various embodiments achieves attractive error performance gain over conventional systems.
• the gain becomes larger by increasing either the number of cooperating users or the input block size.
• This gain can be achieved by an iterative decoder using only limited number of iterations, e.g., 4 iterations in the examples.
• the bit error rate can be reduced by two orders for BERs (10 ⁇ 3 and lower) of practical interest.
• a similar improved trend is obtained for the frame error rates using the techniques described herein.
• a cooperative concatenated coding strategy is provided for a multi-user wireless network.
• the techniques include additional coding benefits other than spatial diversity, in contrast to conventional systems where spatial diversity from different cooperating users is required for a performance improvement. Specifically, a remarkable reduction in error rate can be achieved even when the receive SNR of all cooperating users is maintained at a specific level at the base station, such as in an adaptive transmission system.
• the idea of interleaver gain of concatenated codes is adopted and a significant reduction in error rate can be achieved by increasing the number of cooperating users.
• a reduced-complexity cooperative encoding structure is also provided for use when the inter-user channels are determined to be of sufficient quality, i.e., meet pre-set criteria for use.
• Code design criteria and the selection of an appropriate code were studied and SCCC with an RSC inner code was shown to be an effective candidate.
• the performance was evaluated in the scenario of an adaptive transmission system where the conventional coded cooperation strategy does not deliver any performance improvement over its non-cooperative counterpart. For instance, a two-order bit error rate reduction was achieved with a simple rate 1/3 serial concatenated code when five users were cooperating. Even with only two users, error rate is reduced by at least one order in such scenario.
• Distributed computing provides sharing of computer resources and services by communicative exchange among computing devices and systems. These resources and services include the exchange of information, cache storage and disk storage for objects, such as files. These resources and services also include the sharing of processing power across multiple processing units for load balancing, expansion of resources, specialization of processing, and the like. Distributed computing takes advantage of network connectivity, allowing clients to leverage their collective power to benefit the entire enterprise. In this regard, a variety of devices may have applications, objects or resources that may implement one or more aspects of cooperative concatenated coding as described for various embodiments of the subject disclosure.
• Fig. 10 provides a schematic diagram of an exemplary networked or distributed computing environment.
• the distributed computing environment comprises computing objects 1010, 1012, etc. and computing objects or devices 1020, 1022, 1024, 1026, 1028, etc., which may include programs, methods, data stores, programmable logic, etc., as represented by applications 1030, 1032, 1034, 1036, 1038.
• objects 1010, 1012, etc. and computing objects or devices 1020, 1022, 1024, 1026, 1028, etc. may comprise different devices, such as PDAs, audio/video devices, mobile phones, MP3 players, personal computers, laptops, etc.
• Each object 1010, 1012, etc. and computing objects or devices 1020, are identical to each object 1010, 1012, etc. and computing objects or devices 1020,
• 1022, 1024, 1026, 1028, etc. can communicate with one or more other objects 1010, 1012, etc. and computing objects or devices 1020, 1022, 1024, 1026, 1028, etc. by way of the communications network 1040, either directly or indirectly.
• network 1040 may comprise other computing objects and computing devices that provide services to the system of Fig. 10, and/or may represent multiple interconnected networks, which are not shown.
• an application such as applications 1030, 1032, 1034, 1036, 1038, that might make use of an API, or other object, software, firmware and/or hardware, suitable for communication with or implementation of the cooperative concatenated coding architecture(s) provided in accordance with various embodiments of the subject disclosure.
• computing systems can be connected together by wired or wireless systems, by local networks or widely distributed networks.
• networks are coupled to the Internet, which provides an infrastructure for widely distributed computing and encompasses many different networks, though any network infrastructure can be used for exemplary communications made incident to the cooperative concatenated coding as described in various embodiments.
• client/server peer-to-peer
• hybrid architectures a host of network topologies and network infrastructures, such as client/server, peer-to-peer, or hybrid architectures.
• the "client” is a member of a class or group that uses the services of another class or group to which it is not related.
• a client can be a process, i.e., roughly a set of instructions or tasks, that requests a service provided by another program or process.
• the client process utilizes the requested service without having to "know” any working details about the other program or the service itself.
• a client is usually a computer that accesses shared network resources provided by another computer, e.g., a server.
• a server e.g., a computer that accesses shared network resources provided by another computer, e.g., a server.
• computers 1020, 1022, 1024, 1026, 1028, etc. can be thought of as clients and computers 1010, 1012, etc. can be thought of as servers where servers 1010, 1012, etc.
• a server is typically a remote computer system accessible over a remote or local network, such as the Internet or wireless network infrastructures.
• the client process may be active in a first computer system, and the server process may be active in a second computer system, communicating with one another over a communications medium, thus providing distributed functionality and allowing multiple clients to take advantage of the information-gathering capabilities of the server.
• Any software objects utilized pursuant to the techniques for performing cooperative concatenated coding can be provided standalone, or distributed across multiple computing devices or objects.
• the servers 1010, 1012, etc. can be Web servers with which the clients 1020, 1022, 1024, 1026, 1028, etc. communicate via any of a number of known protocols, such as the hypertext transfer protocol (HTTP).
• Servers 1010, 1012, etc. may also serve as clients 1020, 1022, 1024, 1026, 1028, etc., as may be characteristic of a distributed computing environment.
• the techniques described herein can be applied to any device where it is desirable to transmit data from a set of cooperating users. It should be understood, therefore, that handheld, portable and other computing devices and computing objects of all kinds are contemplated for use in connection with the various embodiments, i.e., anywhere that a device may wish to transmit (or receive) data. Accordingly, the below general purpose remote computer described below in Fig. 11 is but one example of a computing device. Additionally, any of the embodiments implementing the cooperative concatenated coding as described herein can include one or more aspects of the below general purpose computer.
• embodiments can partly be implemented via an operating system, for use by a developer of services for a device or object, and/or included within application software that operates to perform one or more functional aspects of the various embodiments described herein.
• Software may be described in the general context of computer-executable instructions, such as program modules, being executed by one or more computers, such as client workstations, servers or other devices.
• computers such as client workstations, servers or other devices.
• client workstations such as client workstations, servers or other devices.
• FIG. 11 thus illustrates an example of a suitable computing system environment 1100 in which one or aspects of the embodiments described herein can be implemented, although as made clear above, the computing system environment 1100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to scope of use or functionality. Neither should the computing environment 1100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 1100.
• an exemplary remote device for implementing one or more embodiments includes a general purpose computing device in the form of a computer 1110.
• Components of computer 1110 may include, but are not limited to, a processing unit 1120, a system memory 1130, and a system bus 1122 that couples various system components including the system memory to the processing unit 1120.
• Computer 1110 typically includes a variety of computer readable media and can be any available media that can be accessed by computer 1110.
• the system memory 1130 may include computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) and/or random access memory (RAM).
• ROM read only memory
• RAM random access memory
• memory 1130 may also include an operating system, application programs, other program modules, and program data.
• a user can enter commands and information into the computer 1110 through input devices 1140.
• a monitor or other type of display device is also connected to the system bus 1122 via an interface, such as output interface 1150.
• computers can also include other peripheral output devices such as speakers and a printer, which may be connected through output interface 1150.
• the computer 1110 may operate in a networked or distributed environment using logical connections to one or more other remote computers, such as remote computer 1170.
• the remote computer 1170 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, or any other remote media consumption or transmission device, and may include any or all of the elements described above relative to the computer 1110.
• a network 1172 such local area network (LAN) or a wide area network (WAN), but may also include other networks/buses.
• LAN local area network
• WAN wide area network
• Such networking environments are commonplace in homes, offices, enterprise-wide computer networks, intranets and the Internet.
• EXEMPLARY COMMUNICATIONS NETWORKS AND ENVIRONMENTS [0068] The above-described optimizations may be applied to any network, however, the following description sets forth some exemplary telephony radio networks and non-limiting operating environments for incorporation of the various embodiments described herein.
• the below-described operating environments should be considered non-exhaustive, however, and thus the below-described network architecture merely shows one network architecture into which the various embodiments described herein may be incorporated.
• GSM global system for mobile communication
• GPRS General Packet Radio Service
• GPRS uses a packet-based wireless communication technology to transfer high and low speed data and signaling in an efficient manner. GPRS optimizes the use of network and radio resources, thus enabling the cost effective and efficient use of GSM network resources for packet mode applications.
• GSM/GPRS environment and services described herein can also be extended to 3G services, such as Universal Mobile Telephone System (“UMTS”), Frequency Division Duplexing (“FDD”) and Time Division Duplexing (“TDD”), High Speed Packet Data Access (“HSPDA”), cdma2000 Ix Evolution Data Optimized (“EVDO”), Code Division Multiple Access-2000 (“cdma2000 3x”), Time Division Synchronous Code Division Multiple Access (“TD-SCDMA”), Wideband Code Division Multiple Access (“WCDMA”), Enhanced Data GSM Environment (“EDGE”), International Mobile Telecommunications-2000 (“IMT-2000”), Digital Enhanced Cordless Telecommunications (“DECT”), etc., as well as to other network services that shall become available in time.
• UMTS Universal Mobile Telephone System
• FDD Frequency Division Duplexing
• TDD Time Division Duplexing
• HSPDA High Speed Packet Data Access
• EVDO cdma2000 Ix Evolution Data Optimized
• TD-SCDMA Time Division Syn
• FIG. 12 depicts an overall block diagram of an exemplary packet-based mobile cellular network environment, such as a GPRS network, in which one or more embodiments may be practiced.
• BSS Base Station Subsystems
• BSC Base Station Controller
• BTS Base Transceiver Stations
• BTSs 1204, 1206, 1208, etc. are the access points where users of packet-based mobile devices become connected to the wireless network.
• the packet traffic originating from user devices is transported over the air interface to a BTS 1208, and from the BTS 1208 to the BSC 1202.
• Base station subsystems such as BSS 1200, are a part of internal frame relay network 1210 that may include Service GPRS Support Nodes ("SGSN") such as SGSN 1212 and 1214.
• SGSN Service GPRS Support Nodes
• Each SGSN is in turn connected to an internal packet network 1220 through which a SGSN 1212, 1214, etc. can route data packets to and from a plurality of gateway GPRS support nodes (GGSN) 1222, 1224, 1226, etc.
• GGSN gateway GPRS support nodes
• SGSN 1214 and GGSNs 1222, 1224, and 1226 are part of internal packet network 1220.
• Gateway GPRS serving nodes 1222, 1224 and 1226 mainly provide an interface to external Internet Protocol (“IP”) networks such as Public Land Mobile Network (“PLMN”) 1245, corporate intranets 1240, or Fixed-End System (“FES”) or the public Internet 1230.
• IP Internet Protocol
• PLMN Public Land Mobile Network
• FES Fixed-End System
• subscriber corporate network 1240 may be connected to GGSN 1224 via firewall 1232; and PLMN 1245 is connected to GGSN 1224 via boarder gateway router 1234.
• the Remote Authentication Dial-In User Service (“RADIUS”) server 1242 may be used for caller authentication when a user of a mobile cellular device calls corporate network 1240.
• RADIUS Remote Authentication Dial-In User Service
• Macro cells can be regarded as cells where the base station antenna is installed in a mast or a building above average roof top level.
• Micro cells are cells whose antenna height is under average roof top level; they are typically used in urban areas.
• Pico cells are small cells having a diameter is a few dozen meters; they are mainly used indoors.
• umbrella cells are used to cover shadowed regions of smaller cells and fill in gaps in coverage between those cells.
• network elements that may implicate the functionality of the optimization algorithms and processes in accordance with the invention may include but are not limited to Gateway GPRS Support Node tables, Fixed End System router tables, firewall systems, VPN tunnels, and any number of other network elements as required by the particular digital network.
• a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer.
• a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer.
• an application running on computer and the computer can be a component.
• One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.
• the methods and apparatus of the present invention may take the form of program code (i.e., instructions) embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention.
• the computing device In the case of program code execution on programmable computers, the computing device generally includes a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and at least one output device.
• the disclosed subject matter may be implemented as a system, method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer or processor based device to implement aspects detailed herein.
• article of manufacture can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips...), optical disks (e.g., compact disk (CD), digital versatile disk (DVD)...), smart cards, and flash memory devices (e.g., card, stick).
• a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a local area network (LAN).
• LAN local area network
• various portions of the disclosed systems above and methods below may include or consist of artificial intelligence or knowledge or rule based components, sub-components, processes, means, methodologies, or mechanisms (e.g., support vector machines, neural networks, expert systems, Bayesian belief networks, fuzzy logic, data fusion engines, classifiers).
• Such components can automate certain mechanisms or processes performed thereby to make portions of the systems and methods more adaptive as well as efficient and intelligent.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Probability & Statistics with Applications (AREA)
• Theoretical Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Mobile Radio Communication Systems (AREA)
• Bidirectional Digital Transmission (AREA)

Priority Applications (5)

Applications Claiming Priority (4)

Publications (2)

Family

ID=39970650

Family Applications (1)

Country Status (6)

Cited By (2)

Families Citing this family (19)

Family Cites Families (16)

• 2008
  • 2008-04-18 US US12/105,319 patent/US8205132B2/en active Active
  • 2008-04-21 CN CN200880015185.6A patent/CN102084615B/zh active Active
  • 2008-04-21 KR KR1020097023197A patent/KR101277843B1/ko active Active
  • 2008-04-21 EP EP20080827522 patent/EP2149197A4/en not_active Ceased
  • 2008-04-21 JP JP2010507024A patent/JP5259696B2/ja active Active
  • 2008-04-21 WO PCT/IB2008/003337 patent/WO2009022240A2/en not_active Ceased
  • 2008-04-21 KR KR1020137000710A patent/KR101332528B1/ko active Active
• 2012
  • 2012-04-25 US US13/455,307 patent/US8495456B2/en active Active

Non-Patent Citations (3)

Also Published As

Similar Documents

Legal Events