Resource sharing in a telecommunications environment

CA 02580280 2009-03-04

RESOURCE SHARING IN A TELECOMMUNICATIONS ENVIRONMENT

BACKGROUND Field of the Invention

[0002] This invention generally relates to communication systems. More specifically, an exemplary embodiment of this invention relates to memory sharing in communication systems. Another exemplary embodiment relates to processing or coding resource sharing in a communication system.

Description of Related Art

[0003] U.S. Patent Nos. 6,775,320 and 6,778,589 describe DSL systems supporting multiple applications and multiple framer/coder/interleaver FCI blocks (an FCI block is also referred to as a latency path). DSL systems carry applications that have different transmission requirements with regard to, for example, data rate, latency (delay), bit error rate (BER), and the like. For example, video typically requires a low BER (<1 E-10) but can tolerate higher latency (>20 ms). Voice, on the other hand, typically requires a low latency (<1 ms) but can tolerate BER (>lE-3).

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0004] As described in U.S. Patent No. 6,775,320, different applications can use different latency paths in order to satisfy the different application requirements of the communication system. As a result a transceiver must support multiple latency paths in order to support applications such as video, Internet access and voice telephony. When implemented in a transceiver, each of the latency paths will have a framer, coder, and interleaver block with different capabilities that depend on the application requirements.

SUMMARY

[0005] One difficulty with implementing multiple latency paths in a transceiver is

I the fact that a latency path is a complicated digital circuit that requires a large amount of memory and processing power. An interleaver within a latency path can consume a large amount of memory in order to provide error correcting capability. For example, a typical DSL transceiver will have at least one latency path with approximately 16 kbytes of memory for the interleaver. Likewise, the coding block, for example, a Reed Solomon coder, consumes a large amount of processing power.

In general, as the number of latency paths increase, the memory and processing power requirements for a communication system become larger.

[0006] Accordingly, an exemplary aspect of this invention relates to sharing memory between one or more interleavers and/or deinterlaevers in a transceiver.

More particularly, an exemplary aspect of this invention relates to shared latency path memory in a transceiver.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0007] Additional aspects of this invention relate to configuring and initializing shared memory in a communication system. More particularly, an exemplary aspect of this invention relates to configuring and initializing interleaver/deinterleaver memory in a communication system.

[0008] Additional aspects of the invention relate to determining the amount of memory that can be allocated to a particular component by a communication system. More specifically, an exemplary aspect of the invention relates to determining the maximum amount of shared memory that can be allocated to one or more interleaves or deinterleavers.

[0009] According to another exemplary aspect of the invention, processing power is shared between a number of transceiver modules. More specifically, and in accordance with an exemplary embodiment of the invention, a coding module is shared between one or more coders and/or decoders.

[0010] Another exemplary embodiment of the invention relates to transitioning from a fixed memory configuration to a shared memory configuration during one or more of initialization and SHOWTIME (user data transmission).

[0011] An additional exemplary aspect of the invention relates to dynamically updating one or more of shared memory and processing resources based on changing communication conditions.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0012] An additional exemplary aspect of the invention relates to updating one or more of shared memory and processing resources based on an updated communication parameter.

[0013] An additional exemplary aspect of the invention relates to updating the allocation of one or more of shared memory and processing resources based on an updated communication parameter(s).

[0014] Additional aspects of the invehtion relate to exchanging shared resource allocations between transceivers.

[0015] Additional exemplary aspects relate to a method of allocating shared memory in a transceiver comprising allocating the shared memory to a plurality of modules, wherein each of the plurality of modules comprise at least one interleaver, at least one deinterleaver or a combination thereof.

[0016] Still further aspects relate to the above method wherein the plurality of modules comprise interleavers.

[0017] Still further aspects relate to the above method wherein the plurality of modules comprise deinterleavers.

[0018] Still further aspects relate to the above method wherein the plurality of modules comprise at least one interleaver and at least one deinterleaver.

[0019] Additional exemplary aspects relate to a transceiver comprising a plurality of modules each including at least one interleaver, at least one deinterleaver or a

CA 02580280 2013-03-14 combination thereof and a shared memory designed to be allocated to a plurality of the modules.

[0020] Still further aspects relate to the above transceiver wherein the plurality of modules comprise interleavers.

[0021] Still further aspects relate to the above transceiver wherein the plurality of modules comprise deinterleavers.

