Abstract: Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. LDPC codes also offer error correction performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with the code length. They also offer challenges relating to the decoding complexity of the binary error-correction codes themselves and error floors limiting achievable bit-error rates. A new Relaxed Half-Stochastic (RHS) decoding algorithm is presented that reduces decoding complexity for high decoding throughput applications. The RHS algorithm uses an approach based on stochastic decoding algorithms but differs significantly from the conventional approaches of LDPC decoder implementation.

Abstract: Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. They also offer performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with code length. They also offer challenges relating to decoding complexity and error floors limiting achievable bit-error rates.

Abstract: Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. They also offer performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with code length. They also offer challenges relating to decoding complexity and error floors limiting achievable bit-error rates.

Abstract: Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. LDPC codes also offer error correction performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with the code length. They also offer challenges relating to the decoding complexity of the binary error-correction codes themselves and error floors limiting achievable bit-error rates. A new Relaxed Half-Stochastic (RHS) decoding algorithm is presented that reduces decoding complexity for high decoding throughput applications. The RHS algorithm uses an approach based on stochastic decoding algorithms but differs significantly from the conventional approaches of LDPC decoder implementation.

Abstract: The invention concerns a project management tool comprising a plurality of terminals communicating with a central server, at least one of the terminals including: means (11) for defining project models and for inserting them in a model library (6a), each project model including a list of step models, one step representing a set of tasks contributing to the achievement of the project; means (15) for defining a scenario defining links between a source model and a target model, each link being associated with a condition concerning the properties of the source model of the link; means (21) for generating projects from project models and steps from step models; and means (30) for updating and display the state of the project steps, and for generating a new step from the target model of a scenario link, when the condition associated with the link is fulfilled.

Abstract: A system and method for interactively selecting call treatment in real time for an incoming call in a radio telecommunications network. A modified mobile station includes a display, a browser application that presents call information regarding the incoming call and call-treatment options on a pop-up menu the display, a keypad for a user to select a call-treatment option, and a Client Access Function Teleservice (CATS) handler that packages the selected call-treatment option in an IS-136 R-DATA message and sends the R-DATA message to a modified mobile switching center (MSC). The MSC determines that the R-DATA message is a CATS message from the value of the Higher Layer Protocol Identifier (HLPI) in the R-DATA message, and sends the call-treatment option to a modified service node in a short message service (SMS) message.

Abstract: A customer administrative system of a wireless communications system is interfaced with one or more system database network elements to support not only transaction oriented communications, but also query oriented communications. Logic is included in the interface to process and translate search request queries for database network element handling. Results of any searches performed in response to the queries are returned to the interface. The logic then collects the information comprising the results of the searches, and supports file transfer of the collected information to the requesting customer administrative system.

Abstract: External entity data access to the customer administrative system and database network elements of a telecommunications network is provided through a web-server and an Internet connection. The integrity and security of any stored data is protected through the use of a firewall implemented at the web-server. In one aspect, an interface is connected between the customer administrative system and database network elements and is also connected to the web-server to handle external entity requests by specifying not only which actions need to be taken but also routing the request to a proper destination. In a second aspect, the interface is by-passed with respect to the handling of external entity requests, with the web-server specifying the actions to be taken and routing the request to the proper destination.