41.
    发明专利
    未知

    公开(公告)号:DE3688980D1

    公开(公告)日:1993-10-07

    申请号:DE3688980

    申请日:1986-10-30

    Applicant: IBM

    Abstract: A process for multirate subband encoding voice signals. At least a portion of the original signal bandwidth is plit into p sub-bands the contents of which is to be coded using dynamic allocation of quantizing levels throughout the sub-bands. Let's assume the signal is to be coded for a set of coding rates R(1) Then the sub-band samples S(i,j) are quantized according to 1(i; R(K). And, finally the obtained quantized sub-band samples are embedded into a multirate frame.

    VOICE CODING PROCESS AND DEVICE FOR IMPLEMENTING SAID PROCESS

    公开(公告)号:CA1285071C

    公开(公告)日:1991-06-18

    申请号:CA535921

    申请日:1987-04-29

    Applicant: IBM

    Abstract: The voice signal is analyzed to derive therefrom a low frequency base band signal, linear prediction coefficients and HF descriptors. Said HF descriptors include HF energy indications as well as indications relative to the phase shift between the low frequency and the high frequency band. Said HF descriptors are used during the voice synthesis operation to provide an inphase HF bandwidth component to be added to the base band prior to be used for driving a linear prediction synthesis filter tuned using said linear prediction parameters. Fig. 2 FR 9 85 008

    44.
    发明专利
    未知

    公开(公告)号:FR2389277A1

    公开(公告)日:1978-11-24

    申请号:FR7713995

    申请日:1977-04-29

    Applicant: IBM FRANCE

    Abstract: A coding process, given a total number of available bits per unit time, allocates to each of a plurality of signal channels a number of bits proportional to information in the channel. The process is useful for transcoding BCPCM (Block Coded PCM) voice signals for lower bit rate and conserving transmission channel bandwidth.

    45.
    发明专利
    未知

    公开(公告)号:DE60130844D1

    公开(公告)日:2007-11-22

    申请号:DE60130844

    申请日:2001-07-05

    Applicant: IBM

    Abstract: Data communication system of the type wherein a plurality of contiguous transmission networks constitute an Autonomous System (AS) using the Open Shortest Path First (OSPF) protocol for the exchange of information. The system is divided into several areas including an area 0 or backbone responsible for distributing routing information between the other areas. The backbone is divided into two sub-areas and comprises at least a pair of adjacent splitting routers. The first splitting router is included in one sub-area and the second splitting router is included in the other sub-area. The topological data base of each splitting router is configured to define a high metric for the link between the splitting routers in order to prevent any type of data traffic other than link-state messages (LSA) from being transmitted between the splitting routers.

    46.
    发明专利
    未知

    公开(公告)号:DE69331054D1

    公开(公告)日:2001-12-06

    申请号:DE69331054

    申请日:1993-07-30

    Applicant: IBM

    Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure : a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.

    DYNAMICALLY STRUCTURED DATA TRANSFER MECHANISM IN AN ATM NETWORK

    公开(公告)号:CA2153446A1

    公开(公告)日:1996-03-20

    申请号:CA2153446

    申请日:1995-07-07

    Applicant: IBM

    Abstract: The invention relates to a method for dynamically changing the bit rate or bandwidth of constant bit rate data structures in an Asynchronous Transfer Mode (ATM) communications environment. The method is caracterized in that it includes the steps of: a) defining within said data channel a Change Indicator (CI) indicative of an end user's request for a bit rate change within said data structures; b) continuously transmitting said Change Indicator from the source side to the destination side, along with the data structures on said data channel; c) upon receipt at said destination side of a user's request of a bit rate change, modifying the value of said Change Indicator; d) at said source side, acknowledging the modification of the value of said Change Indicator, whereby the transmission of data structures continues on the data channel with a new constant bit rate .

    48.
    发明专利
    未知

    公开(公告)号:DE3853161D1

    公开(公告)日:1995-03-30

    申请号:DE3853161

    申请日:1988-10-19

    Applicant: IBM

    Abstract: A signal vector quantizing coder (CELP) is provided with an adaptive codebook originally loaded with preselected codewords. The codebook is split into a fixed contents portion and a fixed length adaptive contents portion. During coding operations, the codewords dynamically selected for coding the coder input signal are shifted into the fixed length adaptive codebook section for codebook contents updating purposes.

    Method and Apparatus for an Automatic Decomposition of a Network Topology Into a Backbone and Subareas

    公开(公告)号:CA2123441A1

    公开(公告)日:1995-01-31

    申请号:CA2123441

    申请日:1994-05-12

    Applicant: IBM

    Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure : a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.

Patent Agency Ranking