[0022] Still further aspects relate to the above transceiver wherein the plurality of modules comprise at least one interleaver and at least one deinterleaver.

[0022a] Another exemplary aspect of this invention relates to a method of allocating shared memory in a transceiver comprising: transmitting or receiving, by the transceiver, a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to an interleaver; determining, at the transceiver, an amount of memory required by the interleaver to interleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating, in the transceiver, a first number of bytes of the shared memory to the interleaver to interleave the first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the interleaver does not exceed the maximum number of bytes specified in the message; allocating, in the transceiver, a second number of bytes of the shared memory to a deinterleaver to deinterleave a second plurality of RS coded data bytes received at a second data rate; and interleaving the first plurality of RS coded data bytes within the shared memory allocated to the interleaver and deinterleaving the second plurality of RS coded data bytes within the shared memory allocated to the deinterleaver, wherein the shared memory allocated to the interleaver is used at the same time as the shared memory allocated to the deinterleaver.

[0022b] Another exemplary aspect of this invention relates to a method of allocating shared memory in a transceiver comprising: transmitting or receiving, by the transceiver, a

CA 02580280 2013-03-14 message during initialization specifying a maximum number of bytes of memory that are available to be allocated to a deinterleaver; determining, at the transceiver, an amount of memory required by the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating, in the transceiver, a first number of bytes of the shared memory to the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes for reception at a first data rate, wherein the allocated memory for the deinterleaver does not exceed the maximum number of bytes specified in the message; allocating, in the transceiver, a second number of bytes of the shared memory to an interleaver to interleave a second plurality of RS coded data bytes transmitted at a second data rate; and deinterleaving the first plurality of RS coded data bytes within the shared memory allocated to the deinterleaver and interleaving the second plurality of RS coded data bytes within the shared memory allocated to the interleaver, wherein the shared memory allocated to the deinterleaver is used at the same time as the shared memory allocated to the interleaver.

[0022c] Another exemplary aspect of this invention relates to a system for allocating shared memory comprising: means for transmitting or receiving, by a transceiver, a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to an interleaver; means for determining, at the transceiver, an amount of memory required by the interleaver to interleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; means for allocating, in the transceiver, a first number of bytes of the shared memory to the interleaver to interleave the first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the interleaver does not exceed the maximum number of bytes specified in the message; means for allocating, in the transceiver, a second number of bytes of the shared memory to a deinterleaver to deinterleave a second plurality of RS coded data bytes received at a second data rate; and means for interleaving the first plurality of RS coded data bytes within the shared memory allocated to the interleaver and deinterleaving the second plurality of RS coded data bytes within the shared memory allocated to the deinterleaver, wherein the shared memory allocated to the interleaver is used at the same time as the shared memory allocated to the deinterleaver.

5a

CA 02580280 2013-03-14

[0022d] Another exemplary aspect of this invention relates to a system for allocating shared memory comprising: means for transmitting or receiving, by a transceiver, a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to a deinterleaver; means for determining, at the transceiver, an amount of memory required by the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; means for allocating, in the transceiver, a first number of bytes of the shared memory to the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes for reception at a first data rate, wherein the allocated memory for the deinterleaver does not exceed the maximum number of bytes specified in the message; means for allocating, in the transceiver, a second number of bytes of the shared memory to an interleaver to interleave a second plurality of RS coded data bytes transmitted at a second data rate; and means for deinterleaving the first plurality of RS coded data bytes within the shared memory allocated to the deinterleaver and interleaving the second plurality of RS coded data bytes within the shared memory allocated to the interleaver, wherein the shared memory allocated to the deinterleaver is used at the same time as the shared memory allocated to the interleaver.

[0022e] Another exemplary aspect of this invention relates to a system that allocates shared memory comprising: a transceiver that performs: transmitting or receiving a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to an interleaver; determining an amount of memory required by the interleaver to interleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating a first number of bytes of the shared memory to the interleaver to interleave the first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the interleaver does not exceed the maximum number of bytes specified in the message; allocating a second number of bytes of the shared memory to a deinterleaver to deinterleave a second plurality of RS coded data bytes received at a second data rate; and interleaving the first plurality of RS coded data bytes within the shared memory allocated to the interleaver and deinterleaving the second plurality of RS coded data bytes within the shared memory allocated to the deinterleaver,

5b

