Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

287 results about "Multiple edges" patented technology

In graph theory, multiple edges (also called parallel edges or a multi-edge), are two or more edges that are incident to the same two vertices. A simple graph has no multiple edges.

Full-automatic mask production line

The invention discloses a full-automatic mask production line. The production line comprises a machine frame, a mask fabric edge banding device, a mask surface folding device, a mask transverse sealing cutting device and an ear strip welding device; the mask fabric edge banding device comprises a fabric feeding device, a fabric edge folding device, a fabric splicing device, a fabric drawing mechanism and a nose bridge strip feeding device, the fabric edge folding device comprises a lower supporting plate and an upper pressing plate, the upper pressing plate is arranged above the lower supporting plate, two side edges of the lower supporting plate are provided with multiple edge folding side plates which are sequentially arranged from front to back, a nose bridge strip flowing pipe is arranged between the backmost edge folding side plate and the upper pressing plate, and the discharging port of the nose bridge strip feeding device faces the front end of the nose bridge strip flowing pipe; the fabric splicing device comprises a splicing motor, a first ultrasound mold, a rotary shaft, a first splicing wheel and a second splicing wheel, a strip-shaped groove is formed in the circumferential surface of the first splicing wheel, and the strip-shaped groove faces the rear end of the nose bridge strip flowing pipe. By means of the mask production line, edge banding process of fabrics can be automatically completed, and the nose bridge strip is accurately added into the edge banding parts of the fabrics.
Owner:汕头市泰恩康医用器材厂有限公司

Characterizing achievable flow rates in multi-hop mesh networks with orthogonal channels

A method of routing data from a source node to a destination node in a multi-hop network of nodes interconnected by links comprises: (a) determining that a link-flow vector satisfies one or more necessary scheduling conditions for achievability, wherein the link-flow vector represents a set of flows to be routed on one or more links from the source node to the destination node; (b) generating a scheduling multi-graph for the network, wherein the scheduling multi-graph comprises a graph having at least one pair of nodes with multiple edges therebetween; (c) deriving one or more sufficient scheduling conditions for achievability of the link-flow vector by edge-coloring the scheduling multi-graph; (d) solving a linear optimization problem over the one or more necessary scheduling conditions to obtain an upper bound on the achievability of the link-flow vector; (e) generating, based on the scheduling multi-graph, a solution comprising a set of routes and an associated schedule for achieving the link-flow vector, the solution being a lower bound on the achievability of the link-flow vector; and (f) implementing a routing method using the set of routes and the associated schedule to route the link-flow vector from the source node to the destination node. At least one node v of the network is adapted to receive transmissions from a specified plurality Ω(v) of other nodes, and at least one of the scheduling conditions depends on Ω(v).
Owner:ALCATEL-LUCENT USA INC +1

Quasi-cyclic low density parity check code (LDPC) construction method and device based on protographs

The invention discloses a quasi-cyclic low density parity check code (LDPC) construction method and a device based on protographs. The protographs are expanded for two times in the construction method. A first expansion time L1 is smaller. A correcting progressive edge growth (PEG) algorithm is adopted to remove multiple edges of protographs. The girths of codes which are expanded are increased. A second expansion time is L2 and a cyclic shift offset is selected for connection which is established in the first expansion. Each connection corresponds to a unit cyclic matrix, wherein the size of the unit cyclic matrix is L2 * L2. The method references a local optimization idea of the PEG algorithm to construct a basis matrix of the quasi-cyclic LDPC code. The connection is established between each row of variable nodes and checking nodes and is confirmed in corresponding cyclic shift offset process. According to the correcting PEG algorithm, new rings formed in the basis matrix caused by the newly established connection are gone through. The fact that expansion factors A of the rings are larger than one is guaranteed. Thus, the rings with length of four are avoided. The number of short rings is reduced. The short rings which are small in connectivity emerge in a checking matrix are avoided by utilizing an ACE multiplication principle.
Owner:PEKING UNIV

Service differentiating and quality control system and method for multiple edge wideband access network

The invention relates to a discrimination and quality control system for multi-edge broadband access service and a method thereof. The system comprises a service strategy application interface, a dynamic service tactical management platform and down flux service strategy actuating equipment, wherein the service strategy application interface is used for enabling a user terminal to send a service strategy service request to the dynamic service tactical management platform, and the request contains service control parameters; the dynamic service tactical management platform is used for making network control strategies according to the service control parameters, and distributing the network control strategies to the down flux service strategy actuating equipment, and the network control strategies contain service quality parameters; and the down flux service strategy actuating equipment is used for receiving and executing the down traffic flow control strategies distributed from the dynamic service tactical management platform, and applying the down traffic flow control strategies to the user terminal. The invention realizes the accurate management and control on the up and down traffic flow of the access network, the collaborative control on various service strategies and the unified management of various service attributes by operators.
Owner:CHINA TELECOM CORP LTD

A method for constructing a code-rate-compatible protograph LDPC code based on deep space communication environment

InactiveCN104158550ALow decoding thresholdLow decoding computational complexityError correction/detection using multiple parity bitsMultiple edgesComputation complexity
The invention discloses a method for constructing a code-rate-compatible protograph LDPC code based on deep space communication environment. The method includes: 1) obtaining multiple code-rate-compatible protographs based on row and column extension of an ARAPA proto matrix; 2) then executing extension four times on the obtained series of protographs in a PEG algorithm, to remove multiple edges and obtain the protograhs having no multiple edges; and 3) lastly executing extension several times on the above protographs in the PEG algorithm again, to obtain the code-rate-compatible protograph LDPC code having certain code length and having quasi-cyclic characteristic. This code-rate-compatible LDPC code constructed based on the matrix extension method has a lower decoding threshold and a lower error-code floor. Compared with code-rate-compatible LDPC code constructed based on AR4JA protographs, the code-rate-compatible LDPC code constructed based on the present method has the similar performance thereto, however has the lower decoding threshold and decoding calculation complexity, and has superior performance especially in the case of high code-rate, which can obtain the performance gain of about 0.2 dB in the case that BER is 10<-6>.
Owner:CHONGQING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products