Patents by Inventor Arnaud Gueguen

Arnaud Gueguen 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: 20220011052
    Abstract: The invention relates to a method for manufacturing a brazed plate type heat exchanger comprising the following steps: a) stacking, with a clearance, a plurality of plates parallel to each other so as to define, between said plates, a plurality of passages suitable for the flow of at least one fluid, said passages being delimited by peripheral edges and at least one passage comprising at least one zone to be supported emerging towards the outside of the passage through at least one opening of a peripheral edge; b) arranging at least one support member in the zone to be supported; c) brazing the stack of plates comprising the support member; and d) removing the support member from the zone to be supported through the opening. According to the invention, the support member is deformable and, in step d), a traction force is exerted on the support member so as to cause a deformation in at least one part of the support member and a translation movement of the support member towards the outside of the passage.
    Type: Application
    Filed: November 20, 2019
    Publication date: January 13, 2022
    Applicant: L'Air Liquide, Societe Anonyme pour l'Etude et l'Exploitation des Procedes Georges Claude
    Inventors: Camille MARIE, Eric MASLIAH, Ludovic AMANT, Arnaud GUEGUEN
  • Patent number: 7835473
    Abstract: A method of determining a metric for evaluating an error probability of a data frame includes receiving, at a radio receiving device, the data frame encoded according to a coding method and transmitted through a radio communication channel by a radio transmitting device. The data frame includes a plurality of symbols. The method also includes performing a channel equalization of the data frame received at the radio receiving device to produce a channel equalized data frame, performing a symbol de-mapping of symbols in the channel equalized data frame to produce a de-mapped data frame, obtaining soft bits based on the de-mapped data frame and characteristics of the coding method, and calculating the metric from at least one moment, having an order strictly greater than one, of quantities that characterize an equivalent communication channel for the soft bits.
    Type: Grant
    Filed: November 29, 2005
    Date of Patent: November 16, 2010
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: Abdel-Majid Mourad, Arnaud Gueguen
  • Patent number: 7672389
    Abstract: The present invention concerns a method for transmitting symbols through at least a channel in a telecommunication system including at least one transmitter (10) provided with at least two transmitting antennas (Antt 1, Antt 2) and at least one receiver provided with at least one receiving antenna (Antr 1), the method includes an encoding step wherein a vector comprising symbols is multiplied by a coding matrix for producing coded symbols to be transmitted over the at least one communication channel established between the transmitter (10) and the receiver (20), wherein the coding matrix is calculated from an eigenvalue decomposition of a matrix obtained by calculating at least the Kronecker product of the identity matrix of size N, N being the time and/or the frequency dimension of the code and a matrix obtained from an estimated correlation matrix of the response of the channel. The invention concerns also the associated device and a method and device for decoding symbols.
    Type: Grant
    Filed: May 18, 2006
    Date of Patent: March 2, 2010
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventor: Arnaud Gueguen
  • Patent number: 7292658
    Abstract: A method for decoding at least one signal transmitted by means of at least one antenna and received by means of at least one antenna, which method includes a symbol decoding step for producing at least one estimated symbol representative of at least one transmitted symbol carried by the received signal. The symbol decoding step is executed by a space-time decoder including a symbol decoder configured to produce an estimation of at least one symbol with respect to which estimation the transmitted symbol features a minimum mean square error. The minimum mean square error symbol decoder requires less operating computing power than other decoders currently used for decoding incoming symbols, like list sphere decoders.
    Type: Grant
    Filed: February 27, 2004
    Date of Patent: November 6, 2007
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventor: Arnaud Gueguen
  • Patent number: 7200797
    Abstract: A method of optimizing the size of blocks of coded data intended to be subjected to an iterative decoding process, a maximum error rate of the iterative decoding process being fixed in advance, in which there are sought, among a plurality of block sizes (N/k) which are submultiples of the normal block size by an integer factor (k) greater than or equal to 1 and a plurality of integers giving the maximum number of iterations that can be effected by the said iterative decoding on a block, (1) a submultiple size, and (2) a maximum number of iterations such that they are compatible with the maximum error rate, and such that the mean number of iterations that will be applied by the iterative decoding process on a block of submultiple size is minimized.
    Type: Grant
    Filed: March 6, 2002
    Date of Patent: April 3, 2007
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventor: Arnaud Gueguen
  • Publication number: 20070058746
    Abstract: The present invention concerns a method for transmitting symbols through at least a channel in a telecommunication system including at least one transmitter (10) provided with at least two transmitting antennas (Antt 1, Antt 2) and at least one receiver provided with at least one receiving antenna (Antr 1), the method includes an encoding step wherein a vector comprising symbols is multiplied by a coding matrix for producing coded symbols to be transmitted over the at least one communication channel established between the transmitter (10) and the receiver (20), wherein the coding matrix is calculated from an eigenvalue decomposition of a matrix obtained by calculating at least the Kronecker product of the identity matrix of size N, N being the time and/or the frequency dimension of the code and a matrix obtained from an estimated correlation matrix of the response of the channel. The invention concerns also the associated device and a method and device for decoding symbols.
    Type: Application
    Filed: May 18, 2006
    Publication date: March 15, 2007
    Applicant: MITSUBISHI DENKI KABUSHIKI
    Inventor: Arnaud Gueguen
  • Patent number: 7127443
    Abstract: A digital transmission method includes detecting a parameter of the transmission conditions, selecting a distribution of elementary coding step redundancies from a plurality of distributions of elementary coding step redundancies for which the global efficiency is equal to a target efficiency, performing a coding procedure including elementary coding steps with corresponding puncturing steps, and an interleaving step between the elementary coding steps, each of the elementary coding steps adding a redundancy by utilizing the distribution of elementary coding step redundancies, to a useful information to generate a coded information with a redundancy for a transmission, and performing a decoding procedure including elementary decoding steps, deinterleaving and depuncturing steps, and puncturing and interleaving steps corresponding to the elementary decoding steps to obtain an estimation of the useful information item.
    Type: Grant
    Filed: March 9, 2001
    Date of Patent: October 24, 2006
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: Arnaud Gueguen, David Mottier
  • Publication number: 20060146946
    Abstract: The present invention concerns a method of determining a metric for evaluating an error probability of a data frame transmitted by a first device to a second device through communication channels, a data frame comprising a plurality of symbols, wherein the metric is determined at least from at least one moment of an order strictly upper than one of quantities characterising the equivalent communication channels for the plurality of items of information obtained from symbols comprised in the data frame. The present invention concerns also the associated device.
    Type: Application
    Filed: November 29, 2005
    Publication date: July 6, 2006
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventors: Abdel-Majid Mourad, Arnaud Gueguen
  • Patent number: 7027521
    Abstract: A digital transmission method with error correcting coding includes a coding procedure and a decoding procedure in order to correct transmission errors. The coding procedure includes a plurality of elementary coding steps operating in parallel or in series. The decoding procedure is iterative and includes, for each iteration, a plurality of elementary decoding steps which correspond to the plurality of elementary coding steps. Each elementary decoding step generates at least one weighted output information item. A characteristic quantity is generated directly from a set of weighted output information items generated by each elementary decoding step for processing a decoding sequence. A comparison step is adapted to compare the characteristic quantity with a threshold quantity determined by a threshold quantity determination step. An interrupt step interrupts the iterative decoding procedure at the elementary decoding step when the characteristic quantity reaches the threshold quantity.
    Type: Grant
    Filed: February 7, 2001
    Date of Patent: April 11, 2006
    Assignee: Mitsubishi Denki Nabushiki Kaisha
    Inventor: Arnaud Gueguen
  • Patent number: 6993697
    Abstract: The present invention concerns a method for obtaining an error correcting code of a given first size (N), including a systematic information part of a given second size (K) and a redundancy part. A block turbo-code is first obtained from said systematic information part and from predetermined information elements provided at known locations, said block turbo-code consisting in a product of elementary systematic block codes, at least said predetermined information elements being removed from the obtained block turbo-code to produce a shortened block turbo-code. An additional error correcting code is derived from at least a portion of said shortened block turbo-code and said shortened block turbo-code is stuffed with stuffing elements so as to attain said given first size, said stuffing elements being information elements of said additional error correcting code.
    Type: Grant
    Filed: December 3, 2002
    Date of Patent: January 31, 2006
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: Nadine Chapalain, Arnaud Gueguen, Damien Castelain
  • Patent number: 6961894
    Abstract: A digital transmission method of the error-correcting coding type which includes, before a step of transmitting on a channel, a coding procedure including at least one puncturing step, and, after the transmission step, a decoding procedure including at least one depuncturing step, the coding procedure, applying a given coding scheme, generating a coded information item representing, with a certain redundancy, the useful information item and the decoding procedure estimating said useful information item by correcting transmission errors. This digital transmission method also includes a step of observing the transmission conditions and a puncturing scheme selection step for selecting, according to the at least one parameter, an optimum performance puncturing scheme amongst a plurality of predetermined puncturing schemes, the overall efficiency of the coding step and the puncturing step being a constant efficiency.
    Type: Grant
    Filed: February 5, 2001
    Date of Patent: November 1, 2005
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: David Mottier, Arnaud Gueguen
  • Patent number: 6892335
    Abstract: A method of optimizing the size of blocks of coded data, intended to be subjected to iterative decoding, the method comprising a first step of evaluating a resource (T) available for the decoding of a block of normal size (N) and a second step of seeking, amongst a plurality of block sizes (N/k) which are submultiples of the normal size by an integer factor (k) greater than or equal to 1 and requiring on average a number of iterations ({overscore (n)}iterations(k)) compatible with the said available resource, the one which makes it possible to obtain the lowest error rate at the output of the iterative decoding.
    Type: Grant
    Filed: March 11, 2002
    Date of Patent: May 10, 2005
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventor: Arnaud Gueguen
  • Patent number: 6845481
    Abstract: A method of improving turboencoding by re-encoding erroneous information and subtracting their contribution at the input of the turboencoder. The subtraction of this contribution remedies the lack of convergence or convergence towards erroneous solutions observed in certain turbodecoding configurations. The method also applies to parallel concatenation turbodecoding, to serial concatenation turbodecoding, or to block turbodecoding. Different operations result according to the type of feedback envisaged.
    Type: Grant
    Filed: April 6, 2001
    Date of Patent: January 18, 2005
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: Arnaud Gueguen, Nadine Chapalain
  • Publication number: 20040228423
    Abstract: The present invention relates to a method for decoding at least one signal Sg1, Sg2 . . . SgN transmitted by means of at least one antenna and received by means of at least one antenna, which method includes a symbol decoding step for producing at least one estimated symbol representative of at least one transmitted symbol carried by the received signal.
    Type: Application
    Filed: February 27, 2004
    Publication date: November 18, 2004
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventor: Arnaud Gueguen
  • Publication number: 20030126548
    Abstract: The present invention concerns a method for obtaining an error correcting code of a given first size (N), including a systematic information part of a given second size (K) and a redundancy part.
    Type: Application
    Filed: December 3, 2002
    Publication date: July 3, 2003
    Applicant: MITSUBSHI DENKI KABUSHIKI KAISHA
    Inventors: Nadine Chapalain, Arnaud Gueguen, Damien Castelain
  • Publication number: 20030061190
    Abstract: The coding procedure comprises at least two elementary coding steps associated with respective puncturing steps and concatenated in series, an interleaving step occurring between two successive elementary coding steps. According to the invention, the method also comprises a transmission conditions observation step for determining at least one parameter characteristic of the transmission conditions, a redundancy distribution selection step (33; 43) for selecting, as a function of the said at least one parameter, one distribution of the said elementary coding step redundancies amongst a plurality of distributions of the said elementary coding step redundancies for which the said global efficiency is the same, and a coding procedure adaptation step (33) for adapting the said coding procedure as a function of the said selected redundancy distribution.
    Type: Application
    Filed: November 13, 2001
    Publication date: March 27, 2003
    Inventors: Arnaud Gueguen, David Mottier
  • Publication number: 20020194555
    Abstract: Method of optimising the size of blocks of coded data, intended to be subjected to iterative decoding, the method comprising a first step evaluating a resource (T) available for the decoding of a block of normal size (N) and a second step seeking, amongst a plurality of block sizes (N/k) which are submultiples of the normal size by an integer factor (k) greater than or equal to 1 and requiring on average a number of iterations ({overscore (n)}iterations) compatible with the said available resource, the one which makes it possible to obtain the lowest error rate at the output of the iterative decoding.
    Type: Application
    Filed: March 11, 2002
    Publication date: December 19, 2002
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventor: Arnaud Gueguen
  • Publication number: 20020159429
    Abstract: Method and device for optimising, under performance constraint, the size of blocks of coded data Method of optimising the size of blocks of coded data intended to be subjected to iterative decoding, a maximum error rate at the output of the iterative decoding being fixed in advance, in which there are sought, amongst a plurality of block sizes (N/k) which are submultiples of the normal block size by an integer factor (k) greater than or equal to 1 and a plurality of integers giving the maximum number of iterations (niteration(k)) which can be effected by the said iterative decoding on a block, a submultiple size and a maximum number of iterations such that they are compatible with the said maximum error rate and such that a mean number of iterations ({overscore (n)}iteration(k)) which would be effected by the iterative decoding on a block of submultiple size is as low as possible.
    Type: Application
    Filed: March 6, 2002
    Publication date: October 31, 2002
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventor: Arnaud Gueguen
  • Publication number: 20020013922
    Abstract: A digital transmission method of the error correcting coding type comprises a coding procedure before transmission and a decoding procedure in order to obtain a correction of the transmission errors. The said coding procedure comprises a plurality of elementary coding steps associated in parallel or in series. The decoding procedure is iterative and comprises, for each iteration, a plurality of elementary decoding steps (50) which correspond to the said plurality of elementary coding steps and which each generate at least one extrinsic information item. According to the invention a characteristic quantity determination step (51) calculates a characteristic quantity from a set of weighted output information,on items generated by an elementary decoding step (50) for processing a decoding sequence. A comparison step (53) is adapted to compare the said characteristic quantity with a threshold quantity determined by a threshold quantity determination step (52).
    Type: Application
    Filed: February 7, 2001
    Publication date: January 31, 2002
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventor: Arnaud Gueguen
  • Publication number: 20010039638
    Abstract: Turbodecoding method with re-encoding of erroneous information and feedback The invention in general terms relates to a method of improving turbodecoding by re-encoding erroneous information and subtracting their contribution at the input of the turbodecoder. The subtraction of this contribution remedies the lack of convergence or convergence towards erroneous solutions observed in certain turbodecoding configurations. The invention applies equally well to parallel concatenation turbodecoding, to serial concatenation turbodecoding or to block turbodecoding. Several embodiments are presented according to the type of feedback envisaged.
    Type: Application
    Filed: April 6, 2001
    Publication date: November 8, 2001
    Applicant: MITSUBISHI DENKI KABUSHIKI KAISHA
    Inventors: Arnaud Gueguen, Nadine Chapalain