CA 02580280 2013-03-14 wherein the shared memory allocated to the interleaver is used at the same time as the shared memory allocated to the deinterleaver.

[0022fJ Another exemplary aspect of this invention relates to a system that allocates shared memory comprising: a transceiver that performs: transmitting or receiving a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to a deinterleaver; determining an amount of memory required by the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating a first number of bytes of the shared memory to the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes for reception at a first data rate, wherein the allocated memory for the deinterleaver does not exceed the maximum number of bytes specified in the message; allocating a second number of bytes of the shared memory to an interleaver to interleave a second plurality of RS coded data bytes transmitted at a second data rate; and deinterleaving the first plurality of RS coded data bytes within the shared memory allocated to the deinterleaver and interleaving the second plurality of RS coded data bytes within the shared memory allocated to the interleaver, wherein the shared memory allocated to the deinterleaver is used at the same time as the shared memory allocated to the interleaver.

[0022g] Another exemplary aspect of this invention relates to a non-transitory computerreadable information storage media having stored thereon instructions, that if executed by a processor, cause to be performed a method for allocating shared memory in a transceiver comprising: transmitting or receiving, by the transceiver, a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to an interleaver; determining, at the transceiver, an amount of memory required by the interleaver to interleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating, in the transceiver, a first number of bytes of the shared memory to the interleaver to interleave the first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the interleaver does not exceed the maximum number of bytes specified in the message; allocating, in the transceiver, a second number of bytes of the shared memory to a deinterleaver to

5c

CA 02580280 2013-03-14 deinterleave a second plurality of RS coded data bytes received at a second data rate; and interleaving the first plurality of RS coded data bytes within the shared memory allocated to the interleaver and deinterleaving the second plurality of RS coded data bytes within the shared memory allocated to the deinterleaver, wherein the shared memory allocated to the interleaver is used at the same time as the shared memory allocated to the deinterleaver.

[0022h] Another exemplary aspect of this invention relates to a non-transitory computerreadable information storage media having stored thereon instructions, that if executed by a processor, cause to be performed a method for allocating shared memory in a transceiver comprising: transmitting or receiving, by the transceiver, a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to a deinterleaver; determining, at the transceiver, an amount of memory required by the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes within a shared memory; allocating, in the transceiver, a first number of bytes of the shared memory to the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the deinterleaver does not exceed the maximum number of bytes specified in the message; allocating, in the transceiver, a second number of bytes of the shared memory to an interleaver to interleave a second plurality of RS coded data bytes received at a second data rate; and deinterleaving the first plurality of RS coded data bytes within the shared memory allocated to the deinterleaver and interleaving the second plurality of RS coded data bytes within the shared memory allocated to the interleaver, wherein the shared memory allocated to the deinterleaver is used at the same time as the shared memory allocated to the interleaver.

[0022i] Another exemplary aspect of this invention relates to a system that allocates shared memory comprising: a transceiver that is capable of: transmitting or receiving a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to an interleaver; determining an amount of memory required by the interleaver to interleave a first plurality of Reed Solomon (RS) coded data bytes within the shared memory; allocating a first number of bytes of the shared memory to the

5d

CA 02580280 2013-03-14 interleaver to interleave the first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the interleaver does not exceed the maximum number of bytes specified in the message; allocating a second number of bytes of the shared memory to a deinterleaver to deinterleave a second plurality of RS coded data bytes received at a second data rate; and interleaving the first plurality of RS coded data bytes within the shared memory allocated to the interleaver and deinterleaving the second plurality of RS coded data bytes within the shared memory allocated to the deinterleaver, wherein the shared memory allocated to the interleaver is used at the same time as the shared memory allocated to the deinterleaver.

[0022j] Another exemplary aspect of this invention relates to a system that allocates shared memory comprising: a transceiver that is capable of: transmitting or receiving a message during initialization specifying a maximum number of bytes of memory that are available to be allocated to a deinterleaver; determining an amount of memory required by the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes within the shared memory; allocating a first number of bytes of the shared memory to the deinterleaver to deinterleave a first plurality of Reed Solomon (RS) coded data bytes for transmission at a first data rate, wherein the allocated memory for the deinterleaver does not exceed the maximum number of bytes specified in the message; allocating a second number of bytes of the shared memory to an interleaver to interleave a second plurality of RS coded data bytes received at a second data rate; and deinterleaving the first plurality of RS coded data bytes within the shared memory allocated to the deinterleaver and interleaving the second plurality of RS coded data bytes within the shared memory allocated to the interleaver, wherein the shared memory allocated to the deinterleaver is used at the same time as the shared memory allocated to the interleaver.

[0023J These and other features and aspects of this invention are described in, or are apparent from, the following description of the embodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The embodiments of the invention will be described in detail, with reference to

5e

CA 02580280 2013-03-14 the following figures, wherein:

[0025] Fig. 1 is a functional block diagram illustrating an exemplary transceiver according to this invention;

[0026] Fig. 2 is a flowchart outlining an exemplary method of sharing resources according to this invention;

[0027] Fig. 3 is a flowchart outlining an exemplary method of determining a maximum amount of shared memory according to this invention; and

[0028] Fig. 4 is a flowchart outlining an exemplary resource sharing methodology according to this invention.

5f

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

DETAILED DESCRIPTION

[0029] The exemplary embodiments of this invention will be described in relation to sharing resources in a wired and/or wireless communications environment. However, it should be appreciated, that in general, the systems and methods of this invention will work equally well for any type of communication system in any environment.

[0030] The exemplary systems and methods of this invention will also be described in relation to multicarrier modems, such as DSL modems and VDSL modems, and associated communication hardware, software and communication channels. However, to avoid unnecessarily obscuring the present invention, the following description omits well-known structures and devices that may be shown in block diagram form or otherwise summarized.

[0031] For purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. It should be appreciated however that the present invention may be practiced in a variety of ways beyond the specific details set forth herein.

[0032] Furthermore, while the exemplary embodiments illustrated herein show the various components of the system collocated, it is to be appreciated that the various components of the system can be located at distant portions of a distributed

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 network, such as a telecommunications network and/or the Internet, or within a dedicated secure, unsecured and/or encrypted system. Thus, it should be appreciated that the components of the system can be combined into one or more devices, such as a modem, or collocated on a particular node of a distributed network, such as a telecommunications network. As will be appreciated from the following description, and for reasons of computational efficiency, the components of the system can be arranged at any location within a distributed network without affecting the operation of the system. For example, the various components can be located in a Central Office modem (CO, ATU-C, VTU-O), a Customer Premises modem (CPE, ATU-R, VTU-R), a DSL management device, or some combination thereof. Similarly, one or more functional portions of the system could be distributed between a modem and an associated computing device.

[0033] Furthermore, it should be appreciated that the various links, including communications channel 5, connecting the elements can be wired or wireless links, or any combination thereof, or any other known or later developed element(s) that is capable of supplying and/or communicating data to and from the connected elements. The term module as used herein can refer to any known or later developed hardware, software, firmware, or combination thereof that is capable of performing the functionality associated with that element. The terms determine, calculate and compute, and variations thereof, as used herein are used interchangeably and include any type of methodology, process, mathematical operation or technique. FCI block and latency path are used interchangeably herein as well as transmitting modem and transmitting transceiver. Receiving modem and receiving transceiver are also used

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 interchangeably.

[0034] Fig. 1 illustrates an exemplary embodiment of a transceiver 100 that utilizes shared resources. It should be appreciated that numerous functional components of the transceiver have been omitted for clarity. However, the transceiver 100 can also include the standard components found in typical communications device(s) in which the technology of the subject invention is implemented into.

[0035] According to an exemplary embodiment of the invention, memory and processing power can be shared among a plurality of transmitter and/or receiver latency paths, in a communications transceiver that carries or supports multiple applications. For example, the transmitter and/or receiver latency paths of the transceiver can share an interleaver/deinterleaver memory and the shared memory can be allocated to the interleaver and/or deinterleaver of each latency path. This allocation can be done based on the data rate, latency, BER, impulse noise protection requirements of the application, data or information being transported over each latency path, or in general any parameter associated with the communications system.

[0036] Likewise, for example, the transmitter and/or receiver latency paths can share a Reed-Solomon coder/decoder processing module and the processing power of this module can be allocated to each encoder and/or decoder. This allocation can be done based on the data rate/latency, BER, impulse noise protection requirements of the application data or information being transported over éach latency path, or in general based on any parameter associated with the communication system.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0037] In accordance with an exemplary operational embodiment, a first transceiver and a second transceiver transmit to one another messages during, for example, initialization which contain information on the total and/or shared memory capabilities of each transceiver and optionally information about the one or more latency paths. This information can be transmitted prior to determining how to configure the latency paths to support the application requirements. Based on this information, one of the modems can select an FCI configuration parameter(s) that meets the transmission requirements of each application being transported over each latency paths. While an exemplary of the embodiment of the invention will be described in relation to the operation of the invention and characteristics thereof being established during initialization, it should be appreciated that the sharing of resources can be modified and messages transmitted between a two transceivers at any time during initialization and/or user data transmission, i.e., SHOWTIME.

[0038] Fig. 1 illustrates an exemplary embodiment of a transceiver 100. The transceiver 100 includes a transmitter portion 200 and a receiver portion 300. The transmitter portion 200 includes one or more latency paths 210, 220, .... Similarly, the receiver portion 300 includes one or more latency paths 310, 320, .... Each of the latency paths in the transmitter portion 200 includes a framer, coder, and interleaver designated as 212, 214, 216 and 222, 224 and 226, respectively. Each of the latency paths in the receiver portion includes a deframer, decoder, and deinterleaver designated as 312, 314, 316 and 322, 324, and 326, respectively. The transceiver 100 further includes a shared processing module 110, a shared memory 120, a parameter

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 determination module 130, a path module 140, an allocation module 150, and a shared resource management module 160, all interconnected by one or more links (not shown).

[0039] In this exemplary embodiment, the transceiver 100 is illustrated with four total transmitter portion and receiver portion latency paths, i.e., 210, 220, 310, and 320. The shared memory 120 is shared amongst the two transmitter portion interleavers 216 and 226 and two receiver portion deinterleavers 316 and 326. The shared processing module 110, such as a shared coding module, is shared between the two transmitter portion coders 214 and 224 and the two receiver portion decoders 314 and 324.

[0040] While the exemplary embodiment of the invention will be described in relation to a transceiver having a number of transmitter portion latency paths and receiver portion latency paths, it should be appreciated that this invention can be applied to any transceiver having any number of latency paths. Moreover, it should be appreciated that the sharing of resources can be allocated such that one or more of the transmitter portion latency paths are sharing a shared resource, one or more of the receiver portion latency paths are sharing a shared resource, or a portion of the transmitter portion latency paths and a portion of the receiver portion latency paths are sharing shared resources. Moreover, any one or more of the latency paths, or portions thereof, could also be assigned to a fixed resource while, for example, another portion of the latency path(s) assigned to a shared resource. For example, in latency path 210, the interleaver 216 could be allocated a portion of the shared

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 memory 120, while the coder 214 could be allocated to a dedicated processing module, vice versa, or the like.

[0041] In accordance with the exemplary embodiment, a plurality of transmitter portion or receiver portion latency paths share an interleaver/deinterleaver memory, such as shared memory 120, and a coding module, such as shared processing module 110. For example, the interleaver/deinterleaver memory can be allocated to different interleavers and/or deinterleavers. This allocation can be based on parameters associated with the communication systems such as data rate, latency, BER, impulse noise protection, and the like, of the applications being transported. Similarly, a coding module, which can be a portion of the shared processing module 110, can be shared between any one or more of the latency paths. This sharing can be based on requirements such as data rate, latency, BER, impulse noise protection, and the like, of the applications being transported.

[0042] For example, an exemplary transceiver could comprise a shared interleaver/deinterleaver memory and could be designed to allocate a first portion of the shared memory 120 to an interleaver, such as interleaver 216 in the transmitter portion of the transceiver and allocate a second portion of the shared memory 120 to a deinterleaver, such as 316, in the receiver portion of the transceiver.

[0043] Alternatively, for example, an exemplary transceiver can comprise a shared interleaver/deinterleaver memory, such as shared memory 120, and be designed to allocate a first portion of shared memory 120 to a first interleaver, e.g.,

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

216, in the transmitter portion of the transceiver and allocate a second portion of the shared memory to a second interleaver, e.g., 226, in the transmitter portion of the transceiver.

[0044] Alternatively, for example, an exemplary transceiver can comprise a shared interleaver/deinterleaver memory and be designed to allocate a first portion of the shared memory 120 to a first deinterleaver, e.g., 316, in the receiver portion of the transceiver and allocate a second portion of the shared memory to a second deinterleaver, e.g., 326, in the receiver portion of the transceiver. Regardless of the configuration, in general any interleaver or deinterleaver, or grouping thereof, be it in a transmitter portion or receiver portion of the transceiver, can be associated with a portion of the shared memory 120.

[0045] Establishment, configuration and usage of shared resources is performed in the following exemplary manner. First, and in cooperation with the path module 140, the number of transmitter and receiver latency paths (N) is determined. The parameter determination module 130 then analyses one or more parameters such as data rate, transmitter data rate, receiver data rate, impulse noise protection, bit error rate, latency, or the like. Based on one or more of these parameters, the allocation module 150 allocates a portion of the shared memory 120 to one or more of the interleaver and/or deinterleavers, or groupings thereof. This process continues until the memory allocation has been determined and assigned to each of the N latency paths.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0046] Having determined the memory allocation for each of the latency paths, and in conjunction with the shared resource management 160, the transceiver 100 transmits to a second transceiver one or more of the number of latency paths (N), the maximum interleaver memory for any one or more of the latency paths and/or the maximum total and/or shared memory for all of the latency paths.

