Patents by Inventor Ludovicus Marinus Gerardus Maria Tolhuizen
Ludovicus Marinus Gerardus Maria Tolhuizen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20120224571Abstract: A method for wireless communication in a network comprising a resource-restricted device, and at least one proxy device, wherein the method comprises the following steps:-the resource-restricted device (ZGPD) transmitting a frame containing source identifier to be forwarded to a destination device in the network,-the proxy device (ZP5) receiving the frame,-the proxy constructing, from the frame, a packet to be forwarded to the destination device,-the router device associating a delay to the packet and scheduling forwarding of the packet after this delay, wherein the step of constructing a packet from the frame comprises deriving source-related information from the received packet and including this information in the packet.Type: ApplicationFiled: November 2, 2010Publication date: September 6, 2012Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V.Inventors: Wei Yuan, Ludovicus Marinus Gerardus Maria Tolhuizen, Bozema Erdmann, Stephan Schlumbohm
-
Patent number: 7804835Abstract: An apparatus (1001), system (1000) and method (800-900) are provided for improving the de-encapsulation of sections from Multi Protocol Encapsulation (MPE) (151) and Multi Protocol Encapsulation-Forward Error Correction (MPE-FEC) (152) Sections in a DVB-H transport stream. DVB-H is a standard for broadcasting services to hand-helds. Its difference from DVB-T, C, and S that is relevant for this invention is the presence of an additional layer of Forward Error Correction (FEC). Instead of restoring only correctly received sections (151) (152) the present invention also restores fragments of sections (151) (152) by using both Transport Stream packet headers (301. i.1) and section headers (151.1). As a result, entire sections (800-900) may not be erased (which can amount to up to 4080 bytes) whenever one or more fragments are received incorrectly, but only the incorrectly received fragments (which can be each up to 184 bytes) are erased.Type: GrantFiled: January 16, 2006Date of Patent: September 28, 2010Assignee: Taiwan Semiconductor Manufacturing Company, Ltd.Inventors: Arie Geert Cornelis Koppelaar, Ludovicus Marinus Gerardus Maria Tolhuizen, Onno Eerenberg
-
Publication number: 20090067311Abstract: The present invention relates to a method of recording secondary information on a record carrier, in particular on an optical record carrier, besides its content information, whereby it is possible to differentiate the record carrier from other record carrier bearing the same content information, for example by recording an individual identifier. The secondary information is recorded by: forming at predetermined positions dummy patterns (23), preferably at the same moment as when recording the content information, and recording the secondary information by selectively modifying the dummy patterns, thereby obtaining modified dummy patterns (24), wherein the dummy patterns as well as the modified dummy patterns correspond to valid channel words. The invention further relates to an apparatus for recording secondary information, to a record carrier, and to a method and to an apparatus for reproducing the secondary information.Type: ApplicationFiled: November 4, 2005Publication date: March 12, 2009Applicant: KONINKLIJKE PHILIPS ELECTRONICS, N.V.Inventors: Peter Bentvelsen, Ludovicus Marinus Gerardus Maria Tolhuizen, Willem Marie Julia Marcel Coene
-
Publication number: 20090067424Abstract: The invention provides methods and apparatus for transmitting and receiving a source data block in a wireless communication system using hybrid automatic retransmission request protocol. According to the scheme provided by the invention, at transmitting side, the source data block or part of source data block that is not decoded correctly at receiving side is divided into a plurality of data segments, each the plurality of data segments may be paded with known data to expand the data segments to be a predetermined lengthen, the data segment is encoded with linear code to be a data packet including the data segment and a redundancy information segment or including only redundancy information, and after that the encoded data packets are transmitted.Type: ApplicationFiled: February 15, 2007Publication date: March 12, 2009Applicant: Koninklijke Philips Electronics N.V.Inventors: Xiaobo Zhang, Qi Zhou, Ni Ma, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Publication number: 20080282310Abstract: An apparatus (1001), system (1000) and method (800-900) are provided for improving the de-encapsulation of sections from Multi Protocol Encapsulation (MPE) (151) and Multi Protocol Encapsulation-Forward Error Correction (MPE-FEC) (152) Sections in a DVB-H transport stream. DVB-H is a standard for broadcasting services to hand-helds. Its difference from DVB-T, C, and S that is relevant for this invention is the presence of an additional layer of Forward Error Correction (FEC). Instead of restoring only correctly received sections (151) (152) the present invention also restores fragments of sections (151) (152) by using both Transport Stream packet headers (301. i.1) and section headers (151.1). As a result, entire sections (800-900) may not be erased (which can amount to up to 4080 bytes) whenever one or more fragments are received incorrectly, but only the incorrectly received fragments (which can be each up to 184 bytes) are erased.Type: ApplicationFiled: January 16, 2006Publication date: November 13, 2008Applicant: NXP B.V.Inventors: Arie Geert Cornelis Koppelaar, Ludovicus Marinus Gerardus Maria Tolhuizen, Onno Eerenberg
-
Patent number: 7251251Abstract: A method and system of transmitting messages include requesting to submit a first request for transmitting a first message and to submit a second request for transmitting a second message until there is no first collision detected between the submitted first and second requests upon receipt of the submitted first and second requests. Before there is no first collision detected between the submitted first and second requests, it is requested to submit a third request for transmitting a third message and to submit a fourth request for transmitting a fourth message. However, requesting to re-submit the third request for transmitting the third message and to re-submit the fourth request for transmitting the fourth message if a second collision is detected between the submitted third and the second requests upon receipt thereof is delayed until there is no first collision detected between the submitted first and second requests.Type: GrantFiled: October 8, 2002Date of Patent: July 31, 2007Assignee: Koninklijke Philips Electronics N.V.Inventors: Theodorus Jacobs Johannes Denteneer, Ewa Barbara Hekstra-Nowacka, Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Patent number: 7185263Abstract: A method of decoding possibly mutilated code words (r) of a code (C) includes decoding the differences (D) of a number (L?1) of pairs of possibly mutilated code words (rib, ri+1) to obtain estimates (u, v) for the differences of the corresponding pairs of code words (ci, ci+1), combining the estimates (u, v) to obtain a number (L) of at least two corrupted versions (wj) of a particular code word (c), forming a code vector (z) from the number (L) of corrupted versions (wj) of the particular code word (c) in each coordinate, decoding the code vector (z) to a decoded code word (c?) in the code (C), and using the generator matrix (G) to obtain the information word (m) and the address word (a) embedded in the decoded code word (c?).Type: GrantFiled: February 14, 2003Date of Patent: February 27, 2007Assignee: Koninklijke Philip Electronics N. V.Inventors: Andries Pieter Hekstra, Constant Paul Marie Jozef Baggen, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Patent number: 7103829Abstract: A method of selecting a generator matrix (G) for encoding information words (m) including information symbols (m1, m2, mk) into codewords (c) of a code (C) provides an enhanced error correction capability if at least one information symbol (m1, m2, m3) is known a priori to a decoder decoding received, possibly mutilated codewords (r). In order to design a code of which the correction power is enhanced if some information symbols are known to the decoder prior to decoding, the generator matrix (G) is selected such that the minimum Hamming distance of at least one subcode (C?) of the code (C) is larger than the minimum Hamming distance of the code (C), and that a subcode generator matrix (G?) of the at least one subcode (C?) is derived from the generator matrix (G) of the code (C) by omitting the at least one row from the generator matrix (G) corresponding to the at least one a priori known information symbol (m1, m2, m3).Type: GrantFiled: May 13, 2002Date of Patent: September 5, 2006Assignee: Koninklijke Philips Electronics N.V.Inventors: Marten Erik Van Dijk, Constant Paul Marie Jozef Baggen, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Patent number: 7047477Abstract: The invention relates to method of encoding address words (a) comprising address symbols (a0, a1, . . . ak?1) into codewords (c) of a code (C) for providing an enhanced error correction capability if at least one information symbol (m1) of information words (m) is known a priori to a decoder decoding received, possibly mutilated codewords (r). The invention relates further to a method of decoding possibly mutilated codewords (r).Type: GrantFiled: August 15, 2002Date of Patent: May 16, 2006Assignee: Koninklijke Philips Electronics N.V.Inventors: Ludovicus Marinus Gerardus Maria Tolhuizen, Martinus Wilhelmus Blum, Constant Paul Marie Jozef Baggen
-
Patent number: 7009993Abstract: A method for contention resolution in a transmission system (1) is described, the system (1) having a primary station (2) and a plurality of secondary stations (3) coupled to the primary station (2). Sign-On request messages are being sent by the primary station (2) marking starts of contention periods, numbered i=0, 1, 2 . . . , and having period length Pi; whereby a number Mi of the secondary stations (3) sends a Sign-On response message to the primary station (2) in contention period i, and, after sending, waits a feedback period of length Tfb for a response from the primary station (2). If Ni denotes the number of secondary stations (3) participating at the start of contention period i; an approximation for Mi save for a possible constant factor reads: Ni. Pi?1/(Pi?1+Tfb) for i=1, 2,??(1) such that the respective period lengths Pi are determined based on said approximation for Mi.Type: GrantFiled: February 19, 2002Date of Patent: March 7, 2006Assignee: Koninklijke Philips Electronics N.V.Inventors: Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Patent number: 6967968Abstract: A communication network comprises a head-end and a plurality of network terminations coupled thereto through a shared communication channel, which is accessed by a protocol having one or more dedicated slots wherein upstream data cells are contained, which may collide in a transmission wherein two or more network terminations try to access the shared communication channel practically simultaneously. Herein the protocol is arranged such that the one or more dedicated slots precede the moment whereon the first next downstream transmission is started to be prepared by the head-end. In that case actual information in the dedicated slots can be fed back without substantial delay to the network terminations in order to provide them by return with actual contention information.Type: GrantFiled: December 6, 2000Date of Patent: November 22, 2005Assignee: Koninklijke Philips Electronics N.V.Inventors: Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen, Ewa Barbara Hekstra-Nowacka
-
Publication number: 20030198248Abstract: A communication network comprises a head-end and a plurality of network terminations coupled thereto through a shared communication channel, which is accessed by a protocol having one or more dedicated slots wherein upstream data cells are contained, which may collide in a transmission wherein two or more network terminations try to access the shared communication channel practically simultaneously. Herein the protocol is arranged such that the one or more dedicated slots precede the moment whereon the first next downstream transmission is started to be prepared by the head-end. In that case actual information in the dedicated slots can be fed back without substantial delay to the network terminations in order to provide them by return with actual contention information.Type: ApplicationFiled: December 6, 2000Publication date: October 23, 2003Inventors: Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen, Ewa Barbara Hekstra-Nowacka
-
Publication number: 20030095056Abstract: The invention relates to method of encoding address words (a) comprising address symbols (a0, a1, . . . , ak−1) into codewords (c) of a code (C) for providing an enhanced error correction capability if at least one information symbol (m1) of information words (m) is known a priori to a decoder decoding received, possibly mutilated codewords (r). The invention relates further to a method of decoding possibly mutilated codewords (r).Type: ApplicationFiled: August 15, 2002Publication date: May 22, 2003Inventors: Ludovicus Marinus Gerardus Maria Tolhuizen, Martinus Wilhelmus Blum, Constant Paul Marie Jozef Baggen
-
Publication number: 20030091060Abstract: The invention relates to a method and a system that are used during tree-search or stack contention-resolution protocols that resolve message transmission collisions between for example Cable Television stations (CaTV). The CaTV broadband data network provides two-way communication between subscriber computer systems (102, 104, 106, 110, 112, 114) and the CaTV head-end (100). In order to resolve collisions between messages sent by CaTVs a method of transmitting a plurality of messages, the plurality of messages being transmitted over a communication channel is provided. This method comprises: requesting to submit a first request for transmitting a first message of the plurality of messages and to submit a second request for transmitting a second message of the plurality of messages until there is no first collision detected between the submitted first request and the submitted second request upon receipt of the submitted first and second request.Type: ApplicationFiled: October 8, 2002Publication date: May 15, 2003Inventors: Theodorus Jacobs Johannes Denteneer, Ewa Barbara Hekstra-Nowacka, Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Publication number: 20030066014Abstract: The invention relates to a method of selecting a generator matrix (G) for encoding information words (m) comprising information symbols (m1, m2, . . . , mk) into codewords (c) of a code (C) for providing an enhanced error correction capability if at least one information symbol (m1, m2, m3) is known a priori to a decoder decoding received, possibly mutilated codewords (r). The invention relates further to a method of encoding information words (m) into codewords (c) and to a method of decoding possibly mutilated codewords (r).Type: ApplicationFiled: May 13, 2002Publication date: April 3, 2003Inventors: Marten Erik Van Dijk, Constant Paul Marie Jozef Baggen, Ludovicus Marinus Gerardus Maria Tolhuizen
-
Publication number: 20020114344Abstract: A method for contention resolution in a transmission system (1) is described, the system (1) having a primary station (2) and a plurality of secondary stations (3) coupled to the primary station (2). Sign-On request messages are being sent by the primary station (2) marking starts of contention periods, numbered i=0, 1, 2 . . . , and having period length Pi; whereby a number Mi of the secondary stations (3) sends a Sign-On response message to the primary station (2) in contention period i, and, after sending, waits a feedback period of length Ttb for a response from the primary station (2).Type: ApplicationFiled: February 19, 2002Publication date: August 22, 2002Inventors: Serverius Petrus Paulus Pronk, Ludovicus Marinus Gerardus Maria Tolhuizen