[0047] Three examples of sharing interleaver/deinterleaver memory and coding processing in a transceiver are described below. The latency paths in these examples can be in the transmitter portion of the transceiver or the receiver portion of the transceiver.

[0048] Example #1

A first transmitter portion or receiver portion latency path may carry data from a video application, which needs a very low BER but can tolerate higher latency. In this case, the video will be transported using an latency path that has a large amount of interleaving/deinterleaving and coding (also known as Forward Error Correction (FEC) coding). For example, the latency path may be configured with Reed-Solomon coding using a codeword size of 255 bytes (N=255) with 16 checkbytes (R=16) and interleaving/deinterleaving using an interleaver depth of 64 (D=64). This latency path will require N*D=16*255=16Kb ytes of interleaver memory at the transmitter (or deinterleaver memory at the receiver). This latency path will be able to correct a burst of errors that is less than 512 bytes in duration.

[0049] A second transmitter portion or receiver portion latency path may carry an

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 internet access application that requires a medium BER and a medium amount of latency. In this case, the internet access application will be transported using a latency path that has a medium amount of interleaving and coding. For example, the latency path may be configured with Reed-Solomon coding using a codeword size of 128 bytes (N=128) with 8 checkbytes (R=8) and interleaving using an interleaver depth of 16 (D=32). This latency path will require N*D=128*32=4Kbytes of interleaver memory and the same amount of deinterleaver memory. This latency path will be able to correct a burst of errors that is less than 128 bytes in duration.

[0050] A third transmitter portion or receiver portion latency path may carry a voice telephony application, which needs a very low latency but can tolerate BER. In this case, the video will be transported using an latency path that has a large amount of interleaving and coding. For example, the third transmitter portion or receiver portion latency path may be configured with no interleaving or coding which will result in the lowest possible latency through the latency path but will provide no error correction capability.

[0051] According to the principles of this invention, a system carrying the three applications described above in Example #1, would have three latency paths that share one memory space containing at least (16+4)=20 Kbytes. The three latency paths also share a common coding block that is able to simultaneously encode (in the transmitter portion) or decode (in a receiver portion) two codewords with

N=255/R=16 andN=128/R=8.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0052] According to an exemplary embodiment of this invention, the latency paths can be reconfigured at initialization or during data transmission mode (also known as SHOWTIME in ADSL and VDSL transceivers). This would occur if, for example, the applications or application requirements were to change.

[0053] Example #2

If instead of 1 video application, 1 internet application and 1 voice application, there were 3 internet access applications then the transmitter portion and/or receiver portion latency paths would be reconfigured to utilize the shared memory and coding module in a different way. For example, the system could be reconfigured to have 3 transmitter portion or receiver portion latency paths, with each latency path being configured with Reed-Solomon coding using a codeword size of 128 bytes (N=128) with 8 checkbytes (R=8) and interleaving using an interleaver depth of 16 (D=32). Each latency path will require N*D=128*32=4Kbytes of interleaver memory and each block will be able to correct a burst of errors that is less than 128 bytes in duration. Based on the example of carrying the three internet access applications described, the three latency path share one memory space containing at least 3*4=12 Kbytes. Also the three latency paths share a common coding block that is able to simultaneously encode (on the transmitter side) or decode (on the receiver side) three codewords with N=128/R=16, N=128/R=8 and N=128/R=8.

[0054] Example #3

The system could be configured to carry yet another set of applications. For example, the latency paths could be configured to carry 2 video applications. In this case only

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 transmitter portion or receiver portion latency paths are needed, which means that the third latency path could be simply disabled. Also, assuming that the memory is constrained based on the first example above, then the maximum shared memory for these 2 latency paths is 20 kBytes. In this case, the system could be reconfigured to have 2 latency paths, with each block being configured with Reed-Solomon coding using a codeword size of 200 bytes (N=200) with 10 checkbytes (R=10) and interleaving/deinterleaving using an interleaver depth of 50 (D=50). Each latency path will require N*D=200*50=^:10Kbytes of interleaver memory and each block will be able to correct a burst of errors that is less than 250 bytes in duration. This configuration results in 20K of shared memory for both latency paths, which is the same as in the first example. In order to stay within the memory constraints of the latency paths, the error correction capability for each latency path is decreased to 250 bytes from 512 bytes in Example #1.

[0055] Another aspect of this invention is the how FCI configuration information is transmitted between a first modem and a second modem. FCI configuration information will depend on the requirements of the applications being transported over the DSL connection. This information may need to be forwarded during initialization in order to initially configure the DSL connection. This information may also need to be forwarded during SHOWTIME in order to reconfigure the DSL connection based on a change in applications or the application requirements.

[0056] According to one embodiment, a first modem determines the specific FCI configuration parameters, e.g,. N, D, R as defined above, needed to meet specific

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 application requirements, such as latency, burst error correction capability, etc. In order to determine the FCI configuration parameters, the first modem must know what are the capabilities of a second modem. For example, the first modem must know how many latency paths (FCI blocks) the second modem can support. Also the first modem must know the maximum amount of interleaver memory for each transmitter latency path. In addition, since the transmitter latency paths may share a common memory space the first modem must know the total shared memory for all transmitter latency paths. This way the first modem will be able to choose a configuration that can meet application requirements and also meet the transmitter portion latency path capabilities of the second modem.

[0057] For example, using values from examples above, a first transceiver could send a message to a second transceiver during initialization or during SHOWTIME containing the following information:

• Number of supported transmitter and receiver latency paths = 3 • Max Interleaver Memory for latency path #1=16 Kbytes • Max Interleaver Memory for latency path #2= 16 Kbytes • Max Interleaver Memory for latency path #3= 16 Kbytes • Maximum total/shared memory for all latency paths = 20 kBytes Based on this information, and the application requirements, the first transceiver would select latency path settings. For example, if the applications are 1 video, 1 internet access and 1 voice application, the first transceiver could configure 3 latency paths as follows:

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 latency path #1 - Video: N=255, R=16, D=64 latency path #2 - Video: N=128, R=8, D=32 latency path #3 - Video: N=0, R=0, D=1 (no coding or interleaving)

[0058] This would result in a total interleaver memory of 20 kbytes.

[0059] Alternatively, if for example, there are only 2 video applications, the first transceiver could configure 2 latency paths as follows:

latency path #1 - Video: N=200, R=10, D=50 latency path #2 - Video: N=200, R=10, D=50 latency path #3 - Video: N=0, R=0, D=1 (no coding or interleaving)

[0060] This would also result in a total interleaver memory of 20 kbytes.

[0061] Alternatively, the second transceiver can determine the specific FCI configuration parameters, e.g., N, D, R as defined above, needed to meet specific application requirements, such as latency, burst error correction capability, etc. As described above for the first transceiver, in order to determine the FCI configuration parameters, the second transceiver must first know what are the capabilities of the first transceiver. In this case, the first transceiver would send a message to the second transceiver containing the information described above and based on this information and the application requirements the second transceiver would select latency path settings.

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

[0062] Fig. 2 outlines an exemplary method of allocating shared memory in a transceiver. More specifically, control begins in step S200 and continues to step S210. In step S210, one or more of shared interleaver/deinterleaver memory and/or shared coder/decoder processing resources are allocated to one or more latency paths, in a transceiver. Control then continues to step S220 where the control sequence ends.

[0063] Fig. 3 outlines an exemplary method of exchanging shared resource allocations according to an exemplary embodiment of this invention. In particular, control begins in step S310. In step S310, a maximum amount of shared memory that can be allocated to a specific interleaver or deinterleaver of a plurality of interleavers or deinterleavers in a transceiver is determined. Next, in step S320, the determined maximum amount for one or more of the deinterleavers and/or interleavers is transmitted to another transceiver. Messages containing additional information can also be transmitted to the other transceiver and/or received from the other transceiver.

I

Control then continues to step S330 where the control sequence ends.

[0064] Fig. 4 outlines an exemplary procedure for resource sharing according to an exemplary embodiment of this invention. In particular, control begins in step S400 and continues to step S410. In step S410, the number of latency paths are determined. Then, in step S420, the latency path information (FCI block information) is transmitted to another transceiver. Messages containing additional information can also be transmitted to the other transceiver and/or received from the other transceiver.

This information can be used to, for example, assist with the determination of

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 memory allocation in the transceiver. Moreover, the messages received from the other transceiver could specify what the memory allocation is to be based on, for example, the number of latency paths, memory allocation in the remote transceiver and required applications. Control then continues to step S430.

[0065] In step S430, and for each latency path, the steps in step 440 are performed.

[0066] In step S440, and while monitoring of allocation of resources is being performed, steps 450 and 460 are performed. More specifically, in step S450, one or more parameters associated with the communication system are determined. Then, in step S460, shared resources are allocated based on one or more of the communication parameters. Control then continues to step S470.

[0067] In step S470, the allocation of shared resources is communicated to another transceiver. Next, in step S480, a determination is made as to whether there is a change in communications that would require the adjustment of the shared resource allocation. Examples of changes in communications conditions include a change in applications being transported over the system and/or changes in the channel condition, etc. If adjustments are required, control jumps back to step S410. Otherwise, control jumps to step S490 where the control sequence ends.

[0068] The above-described system can be implemented on wired and/or wireless telecommunications devices, such a modem, a multicarrier modem, a DSL modem, an

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015

ADSL modem, an XDSL modem, a VDSL modem, a linecard, test equipment, a multicarrier transceiver, a wired and/or wireless wide/local area network system, a satellite communication system, a modem equipped with diagnostic capabilities, or the like, or on a separate programmed general purpose computer having a communications device or in conjunction with any of the following communications protocols: CDSL, ADSL2, ADSL2+, VDSL1, VDSL2, HDSL, DSL Lite, IDSL, RADSL, SDSL, UDSL or the like.

[0069] Additionally, the systems, methods and protocols of this invention can be implemented on a special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element(s), an ASIC or other integrated circuit, a digital signal processor, a hard-wired electronic or logic circuit such as discrete element circuit, a programmable logic device such as PLD, PLA, FPGA, PAL, a modem, a transmitter/receiver, any comparable means, or the like. In general, any device capable of implementing a state machine that is in turn capable of implementing the methodology illustrated herein can be used to implement the various communication methods, protocols and techniques according to this invention.

[0070] Furthermore, the disclosed methods may be readily implemented in software using object or object-oriented software development environments that provide portable source code that can be used on a variety of computer or workstation platforms. Alternatively, the disclosed system may be implemented partially or fully in hardware using standard logic circuits or VLSI design. Whether software or

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 hardware is used to implement the systems in accordance with this invention is dependent on the speed and/or efficiency requirements of the system, the particular function, and the particular software or hardware systems or microprocessor or microcomputer systems being utilized. The communication systems, methods and protocols illustrated herein can be readily implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the functional description provided herein and with a general basic knowledge of the computer and telecommunications arts.

[0071] Moreover, the disclosed methods may be readily implemented in software that can be stored on a storage medium, executed on programmed general-purpose computer with the cooperation of a controller and memory, a special purpose computer, a microprocessor, or the like. In these instances, the systems and methods of this invention can be implemented as program embedded on personal computer such as an applet, JAVA® or CGI script, as a resource residing on a server or computer workstation, as a routine embedded in a dedicated communication system or )

system component, or the like. The system can also be implemented by physically incorporating the system and/or method into a software and/or hardware system, such as the hardware and software systems of a communications transceiver.

[0072] It is therefore apparent that there has been provided, in accordance with the present invention, systems and methods for sharing resources. While this invention has been described in conjunction with a number of embodiments, it is

CA 02580280 2007-03-09

WO 2006/044227

PCT/US2005/036015 evident that many alternatives, modifications and variations would be or are apparent to those of ordinary skill in the applicable arts. Accordingly, it is intended to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of this invention.