US 7738595

Here is a concise summary of US patent 7738595:

US Patent 7738595: Multiple input, multiple output communications systems

• Title: Multiple input, multiple output communications systems
• Assignee: Integral Wireless Technologies LLC
• Inventor: James Stuart Wight
• Filing Date: July 2, 2004
• Issue Date: June 15, 2010
• Abstract: Embodiments of the present invention include systems and methods for optimizing the transmitter and receiver weights of a MIMO system. In one embodiment, the weights are optimized to create and steer beam nulls, such that each transmitted signal is substantially decoupled from all other signals between a MIMO transmitter and a MIMO receiver. In another embodiment, the weights are selected such that the signal strength of each weighted signal transmitted through a communications channel along a respective signal path is substantially equivalent, but for which the weighting vectors are not necessarily orthogonal. In a further embodiment, each transmitted signal is coupled only between its own transmitter and receiver antennas with a gain, or eigenvalue, that is a consequence of the weights, and which is bounded to within a desired range of values while at the same time the weighting vectors are orthogonal. Embodiments employing successive decomposition are also provided.

Plain-Language Overview of Independent Claims:

• Claim 1: Describes a MIMO signal transmitter with at least two vector multipliers that weight input signals, and at least two antennas to transmit these weighted signals. The key feature is that the weighting vectors are calculated using a unit magnitude decomposition of the transmission channel matrix. This decomposition results in a unitary matrix with eigenvalues that are essentially on a unit circle in the complex plane, which helps ensure equal signal-to-noise ratios.
• Claim 3: Describes a complete MIMO system, encompassing both a transmitter and a receiver. Similar to Claim 1, it specifies that the transmit vectors used in the transmitter are computed using a unit magnitude decomposition of the transmission channel matrix, leading to eigenvalues that lie substantially on a unit circle of a complex plane.
• Claim 5: Details a multiple-input, multiple-output signal transmitter comprising vector multipliers and combiners. The vector multipliers apply a specific weighting vector of the form R⁻¹V to input signals. Here, R⁻¹ is the inverse of an upper triangular matrix R, where the channel matrix H is represented as the product of a unitary matrix Q and R (H=QR). V comprises the eigenvectors for the unitary matrix Q.
• Claim 7: Describes a multiple-input, multiple-output signal transmission system, including transmit vector multipliers, combiners, and antennas. Similar to Claim 5, the weighting applied to the input signals is a vector of the form R⁻¹V, where R⁻¹ is the inverse of an upper triangular matrix R (derived from H=QR) and V comprises eigenvectors for the unitary matrix Q.
• Claim 9: Covers a receiver in a MIMO system. This receiver has antennas to receive signals and multipliers to weight them with a receive vector. A notable aspect is that the transmit vector (used by the remote transmitter) is specified as being computed by decomposing the transmission channel matrix into a unitary matrix whose eigenvalues lie substantially on a unit circle of a complex plane.
• Claim 11: Describes a receiver with at least two antennas and at least two receive vector multipliers. The antennas receive signals that have already been weighted by a transmit weight vector of the form R⁻¹V. The receive vector multipliers then apply a receive weight vector of the form V⁻¹ to these received signals. As in earlier claims, R⁻¹ is the inverse of an upper triangular matrix R (where H=QR), and V⁻¹ is the inverse of a matrix V that includes eigenvectors for the unitary matrix Q.

Uncertainty Note:
A search for US patent 7738595 in the CAFC 2026 dockets did not yield specific results detailing litigation for this patent number in 2026. General CAFC summaries for 2026 were found, but none directly mention US7738595. The Google Patents record indicates that the "Family has litigation," with cases filed in Texas Eastern District Court and Florida Southern District Court, but does not specifically detail any 2026 CAFC activity for this patent number.

The Google Patents record for US7738595 indicates that the "Family has litigation," with specific cases filed in the Texas Eastern District Court and Florida Southern District Court. However, it does not provide explicit details of plaintiff, defendant, case number, filing date, or outcome for these cases. A search on Unified Patents for US7738595 did not yield specific litigation cases directly linked to this patent number.

Therefore, based on the available information:

Known Litigation Involving US Patent 7738595:

The Google Patents record broadly indicates that the patent family is involved in litigation, with cases filed in the Texas Eastern District Court and Florida Southern District Court. However, the specific details regarding plaintiff(s), defendant(s), case number, filing date, and outcome or current status for US patent 7738595 are not provided in the readily available patent information or through a direct search of Unified Patents.

Proceedings overview

There are no AIA trial proceedings on file for US patent 7738595 as of the most recent ingest from the USPTO ODP API, and a web search did not surface any additional PTAB proceedings. This indicates that the patent has not been challenged through IPR, PGR, or CBM trials to date, leaving all claims untested by the PTAB.

Strategic summary

As of the current date, all claims of US patent 7738595 are UNTESTED by the Patent Trial and Appeal Board (PTAB). No IPR, PGR, or CBM proceedings have been initiated or concluded against this patent. This means that none of the claims have been challenged or invalidated through these specific administrative processes.

The absence of PTAB activity implies that there is no estoppel landscape established under § 315(e)(2) for this patent. Therefore, any potential petitioner or defendant facing assertion of this patent would theoretically have all prior-art grounds available for an IPR, PGR, or CBM petition, assuming they meet the statutory requirements for filing. There are no pattern signals to discern regarding aggressive patent owner defense at the PTAB, multiple filings by the same petitioner, or involvement of defensive aggregators like Unified Patents, as no proceedings exist.

Recommended next steps

Since no PTAB activity exists for US patent 7738595, the recommended next steps for a potential defendant facing assertion of this patent are as follows:

• Absence of PTAB activity is a signal: The lack of PTAB challenges for a patent that was granted in 2010 can be interpreted in several ways. It might suggest that the patent has not been widely asserted, or that prior art challenges have not been deemed strong enough to warrant an AIA trial, or that it has been licensed without PTAB challenge.
• Evaluate for potential PTAB challenge: If facing an assertion of this patent, conduct a thorough prior art search and an invalidity analysis to determine if strong grounds exist for an IPR, PGR, or CBM petition. Given that the claims are untested, this remains a viable defensive option.
• Monitor for future filings: Continue to monitor USPTO PTAB E2E for any newly filed petitions against US7738595.

Inventors

• James Stuart Wight: At the time of filing on July 2, 2004, James Stuart Wight was likely an individual inventor, as the application was filed by "Individual" and subsequently assigned to ICEFYRE SEMICONDUCTOR CORPORATION shortly thereafter. His employer at the time of filing is not explicitly stated, but the initial "Individual" filing suggests he was not employed by a large corporate entity in a typical in-house invention capacity for the initial filing.

Original assignee

The patent application for US7738595 was initially filed by the individual inventor, James Stuart Wight. The first corporate assignee recorded was ICEFYRE SEMICONDUCTOR CORPORATION, which received the assignment on August 27, 2004. Information regarding whether ICEFYRE SEMICONDUCTOR CORPORATION shipped a product embodying the claims, their primary line of business, or their current operational status is not readily available through public patent records or general web searches. Therefore, their status is unclear.

Assignment timeline

The following is a chronological list of recorded assignments for US Patent 7738595, based on a search of the USPTO Assignment Center.

• 2004-07-28 (executed) / recorded 2004-08-27 — Reel 012579/0474

  • Conveyance: Assignment
  • Assignor: WIGHT, JAMES STUART
  • Assignee: ICEFYRE SEMICONDUCTOR CORPORATION
  • Correspondent: GREGORY E. MOORE, 1500 WEST EL CAJON BLVD., SUITE 240, SAN DIEGO, CA 92108.
  • Context: Transfer from individual inventor to a corporate entity. ICEFYRE SEMICONDUCTOR CORPORATION was a wireless LAN chip company that wound down operations in May 2005.

• 2005-11-21 (executed) / recorded 2005-12-07 — Reel 017042/0456

  • Conveyance: Assignment
  • Assignor: ICEFYRE SEMICONDUCTOR CORPORATION
  • Assignee: ICEFYRE SEMICONDUCTOR, INC.
  • Correspondent: BARRY P. GOLDMAN, INTELLECTUAL PROPERTY LAW GROUP LLP, 18775 MADRONE CT., SARATOGA, CA 95070.
  • Context: Internal reorganization or name change from "Corporation" to "Inc." for IceFyre.

• 2005-12-22 (executed) / recorded 2006-01-09 — Reel 017122/0126

  • Conveyance: Assignment
  • Assignor: ICEFYRE SEMICONDUCTOR, INC.
  • Assignee: ZARBANA DIGITAL FUND, LLC
  • Correspondent: MICHAEL L. KENNEDY, 321 NORTH CLARK STREET, SUITE 2400, CHICAGO, IL 60610.
  • Context: Transfer from the now defunct IceFyre Semiconductor to Zarbana Digital Fund, LLC. This appears to be a fire-sale or acquisition of assets from a distressed company.

• 2024-10-09 (executed) / recorded 2024-10-10 — Reel 068202/0695

  • Conveyance: Assignment
  • Assignor: ZARBANA DIGITAL FUND LLC
  • Assignee: INTELLECTUAL VENTURES ASSETS 199 LLC
  • Correspondent: JEFFREY C. WRIGHT, INTELLECTUAL VENTURES, 3450 118TH AVE SE, BELLEVUE, WA 98005. This correspondent and firm are highly associated with Intellectual Ventures, a known patent monetization entity.
  • Context: Transfer to an Intellectual Ventures entity, a well-known patent monetization company.

• 2024-10-16 (executed) / recorded 2024-10-16 — Reel 068222/0209

  • Conveyance: Assignment
  • Assignor: INTELLECTUAL VENTURES ASSETS 199 LLC
  • Assignee: INTEGRAL WIRELESS TECHNOLOGIES LLC
  • Correspondent: JEFFREY C. WRIGHT, INTELLECTUAL VENTURES, 3450 118TH AVE SE, BELLEVUE, WA 98005. This correspondent also appears on the previous assignment.
  • Context: Transfer from one Intellectual Ventures entity (IVA 199 LLC) to another entity (Integral Wireless Technologies LLC), which has been linked to Empire IP, a Texas monetization firm that divests portfolios from Intellectual Ventures.

Timeline diagram

timeline
    title Ownership of US 7738595
    2004 : Filed by James Stuart Wight
         : Assigned to IceFyre Semi Corp
    2005 : Assigned to IceFyre Semi Inc
         : Assigned to Zarbana Digital Fund LLC
    2010 : Patent Issued
    2024 : Assigned to Intellectual Ventures Assets 199 LLC
         : Assigned to Integral Wireless Technologies LLC

NPE / troll-pattern signals

1. Shell-entity transfer — Present.

   • ZARBANA DIGITAL FUND, LLC (Reel 017122/0126, recorded 2006-01-09): This entity name suggests a financial investment vehicle rather than an operating company. No readily available information confirms it produced products embodying the claims.
   • INTELLECTUAL VENTURES ASSETS 199 LLC (Reel 068202/0695, recorded 2024-10-10): This is a known Intellectual Ventures entity. Intellectual Ventures operates as a patent monetization firm and is widely described as a patent troll.
   • INTEGRAL WIRELESS TECHNOLOGIES LLC (Reel 068222/0209, recorded 2024-10-16): This entity was created in Texas on September 30, 2024, and is linked to Empire IP, a Texas monetization firm that divests portfolios from Intellectual Ventures. Its managing members are identified as New York lawyers, Daniel Mitry and Timothy Salmon, founders of Empire IP. This strongly indicates a licensing-only shell entity.

2. Known asserter in the chain — Present.

   • INTELLECTUAL VENTURES ASSETS 199 LLC (Reel 068202/0695, recorded 2024-10-10): Intellectual Ventures (IV) is a well-known patent monetization firm, often described as a patent troll, that acquires and licenses large patent portfolios.
   • INTEGRAL WIRELESS TECHNOLOGIES LLC (Reel 068222/0209, recorded 2024-10-16): Integral Wireless Technologies LLC is identified as a Texas monetization firm (Empire IP LLC) that has initiated litigation for patents acquired from Intellectual Ventures. Cases have been filed against D-Link and Lutron.

3. Repeat correspondent across the chain — Present.

   • JEFFREY C. WRIGHT, INTELLECTUAL VENTURES (Reel 068202/0695, recorded 2024-10-10, and Reel 068222/0209, recorded 2024-10-16): Jeffrey C. Wright from Intellectual Ventures appears as the correspondent for both the transfer to Intellectual Ventures Assets 199 LLC and the subsequent transfer to Integral Wireless Technologies LLC. This indicates a consistent legal representative for the patent monetization activities originating from Intellectual Ventures.

4. Cascading transfers — Present.

   • Zarbana Digital Fund LLC to Intellectual Ventures Assets 199 LLC (2024-10-10) and Intellectual Ventures Assets 199 LLC to Integral Wireless Technologies LLC (2024-10-16) occurred within a very short timeframe (6 days). Both transfers used the same correspondent, Jeffrey C. Wright, Intellectual Ventures, indicating a coordinated transfer within a monetization strategy.

5. Pre-litigation transfer — Present.

   • The transfer to INTEGRAL WIRELESS TECHNOLOGIES LLC was recorded on 2024-10-16 (Reel 068222/0209). Litigation involving Integral Wireless Technologies LLC and this patent family was filed in March 2025 (Florida Southern District Court) and May 2025 (Texas Eastern District Court). This indicates a transfer within 6 months before the first infringement suit, specifically for assertion purposes.

6. Bankruptcy fire-sale — Present.

   • The transfer from ICEFYRE SEMICONDUCTOR, INC. to ZARBANA DIGITAL FUND, LLC (Reel 017122/0126, recorded 2006-01-09) occurred after IceFyre Semiconductor Corporation announced it was winding down operations in May 2005. This is consistent with a fire-sale of assets from a failing company.

7. Privateering — Unclear.

   • While Intellectual Ventures and Integral Wireless Technologies LLC are actively asserting the patent, there's no explicit public information in the provided context or search results indicating an operating company transferred the patent specifically to assert against its competitors on its behalf. Intellectual Ventures' model involves aggregating patents for monetization, which can include patents from various sources.

8. Defensive aggregator (anti-NPE) — Not present.

   • The chain terminates with Integral Wireless Technologies LLC, which is actively involved in patent litigation, not defensive aggregation.

Verdict

NPE — high confidence. The assignment history shows multiple strong signals: the initial acquisition from a defunct operating company (IceFyre) by Zarbana Digital Fund, LLC (Reel 017122/0126, 2006-01-09) resembling a fire-sale, followed by the acquisition by Intellectual Ventures Assets 199 LLC (Reel 068202/0695, 2024-10-10), a known patent monetization entity. This was quickly followed by a transfer to Integral Wireless Technologies LLC (Reel 068222/0209, 2024-10-16), a shell entity directly associated with a Texas monetization firm (Empire IP LLC) and linked to active litigation shortly after the transfer. The recurrence of Jeffrey C. Wright as correspondent further solidifies this pattern.

USPTO Patent Assignment Search for US7738595

To identify the most relevant prior art for US patent 7738595, I will examine the "Cited By" and "Citations" sections of the patent itself, as listed in the provided full patent text. The USPTO's Patent Public Search tool can be used for direct searches of patent numbers. I will then analyze each cited patent against the independent claims of US7738595 to determine potential anticipation under 35 U.S.C. § 102.

Based on the provided patent text, here are some of the cited prior art patents:

Cited Patents (Examiner Citations):

• US6091361A

  • Full Citation: US6091361A, "Method and apparatus for joint space-time array signal processing", Davis; Dennis W., Issued: 2000-07-18, Filed: 1998-05-12.
  • Brief Description: This patent describes a method and apparatus for joint space-time array signal processing. It focuses on combining spatial and temporal processing to improve signal reception in wireless communication systems.
  • Potential Anticipation: This patent generally relates to multi-antenna systems and signal processing. While it addresses space-time processing for improved signal quality, it doesn't explicitly detail the "unit magnitude decomposition" with eigenvalues on a unit circle (Claims 1, 3, 9) or the specific R⁻¹V / V⁻¹ weighting schemes (Claims 5, 7, 11) as defined in the independent claims of US7738595. Further analysis would be needed to determine if the underlying mathematical principles or an equivalent are present.

• US6307882B1

  • Full Citation: US6307882B1, "Determining channel characteristics in a space-time architecture wireless communication system having multi-element antennas", Lucent Technologies Inc., Issued: 2001-10-23, Filed: 1998-07-10.
  • Brief Description: This patent describes methods for determining channel characteristics in wireless communication systems with multi-element antennas, which is crucial for effective MIMO operation.
  • Potential Anticipation: This patent focuses on channel estimation, which is a prerequisite for applying the weighting methods of US7738595. It doesn't appear to directly disclose the specific decomposition methods or weighting vectors claimed in US7738595 (Claims 1, 3, 5, 7, 9, 11).

• US20020118781A1

  • Full Citation: US20020118781A1, "Method and device for multiple input/multiple output transmit and receive weights for equal-rate data streams", Thomas Timothy A., Publication date: 2002-08-29, Filing date: 2000-12-29.
  • Brief Description: This patent application describes a method and device for determining transmit and receive weights in MIMO systems to achieve equal-rate data streams. This aligns with the objective of US7738595 to equalize signal strengths.
  • Potential Anticipation: This reference is highly relevant as it explicitly discusses transmit and receive weights for equal-rate data streams in MIMO. It would require a detailed comparison to ascertain if its methods for deriving these weights (e.g., the specific mathematical decompositions) fully anticipate the "unit magnitude decomposition" (Claims 1, 3, 9) or the R⁻¹V / V⁻¹ weighting (Claims 5, 7, 11) of US7738595.

• US6446025B1

  • Full Citation: US6446025B1, "Multiple propagation wave parameter measuring method and apparatus and machine-readable recording medium recording multiple propagation wave parameter measuring program", Nec Corporation, Issued: 2002-09-03, Filed: 1998-03-26.
  • Brief Description: This patent concerns measuring multiple propagation wave parameters, which is fundamental to understanding and characterizing wireless channels for MIMO.
  • Potential Anticipation: Similar to US6307882B1, this patent provides foundational technology for channel characterization rather than the specific weighting and decomposition methods claimed in US7738595.

• US20020126045A1

  • Full Citation: US20020126045A1, "Radio-wave arrival-direction estimating apparatus and directional variable transceiver", Takaaki Kishigami, Publication date: 2002-09-12, Filing date: 2000-12-12.
  • Brief Description: This patent application relates to estimating the arrival direction of radio waves and directional transceivers, which can be used in multi-antenna systems for beamforming.
  • Potential Anticipation: While relevant to antenna array manipulation, this reference does not appear to directly anticipate the specific decomposition techniques (Unit Magnitude Decomposition or Successive Decomposition with SVD) and weighting vector forms (R⁻¹V, V⁻¹) central to the independent claims of US7738595.

• US20030203743A1

  • Full Citation: US20030203743A1, "Multiple-Input Multiple-Output Radio Transceiver", Cognio, Inc., Publication date: 2003-10-30, Filing date: 2002-04-22.
  • Brief Description: This patent application describes a MIMO radio transceiver. The abstract mentions beamforming for multiple-input multiple-output systems.
  • Potential Anticipation: This patent is broadly related to MIMO transceivers and beamforming. A detailed examination of its method for determining beamforming weights would be necessary to assess potential anticipation of the specific decomposition techniques of US7738595.

• US20040023621A1

  • Full Citation: US20040023621A1, "System and method for multiple-input multiple-output (MIMO) radio communication", Sugar Gary L., Publication date: 2004-02-05, Filing date: 2002-07-30.
  • Brief Description: This patent application describes a MIMO radio communication system and method. The abstract discusses processing signals for transmission and reception in a MIMO environment.
  • Potential Anticipation: This reference is relevant as a general MIMO system. A deeper dive into its specific signal processing and weighting algorithms would be needed to determine if it anticipates the unique decomposition methods of US7738595.

• US20040165676A1

  • Full Citation: US20040165676A1, "Transmission schemes for multi-antenna communication systems utilizing multi-carrier modulation", Ranganathan Krishnan, Publication date: 2004-08-26, Filing date: 2003-02-25.
  • Brief Description: This patent application focuses on transmission schemes for multi-antenna systems using multi-carrier modulation (e.g., OFDM), which is also mentioned in US7738595 as a context for its application.
  • Potential Anticipation: This patent addresses multi-antenna systems and OFDM. While the context is similar, the specific "unit magnitude decomposition" or "Successive Decomposition with a Final SVD" and the resulting weighting vectors (R⁻¹V, V⁻¹) are the distinctive features of US7738595, which would need to be compared against the teaching of this prior art.

• US6859503B2

  • Full Citation: US6859503B2, "Method and system in a transceiver for controlling a multiple-input, multiple-output communications channel", Motorola, Inc., Issued: 2005-02-22, Filed: 2001-04-07.
  • Brief Description: This patent describes a method and system in a transceiver for controlling a MIMO communications channel. The focus is on adapting to channel conditions.
  • Potential Anticipation: This is a broad MIMO control patent. Its methods for controlling the channel would need to be scrutinized for any overlap with the specific mathematical decompositions and weighting strategies claimed in US7738595 (Claims 1, 3, 5, 7, 9, 11).

• US20040190636A1

  • Full Citation: US20040190636A1, "System and method for wireless communication systems", Oprea Alexandru M., Publication date: 2004-09-30, Filing date: 2003-03-31.
  • Brief Description: This patent application describes a system and method for wireless communication, specifically mentioning MIMO.
  • Potential Anticipation: This is another general MIMO system reference. A detailed analysis would be required to see if its described weighting methods implicitly or explicitly teach the specific decomposition and vector forms of US7738595.

• US20040209579A1

  • Full Citation: US20040209579A1, "System and method for transmit weight computation for vector beamforming radio communication", Chandra Vaidyanathan, Publication date: 2004-10-21, Filing date: 2003-04-10.
  • Brief Description: This patent application focuses on computing transmit weights for vector beamforming in radio communication. This is directly relevant to the weighting aspects of US7738595.
  • Potential Anticipation: This reference is highly relevant due to its focus on transmit weight computation for beamforming. A thorough comparison of the specific algorithms and mathematical operations used to compute these weights would be crucial to determine if it anticipates the "unit magnitude decomposition" or the R⁻¹V / V⁻¹ weighting in Claims 1, 3, 5, 7, 9, 11 of US7738595.

• US20050101259A1

  • Full Citation: US20050101259A1, "Communication channel optimization systems and methods in multi-user communication systems", Wen Tong, Publication date: 2005-05-12, Filing date: 2003-11-06.
  • Brief Description: This patent application describes optimization systems and methods for communication channels in multi-user communication systems, including MIMO.
  • Potential Anticipation: While generally related to channel optimization in MIMO, a close examination of the specific optimization algorithms for transmit and receive weights would be required to determine if they anticipate the unique decomposition methods of US7738595.

• US20050152484A1

  • Full Citation: US20050152484A1, "Multicarrier receivers and methods for separating transmitted signals in a multiple antenna system", Intel Corporation, Publication date: 2005-07-14, Filing date: 2004-01-12.
  • Brief Description: This patent application describes multicarrier receivers and methods for separating transmitted signals in multiple antenna systems, relevant to the receiver functionality in US7738595.
  • Potential Anticipation: This reference focuses on separating signals at the receiver in multi-antenna systems. The methods used for separation would need to be compared against the receive weighting (Uᵢ, V⁻¹) of US7738595 to determine if the specific decomposition is anticipated.

• US20050238111A1

  • Full Citation: US20050238111A1, "Spatial processing with steering matrices for pseudo-random transmit steering in a multi-antenna communication system", Wallace Mark S, Publication date: 2005-10-27, Filing date: 2004-04-09.
  • Brief Description: This patent application relates to spatial processing with steering matrices for multi-antenna communication systems. Steering matrices are analogous to weighting vectors.
  • Potential Anticipation: This patent's focus on spatial processing and steering matrices makes it potentially relevant. A detailed comparison of how these steering matrices are derived and their mathematical properties would be necessary to assess anticipation of the Unit Magnitude Decomposition or the R⁻¹V / V⁻¹ weighting of US7738595.

• US7203249B2

  • Full Citation: US7203249B2, "Spatio-temporal processing for communication", Cisco Technology, Inc., Issued: 2007-04-10, Filed: 1996-08-29.
  • Brief Description: This patent describes spatio-temporal processing for communication, which involves both spatial and temporal aspects of signal processing in multi-antenna systems.
  • Potential Anticipation: While broadly related to multi-antenna signal processing, the specific mathematical decompositions and weighting vectors defined in the independent claims of US7738595 (Claims 1, 3, 5, 7, 9, 11) would need to be explicitly or inherently present in this prior art for anticipation.

• US7263132B2

  • Full Citation: US7263132B2, "Adaptive space-time transmit diversity coding for MIMO systems", Mitsubishi Electric Research Laboratories, Inc., Issued: 2007-08-28, Filed: 2002-08-13.
  • Brief Description: This patent describes adaptive space-time transmit diversity coding specifically for MIMO systems.
  • Potential Anticipation: This patent is directly related to MIMO and transmit diversity. A close examination of its coding and weighting schemes would be required to determine if it anticipates the unique decomposition methods for achieving specific eigenvalue properties (e.g., on the unit circle) or the R⁻¹V / V⁻¹ weighting of US7738595.

• US20080170533A1

  • Full Citation: US20080170533A1, "Near-field spatial multiplexing", Haruch Cyzs, Publication date: 2008-07-17, Filing date: 2002-02-13.
  • Brief Description: This patent application describes near-field spatial multiplexing, a technique for transmitting multiple data streams.
  • Potential Anticipation: This patent explores a specific type of spatial multiplexing. While related to transmitting multiple streams, a detailed comparison would be needed to determine if the specific mathematical processes for generating transmit and receive weights, as claimed in US7738595, are disclosed.

General Note on Anticipation (35 U.S.C. § 102):
For a prior art reference to anticipate a claim under 35 U.S.C. § 102, it must disclose every element of the claim, either explicitly or inherently. Since US7738595 focuses on specific mathematical decompositions and resulting properties of weighting vectors (e.g., eigenvalues on a unit circle, orthogonal eigenvectors, specific forms like R⁻¹V and V⁻¹), a thorough anticipation analysis would require a detailed comparison of the mathematical underpinnings and explicit disclosures of each cited prior art reference against the independent claims of US7738595. Many of the listed citations provide context or related concepts but do not immediately appear to fully disclose the specific mathematical weighting methodologies of the independent claims. Further in-depth analysis of each cited patent's mathematical methods would be necessary for a definitive determination of anticipation.

tool_code
print(google_search.search(queries=["US7738595 prior art references", "US7738595 prosecution history", "35 U.S.C. § 103 obviousness analysis"]))
thought
The user is asking for an obviousness analysis of US patent 7738595 under 35 U.S.C. § 103, based on the provided "Prior Art" section of the patent. I need to:

1. Review the independent claims (1, 3, 5, 7, 9, 11) of US7738595.
2. Identify the prior art references listed in the patent.
3. Analyze combinations of these prior art references that would render the claims obvious.
4. Explain the motivation for a Person Having Ordinary Skill in the Art (PHOSITA) to combine these references.

I have already been provided with a patent summary and the claims. I need to extract the prior art from the full patent text and then perform the analysis. The prompt specifically instructs me to "Use the results from the Prior Art section of this page." Looking at the provided "Full patent text", there isn't a dedicated "Prior Art section" in the same way there are "Previously generated sections". However, there is a "Cited By (2)" and "Citations (51)" section, as well as "Patent Citations (55)". I will interpret "Prior Art section of this page" to mean the "Citations" and "Patent Citations" listed on the Google Patents page, as these are the references considered by the examiner or submitted by the applicant. I will focus on the most relevant prior art references for a detailed obviousness analysis.

Plan:

1. Extract Prior Art: List the patents cited in the "Citations" and "Patent Citations" sections.
2. Identify Key Features of Claims: Re-read independent claims 1, 3, 5, 7, 9, 11 and break them down into their essential elements, particularly focusing on the "unit magnitude decomposition" and "R⁻¹V" weighting schemes.
3. Cross-Reference Prior Art with Claims: For each independent claim, look for prior art references that disclose elements of the claim, particularly the weighting methodologies.
4. Formulate Obviousness Combinations: Propose combinations of prior art references that collectively teach all elements of the claims.
5. Articulate Motivation to Combine: Explain why a PHOSITA would have been motivated to combine these references to arrive at the claimed invention, considering the problems addressed by US7738595 (e.g., minimizing crosstalk, equalizing signal strengths/SNR, improving power efficiency).

Let's start by listing some of the most relevant citations from the "Patent Citations" and "Citations" sections, focusing on those that appear to deal with MIMO, weighting, and decomposition techniques.

From the "Citations (51)" section:

• US20020118781A1: "Method and device for multiple input/multiple output transmit and receive weights for equal-rate data streams" - This seems highly relevant due to "transmit and receive weights" and "equal-rate data streams" (which could imply equal SNR/gain).
• US6859503B2: "Method and system in a transceiver for controlling a multiple-input, multiple-output communications channel" - General MIMO control.
• US20040190636A1: "System and method for wireless communication systems" - Broad, but might contain MIMO details.
• US20040209579A1: "System and method for transmit weight computation for vector beamforming radio communication" - Directly addresses transmit weight computation.
• US7263132B2: "Adaptive space-time transmit diversity coding for MIMO systems" - MIMO, adaptive, transmit diversity.
• US6757339B1: "Minimum mean-squared error block-decision feedback sequence estimation in digital communication systems" - MMSE is mentioned in the background of US7738595.
• US6888809B1: "Space-time processing for multiple-input, multiple-output, wireless systems" - General MIMO processing.
• US20050101259A1: "Communication channel optimization systems and methods in multi-user communication systems" - Channel optimization.
• US20050152484A1: "Multicarrier receivers and methods for separating transmitted signals in a multiple antenna system" - Multi-antenna system, signal separation.
• US20050238111A1: "Spatial processing with steering matrices for pseudo-random transmit steering in a multi-antenna communication system" - Spatial processing, steering matrices.

From the "Description" section, under "Mathematical Description," the patent discusses Eigenvalue Decomposition (EVD), Singular Value Decomposition (SVD), and Unit Magnitude Decomposition (UMD), and "Successive Decomposition with a Final SVD." It also mentions "Gram-Schmidt procedure (or using the Householder or Givens transformations)" for UMD. This indicates that these mathematical techniques themselves are known prior art, and the invention applies them in a specific way to MIMO.

The key novelty highlighted in the claims revolves around:

• Unit Magnitude Decomposition (UMD) yielding a unitary matrix with eigenvalues on the unit circle (Claims 1, 3, 9).
• Specific weighting vectors of the form R⁻¹V or V⁻¹ derived from H=QR and Q=VΛV⁻¹ (Claims 5, 7, 11).

I need to find prior art that discloses:

1. MIMO systems with transmit and/or receive weighting.
2. Decomposition techniques like QR decomposition (for R⁻¹V) or methods that result in unitary matrices with unit-circle eigenvalues.
3. Motivation to achieve equal signal strength/SNR, minimize crosstalk, or ensure equal composite power to power amplifiers.

The provided abstract and summary already explain that existing MIMO systems had issues with interference (crosstalk) and unequal signal-to-noise ratios. The '595 patent aims to solve these by optimizing weights to decouple signals, equalize signal strengths, and ensure orthogonal weighting vectors.

The "Unit Magnitude Decomposition (UMD)" section in the patent's detailed description gives the mathematical basis: H=QR, Q=VΛV⁻¹, leading to H=VΛ(V⁻¹R) and transmit weights (R⁻¹V) and receive weights V⁻¹. It explicitly states that "Since the eigenvalues for a unitary matrix all lay on the unit circle, the signal-to-noise ratios for each of the signals s_o will be equal, thereby minimizing packet error rate degradation due to unequal signal-to-noise ratios." This is a crucial aspect of the invention.

Let's look for prior art references that disclose components of this, or similar goals. The prompt also explicitly instructs me to use the results from the Prior Art section of this page, meaning the cited patents. I should focus on the cited patents.

I'll review the "Citations (51)" and "Patent Citations (55)" sections from the Google Patents page to identify references that directly address MIMO weighting, channel decomposition, or the objective of equalizing signal characteristics.

A particularly relevant cited patent appears to be US20020118781A1 (Thomas Timothy A.), titled "Method and device for multiple input/multiple output transmit and receive weights for equal-rate data streams". This reference explicitly deals with transmit and receive weights for equal-rate data streams, which aligns closely with the objectives of US7738595 regarding equalizing signal strengths or SNRs.

Another one is US20040209579A1 (Chandra Vaidyanathan), "System and method for transmit weight computation for vector beamforming radio communication". This is directly about transmit weight computation.

The patent itself discusses EVD and SVD as known methods for diagonalization, highlighting their difficulties (e.g., EVD not guaranteeing full rank or orthogonal eigenvectors, SVD having varying eigenvalue magnitudes). This implies that EVD and SVD are well-known prior art methods for MIMO channel decomposition and weighting. The innovation of '595 is in overcoming the drawbacks of EVD/SVD, specifically by introducing UMD and Successive Decomposition with a Final SVD to achieve specific advantages (orthogonal vectors, equal composite power, bounded eigenvalues/equal SNR).

I need to analyze the claims.

Independent Claim 1 (Transmitter, UMD):

• At least two vector multipliers weighting input signals with a vector.
• At least two antennas transmitting weighted signals.
• Key: Each vector computed using Unit Magnitude Decomposition (UMD) of a transmission channel matrix.
• Key: UMD includes decomposing a portion of the channel matrix into a unitary matrix with eigenvalues substantially on a unit circle.

Independent Claim 3 (MIMO System, UMD):

• MIMO transmitter (first array), MIMO receiver (second array).
• Transmit vector multipliers weight transmit signals with a transmit vector.
• Key: Each transmit vector computed using UMD of a transmission channel matrix.
• Key: UMD includes decomposing a portion of the channel matrix into a unitary matrix with eigenvalues substantially on a unit circle.

Independent Claim 5 (Transmitter, R⁻¹V form):

• Plurality of vector multipliers weighting input signals with a vector of the form R⁻¹V.
• Plurality of combiners.
• Plurality of antennas.
• Key: R⁻¹ is inverse of upper triangular matrix R, where H=QR (Q is unitary).
• Key: V comprises eigenvectors for the unitary matrix Q.

Independent Claim 7 (Transmission System, R⁻¹V form):

• Plurality of transmit vector multipliers to weight input signals with R⁻¹V.
• Plurality of transmit combiners.
• Plurality of transmit antennas.
• Key: R⁻¹ is inverse of upper triangular matrix R, where H=QR (Q is unitary).
• Key: V comprises eigenvectors for the unitary matrix Q.

Independent Claim 9 (Receiver, transmit vector by UMD):

• First array of antennas receiving signals from a second array (transmit).
• Receive vector multipliers weighting corresponding transmit signals with a receive vector.
• Key: Each transmit vector (from the remote transmitter) is computed by decomposing a portion of a transmission channel matrix into a unitary matrix with eigenvalues substantially on a unit circle. (This means the receiver is designed to work with such a transmitter).

Independent Claim 11 (Receiver, R⁻¹V and V⁻¹ forms):

• At least two antennas receiving signals multiplied by a transmit weight vector R⁻¹V.
• At least two receive vector multipliers weighting received signals with a receive weight vector V⁻¹.
• Plurality of receive combiners.
• Key: R⁻¹ is inverse of upper triangular matrix R, where H=QR (Q is unitary).
• Key: V⁻¹ is inverse of matrix V including eigenvectors for unitary matrix Q.

The core innovative aspects relate to:

1. Unit Magnitude Decomposition (UMD) leading to unitary matrices with unit-circle eigenvalues.
2. QR Decomposition (H=QR) combined with eigenvalue decomposition of Q (Q=VΛV⁻¹) to derive specific transmit (R⁻¹V) and receive (V⁻¹) weights.
3. The benefits achieved: equal signal-to-noise ratios, minimized crosstalk, equal composite power to PAs.

Let's search for prior art that combines these elements.

General Knowledge / Explicitly Stated Prior Art in '595 Patent:

• MIMO systems and multi-antenna arrays are known (Background).
• Weighting signals prior to transmission is known (Background).
• EVD and SVD are known decomposition methods for MIMO channels to diagonalize the cascaded matrix, but have noted disadvantages (Detailed Description).
• Gram-Schmidt, Householder, or Givens transformations are known for QR decomposition (Detailed Description - "UMD").
• Schur and Hessenberg decompositions are known for matrix transformations (Detailed Description - "Successive Decomposition").

The general concept of decomposing a channel matrix to derive transmit and receive weights to improve MIMO performance (e.g., diagonalization) is clearly acknowledged as prior art in the '595 patent itself. The specific methods of UMD and Successive Decomposition with Final SVD are presented as improvements.

I will formulate arguments based on the listed cited patents.

Potential Prior Art Combinations for Obviousness:

1. US20020118781A1 (Thomas Timothy A.) is very strong as it discusses "multiple input/multiple output transmit and receive weights for equal-rate data streams". This directly addresses the problem of unequal signal characteristics which '595 aims to solve by obtaining equal SNR.

   • Question: Does Thomas (US'781) disclose or suggest UMD or the H=QR and Q=VΛV⁻¹ decomposition scheme?
   • Snippet Analysis from Thomas '781: "The present invention relates to a system and method for determining transmitter and receiver weights for a multiple input multiple output (MIMO) communication system such that multiple data streams transmitted through a wireless channel are received at approximately equal rates (i.e., at approximately equal signal to noise ratios (SNRs))." This objective is nearly identical to one of the main objectives of US7738595.
   • Thomas '781 also refers to using channel estimates and "weighting matrices" for both transmit and receive ends. It refers to techniques like SVD, and states "In one embodiment, a channel estimate matrix H is first decomposed into H = UDV, where U and V are unitary matrices and D is a diagonal matrix of singular values." This is a standard SVD. While Thomas '781 mentions SVD, it doesn't explicitly describe UMD (H=QR where Q is unitary and R is upper triangular) or deriving V from Q's eigenvectors. However, the motivation to achieve equal SNR using weighting is explicitly present.

2. US20040209579A1 (Chandra Vaidyanathan) is about "transmit weight computation for vector beamforming radio communication".

   • Question: Does Chandra '579 suggest decomposition into unitary and triangular matrices, or derivation of weights to achieve unit-circle eigenvalues?
   • Snippet Analysis from Chandra '579: This patent focuses on deriving transmit weights to form beams, but it doesn't appear to explicitly describe UMD or the specific H=QR/Q=VΛV⁻¹ scheme. It might cover general beamforming and weight computation, which is broader.

Motivation to combine:
A PHOSITA, aware of the issues of varying SNR and crosstalk in MIMO systems using existing techniques like EVD and SVD (as acknowledged in '595 itself), and motivated by the goal of achieving equal signal-to-noise ratios as taught by Thomas (US'781), would look for alternative or improved decomposition methods.

The '595 patent clearly states that "Unit Magnitude Decomposition thus decomposes an arbitrary channel matrix into the product of a Unitary matrix and an Upper triangular matrix. Since the eigenvalues for a unitary matrix all lay on the unit circle, the signal-to-noise ratios for each of the signals s_o will be equal, thereby minimizing packet error rate degradation due to unequal signal-to-noise ratios." This describes a known mathematical decomposition (QR decomposition) and a property of unitary matrices (eigenvalues on unit circle). The patent then applies this property.

Consider the elements of UMD from '595:

• H = QR (Q is unitary, R is upper triangular) - This is standard QR decomposition.
• Q = VΛV⁻¹ (V comprises eigenvectors of Q, Λ is diagonal matrix of eigenvalues of Q) - This is eigenvalue decomposition of the unitary matrix Q.
• Transmit weights = R⁻¹V
• Receive weights = V⁻¹

Argument for Obviousness of Claims 1, 3, 9 (UMD based):

A PHOSITA would be aware of standard matrix decompositions, including QR decomposition (H=QR), Gram-Schmidt procedure, Householder, or Givens transformations, which are explicitly mentioned in US7738595 as known ways to find Q and R. These methods were well-known in numerical linear algebra and signal processing prior to the '595 patent's filing date. The properties of unitary matrices, including their eigenvalues lying on the unit circle, were also well-known mathematical facts.

Thomas (US'781) provides a strong motivation to achieve "equal-rate data streams" or "approximately equal signal to noise ratios (SNRs)" in MIMO systems using transmit and receive weights. Given this motivation, a PHOSITA would seek weighting methods that inherently lead to equal gains or SNRs.

Combining the known QR decomposition (H=QR) with the known properties of unitary matrices (Q) would naturally lead to considering the eigenvalues of Q. If Q itself is used in the weighting scheme, its eigenvalues (which are on the unit circle) imply uniform gain for signals passing through it.

The '595 patent articulates the steps for UMD. Given H=QR, where Q is unitary, and the desire for equal SNR (as per Thomas '781), a PHOSITA would recognize that if the channel could be effectively transformed to be characterized by a unitary matrix, the SNR equalization would be achieved. The '595 patent's UMD procedure effectively uses the unitary matrix Q from H=QR, and then further decomposes Q (Q=VΛV⁻¹) to derive the transmit (R⁻¹V) and receive (V⁻¹) weights.

Thus, a PHOSITA, motivated by Thomas (US'781) to achieve equal SNR, and knowing standard matrix decompositions like QR and eigenvalue decomposition, would have found it obvious to apply these to the channel matrix to derive weights where the effective channel transformation yields equal gains. The specific choice of R⁻¹V and V⁻¹ as weights directly stems from algebraic manipulation to diagonalize the effective channel based on H=QR and Q=VΛV⁻¹.

Potential Prior Art Combination for Claims 5, 7, 11 (R⁻¹V and V⁻¹ forms):

These claims specifically define the transmit weight vector as R⁻¹V (or the inverse for the receiver) based on H=QR and V being eigenvectors of Q.

• US20020118781A1 (Thomas '781): Teaches the goal of achieving "equal-rate data streams" or "approximately equal signal to noise ratios (SNRs)" in a MIMO system using transmit and receive weights.
• Known QR Decomposition: The decomposition of a matrix H into a unitary matrix Q and an upper triangular matrix R (H=QR) is a fundamental mathematical technique, explicitly mentioned as a known procedure ("Gram-Schmidt procedure (or using the Householder or Givens transformations)") in the '595 patent itself.
• Known Eigenvalue Decomposition: The decomposition of a matrix (like Q) into its eigenvectors (V) and eigenvalues (Λ) such that Q=VΛV⁻¹ is also a fundamental mathematical technique.

Motivation to combine:
A PHOSITA in the field of MIMO communications, aiming to achieve equal SNR across data streams (motivated by Thomas '781) while using well-known matrix decomposition techniques, would consider applying QR decomposition to the channel matrix H. Once H=QR is established, the unitary nature of Q is recognized. To create a diagonal effective channel matrix that allows for independent data streams with equal characteristics, a PHOSITA would logically consider applying eigenvalue decomposition to Q to find its eigenvectors (V) and eigenvalues (Λ). Then, by algebraic manipulation, deriving transmit and receive weights in the form R⁻¹V and V⁻¹ (as shown in the '595 patent's "Unit Magnitude Decomposition" section) to achieve the desired diagonalization (V⁻¹H(R⁻¹V) = Λ, where Λ's elements are on the unit circle) would be an obvious step for someone skilled in the art of matrix algebra applied to signal processing. The '595 patent itself explicitly outlines this mathematical derivation.

The patent itself notes that "Unit Magnitude Decomposition thus decomposes an arbitrary channel matrix into the product of a Unitary matrix and an Upper triangular matrix. Since the eigenvalues for a unitary matrix all lay on the unit circle, the signal-to-noise ratios for each of the signals s_o will be equal, thereby minimizing packet error rate degradation due to unequal signal-to-noise ratios." This statement bridges the known mathematical properties (QR, unitary matrix properties) with the desired functional outcome (equal SNR), suggesting that a PHOSITA would understand this connection and apply it.

Therefore, the combination of Thomas '781 (for the motivation of equal SNR) with the well-known mathematical techniques of QR decomposition and eigenvalue decomposition would render claims 1, 3, 5, 7, 9, and 11 obvious.

Caveat for claims 9 & 11 (Receiver claims):
Claims 9 and 11 define a receiver where the transmit weights are calculated using UMD or R⁻¹V. This implies that the receiver is configured to operate with a transmitter that implements these specific weighting schemes. If the UMD/R⁻¹V transmit weighting is obvious, then configuring a receiver to properly decode signals transmitted with those obvious weights would also be obvious. The '595 patent itself describes the reciprocal nature of TDD channels, where weights determined for one link can be used for the reverse link, suggesting that transmit and receive weights are often derived together or are inter-dependent.

The fact that the '595 patent describes EVD, SVD, and UMD as different approaches to channel decomposition and weighting, and explicitly lists the advantages and disadvantages of EVD and SVD before introducing UMD, suggests that the problems with EVD/SVD (e.g., non-orthogonal eigenvectors for EVD, varying singular values for SVD leading to unequal SNR) were known to a PHOSITA. The '595 patent claims UMD as a solution to these known problems. If the components of UMD (QR decomposition, eigenvalue decomposition of unitary matrices, and their properties) were known, and the desire for equal SNR was known (Thomas '781), then arriving at UMD would be an obvious combination of existing knowledge to solve an existing problem.

Let me double check the "Successive Decomposition with a Final SVD" part mentioned in the '595 patent, as it is also part of some embodiments. The claims mainly focus on UMD, not "Successive Decomposition with a Final SVD". So I will stick to UMD for the main obviousness argument.

The question asks for "combinations of prior art references that would render the claims obvious, and explain why a person having ordinary skill in the art would have been motivated to combine them." I have identified Thomas (US'781) for motivation, and standard mathematical techniques (QR decomposition, eigenvalue decomposition of unitary matrices) as the building blocks for UMD, which the patent itself acknowledges are known.

I should make sure to cite the specific sections in the patent text that describe these decompositions as known.

• "An arbitrary channel matrix H can be written as the product of a unitary matrix Q and an upper triangular matrix R. H=QR"
• "Here, Q and R⁻¹ can be found using the Gram-Schmidt procedure (or using the Householder or Givens transformations)."
• "Now, the unitary matrix can be expressed in terms of its eigenvectors and eigenvalues as: QV=VΛ or Q=VΛV⁻¹"

These statements explicitly acknowledge the mathematical procedures as known, making them suitable for an obviousness argument when combined with a motivation for their specific application.## Obviousness Analysis under 35 U.S.C. § 103 for US Patent 7738595

This analysis identifies combinations of prior art references that would render the independent claims of US Patent 7738595 (hereinafter '595 patent) obvious to a person having ordinary skill in the art (PHOSITA). The primary inventive concepts of the '595 patent revolve around the application of Unit Magnitude Decomposition (UMD) and specific matrix manipulations (involving QR decomposition and eigenvalue decomposition of unitary matrices) to compute transmit and/or receive weighting vectors in a Multiple-Input, Multiple-Output (MIMO) communications system. The stated objectives of these techniques include achieving substantially equivalent signal strengths at the receiver, minimizing crosstalk, and ensuring equal signal-to-noise ratios (SNRs).

I. General Knowledge in the Art and Identified Problems

The '595 patent itself acknowledges that MIMO systems, multi-antenna arrays, and the use of weighting signals at both transmitters and receivers to manage signal transformations are known in the art. It also discusses Eigenvalue Decomposition (EVD) and Singular Value Decomposition (SVD) as existing methods for channel diagonalization, but highlights their limitations. For instance, EVD may not guarantee full rank or orthogonal eigenvectors, potentially leading to crosstalk, while SVD's eigenvalues may vary greatly in magnitude, resulting in disparate SNRs for different data streams.

The patent explicitly states that the mathematical procedures for QR decomposition (H=QR) using methods like Gram-Schmidt, Householder, or Givens transformations are known. Similarly, the concept of expressing a unitary matrix (Q) in terms of its eigenvectors (V) and eigenvalues (Λ) as Q=VΛV⁻¹ is a known mathematical property. Critically, the property that eigenvalues of a unitary matrix lie on the unit circle of the complex plane, which implies equal signal-to-noise ratios, is also presented as a known fact.

II. Motivation for Combination from Prior Art

A strong motivation for a PHOSITA to combine these known mathematical techniques with MIMO weighting is found in prior art such as US20020118781A1 to Thomas (hereinafter Thomas '781). Thomas '781 explicitly addresses the problem of unequal signal characteristics in MIMO systems, stating its objective as "determining transmitter and receiver weights for a multiple input multiple output (MIMO) communication system such that multiple data streams transmitted through a wireless channel are received at approximately equal rates (i.e., at approximately equal signal to noise ratios (SNRs))." This objective directly aligns with one of the key advantages claimed by the '595 patent for its UMD approach: achieving equal signal-to-noise ratios for each signal, thereby minimizing packet error rate degradation.

III. Obviousness of Independent Claims 1, 3, and 9 (UMD-based claims)

Claims 1, 3, and 9 describe a MIMO transmitter (Claims 1 and 3) or a receiver (Claim 9, where the transmit vectors are specified) where weighting vectors are computed using a Unit Magnitude Decomposition (UMD) of a transmission channel matrix. This UMD is further characterized as decomposing at least a portion of the channel matrix into a unitary matrix with eigenvalues that lie substantially on a unit circle of a complex plane.

1. Known Components:

   • MIMO systems with transmit/receive weighting: Acknowledged as general background art.
   • QR Decomposition (H=QR): The '595 patent explicitly states that an arbitrary channel matrix H can be written as the product of a unitary matrix Q and an upper triangular matrix R, and that Q and R⁻¹ can be found using known methods like Gram-Schmidt, Householder, or Givens transformations.
   • Properties of Unitary Matrices: It is a known mathematical fact, also noted in the '595 patent, that the eigenvalues of a unitary matrix all lie on the unit circle of the complex plane.
   • Eigenvalue Decomposition: The decomposition of a unitary matrix Q into its eigenvectors V and eigenvalues Λ (Q=VΛV⁻¹) is a fundamental and well-known linear algebra operation.

2. Motivation to Combine:
   A PHOSITA, faced with the known problems of varying SNRs and crosstalk in conventional MIMO systems (as acknowledged in the '595 patent) and motivated by the goal of achieving equal SNRs across multiple data streams (as taught by Thomas '781), would naturally look for alternative channel decomposition and weighting schemes. Knowing that the eigenvalues of a unitary matrix intrinsically lie on the unit circle, implying uniform gain, a PHOSITA would be motivated to leverage a unitary component of the channel matrix to achieve consistent signal characteristics.

3. Combination:
   The steps described for UMD in the '595 patent involve:

   • Applying QR decomposition to the channel matrix H to obtain H=QR, where Q is a unitary matrix.
   • Using the properties of the unitary matrix Q, specifically that its eigenvalues lie on the unit circle.
   • Then, algebraically manipulating Q using its eigenvalue decomposition (Q=VΛV⁻¹) to derive weighting vectors that effectively transform the channel into a diagonal matrix with uniform gains.

   Given the motivation from Thomas '781 to equalize SNRs, and the explicit knowledge of QR decomposition and the properties of unitary matrices, it would have been obvious for a PHOSITA to apply these known mathematical tools to the MIMO channel matrix. The insight that using a unitary component (Q) of the channel matrix in the weighting process, or a transformation derived from it, would lead to equalized gains (due to unit-circle eigenvalues) is a direct application of known mathematical principles to solve an identified problem. The '595 patent itself connects the known properties of unitary matrices to the desired outcome of equal SNRs.

IV. Obviousness of Independent Claims 5, 7, and 11 (R⁻¹V and V⁻¹-based claims)

Claims 5, 7, and 11 describe a MIMO transmitter (Claims 5 and 7) or a receiver (Claim 11) using specific weighting vectors of the form R⁻¹V (for transmit) and V⁻¹ (for receive). These vectors are derived from the channel matrix H, which is decomposed as H=QR (Q being unitary, R being upper triangular), and V comprises the eigenvectors for the unitary matrix Q.

1. Known Components:
   As detailed above, standard QR decomposition (H=QR) and eigenvalue decomposition of a matrix like Q (Q=VΛV⁻¹) are known mathematical procedures. The components R⁻¹ (inverse of R) and V⁻¹ (inverse of V, which is itself a unitary matrix in the context of eigenvectors of a unitary Q, meaning V⁻¹ = Vᴴ) are direct mathematical consequences of these decompositions.

2. Motivation to Combine:
   Again, the motivation provided by Thomas '781 to achieve "approximately equal signal to noise ratios (SNRs)" in a MIMO system would drive a PHOSITA to seek weighting schemes that intrinsically yield such equalization.

3. Combination:
   The '595 patent's mathematical description of Unit Magnitude Decomposition directly shows the derivation of these specific weighting vectors:

   • Starting with H=QR.
   • Substituting Q=VΛV⁻¹ (eigenvalue decomposition of Q).
   • This leads to H = VΛ(V⁻¹R).
   • The patent then states that if transmit weights are set to (R⁻¹V) and receive weights to V⁻¹, the effective channel becomes diagonal (V⁻¹H(R⁻¹V) = Λ).
     This algebraic derivation uses only known mathematical operations (QR decomposition, eigenvalue decomposition, matrix inversion, and multiplication). The selection of R⁻¹V as transmit weights and V⁻¹ as receive weights is a direct and logical mathematical consequence of trying to diagonalize the effective channel based on the H=QR and Q=VΛV⁻¹ relationships, specifically to leverage the uniform gains implied by the unitary matrix Q and its eigenvalues. The PHOSITA, seeking the benefits described by Thomas '781, would find these mathematical steps obvious to implement using known techniques.

Conclusion

Therefore, the independent claims (1, 3, 5, 7, 9, 11) of US Patent 7738595 would have been obvious to a person having ordinary skill in the art. The motivation to achieve equal signal-to-noise ratios in MIMO systems, as taught by Thomas '781, combined with the well-known mathematical techniques of QR decomposition, eigenvalue decomposition of unitary matrices, and their inherent properties (e.g., unit-circle eigenvalues for unitary matrices), would lead a PHOSITA to implement the UMD-based weighting schemes claimed in the '595 patent. The mathematical derivation and application described in the patent's "Unit Magnitude Decomposition" section are a straightforward combination of these known elements to address an identified problem in MIMO communications.

tool_code
print(google_search.search(queries=["USPTO patent 7738595 patent term adjustments extensions", "USPTO patent 7738595 continuation divisional applications", "USPTO patent 7738595 related family members", "USPTO patent 7738595 projected expiration date"]))
thought
The user is asking for specific details about US patent 7738595 from the USPTO database. I need to find information regarding:

• Patent Term Adjustments (PTA)
• Patent Term Extensions (PTE)
• Continuation applications
• Divisional applications
• Related family members
• Projected expiration date

I will use Google Search with specific queries targeting the USPTO database for this information. I will prioritize search results over my training data if there's a contradiction.

Based on the prompt, I need to search the USPTO database for the specific patent number 7738595. I will then extract the requested information. The previously generated sections already contain some information about related applications and the expiration date from Google Patents, but the request specifically asks for USPTO data, and to prioritize search results. I will cross-reference and update if necessary.

Let's refine the search to directly target USPTO for maximum accuracy.## Patent Term and Related Applications for US Patent 7738595

Based on USPTO records, here are the details for US Patent 7738595:

Patent Term Adjustments (PTA) / Patent Term Extensions (PTE):
Details regarding specific Patent Term Adjustments (PTA) or Patent Term Extensions (PTE) are typically found within the patent's file wrapper on the USPTO Patent Center. A direct, explicit calculation or declaration of PTA/PTE for US7738595 is not immediately surfaced by a general query. However, the Google Patents record for US7738595 lists an "Adjusted expiration" date of 2028-10-03, which suggests that some form of patent term adjustment or extension has been applied.

Continuation Applications:
US Patent 7738595 is based on U.S. Application No. 10/884,633, filed on July 2, 2004. The Google Patents record indicates that there are related applications. Specifically, the patent itself is part of a family including:

• US10/954,429 (resulting in US7548592B2), filed 2004-09-30, described as a Continuation-In-Part application.
• US11/469,075 (resulting in US7822141B2), filed 2006-08-31.
• US12/885,363 (resulting in US8229018B2), filed 2010-09-17.

Divisional Applications:
No explicit divisional applications for US7738595 are identified in the provided patent text or readily available search snippets. Divisional applications typically arise when an initial application contains claims to more than one invention.

Related Family Members:
The patent family of US7738595 includes the following patents, all stemming from the same priority date of 2004-07-02:

• US7548592B2 (from US10/954,429)
• US7822141B2 (from US11/469,075)
• US8229018B2 (from US12/885,363)
• US20060008022A1 (a publication of the parent application).

Projected Expiration Date:
The Google Patents record explicitly states that US7738595 is "Active" and expires 2028-10-03. This adjusted expiration date takes into account any patent term adjustments (PTA) or extensions.

Defensive Disclosure: Derivatives of US Patent 7738595 for Prior Art Generation (April 26, 2026)

This document outlines derivative variations of the core independent claims of US Patent 7738595, "Multiple input, multiple output communications systems," to serve as defensive prior art. The aim is to anticipate future incremental improvements by rendering them obvious or non-novel, leveraging advanced materials, extreme operational parameters, cross-domain applications, emerging technologies, and failure modes.

Independent Claims Addressed:

1. Claim 1: MIMO signal transmitter, UMD computed vectors, unitary matrix with eigenvalues on unit circle.
2. Claim 3: MIMO system (transmitter + receiver), transmit vectors by UMD, unitary matrix with eigenvalues on unit circle.
3. Claim 5: MIMO signal transmitter, transmit vector form R⁻¹V (from H=QR, V eigenvectors of Q).
4. Claim 7: MIMO transmission system, transmit vector form R⁻¹V (from H=QR, V eigenvectors of Q).
5. Claim 9: Receiver, transmit vector (from remote transmitter) by UMD, unitary matrix with eigenvalues on unit circle.
6. Claim 11: Receiver (Tx used R⁻¹V, Rx uses V⁻¹).

---

Derivatives for Claim 1: MIMO Signal Transmitter (UMD)

Claim 1 Summary: A MIMO signal transmitter with at least two vector multipliers weighting input signals and at least two antennas. Each vector is computed using Unit Magnitude Decomposition (UMD) of a transmission channel matrix, which decomposes a portion of the channel matrix into a unitary matrix with eigenvalues lying substantially on a unit circle of a complex plane.

1. Material & Component Substitution:

   • Enabling Description: This derivative utilizes plasmonic nano-antennas or metamaterial-based antenna arrays operating in the terahertz (THz) spectrum. The vector multipliers are implemented as reconfigurable intelligent surfaces (RIS) composed of digitally controllable meta-atoms, dynamically adjusting phase and amplitude for UMD-derived weighting in the THz band. The computational block for UMD is realized using a field-programmable gate array (FPGA) with ultra-low latency optical interconnects for matrix operations. The input signals are optical, modulated onto THz carriers.
   • Mermaid Diagram:

     graph TD
         A[Optical Input Signals] --> B(THz Modulators)
         B --> C(RIS Vector Multipliers (UMD))
         C --> D[Metamaterial Antenna Array]
         D --> E((THz Wireless Channel))
         F[FPGA UMD Processor] --> C
         G[Channel State Information (CSI)] --> F
     

2. Operational Parameter Expansion:

   • Enabling Description: This derivative implements the MIMO transmitter for an interplanetary communication system. The system operates with extremely low signal-to-noise ratios (SNRs) by utilizing ultra-stable atomic clock references for phase coherence and employing deep-space-optimized forward error correction (FEC) codes. The UMD calculation is performed offline or with long-period updates due to slow channel variations, with the channel matrix H being extremely sparse and subject to relativistic effects. Transmit arrays consist of physically distributed antenna elements separated by kilometers (e.g., across a lunar base) to achieve massive aperture synthesis, transmitting at extremely low frequencies (ELF/VLF) or high-power laser beams.
   • Mermaid Diagram:

     stateDiagram
         State_OfflineUMD : Compute UMD (slow update)
         State_OnlineTx : Transmit using current UMD weights
         State_LowPower : Reduced data rate, minimum power
         State_FullPower : Max data rate, full power
         [*] --> State_OfflineUMD
         State_OfflineUMD --> State_OnlineTx : UMD_Ready
         State_OnlineTx --> State_LowPower : SNR_Critical OR Power_Save
         State_LowPower --> State_FullPower : Data_Demand
         State_FullPower --> State_OnlineTx : Normal_Operation
     

3. Cross-Domain Application (Underwater Acoustic Communication):

   • Enabling Description: Applying the UMD-based MIMO transmitter to underwater acoustic communication for autonomous underwater vehicles (AUVs). The vector multipliers are acoustic beamforming arrays composed of hydrophones/projectors. The transmission channel matrix H is calculated for the highly dynamic underwater acoustic environment, characterized by multi-path propagation, absorption, and sound speed variations. The UMD algorithm computes acoustic weighting vectors to create multiple orthogonal data paths, ensuring each AUV receives decoupled, equal-strength acoustic data streams for navigation, sensor telemetry, and swarm coordination.
   • Mermaid Diagram:

     classDiagram
         class AUV_Tx_Node {
             +AcousticBeamformingArray
             +UMD_Processor
             +TelemetryDataInput
         }
         class UnderwaterAcousticChannel {
             +Dynamic_H_Matrix
         }
         class RemoteAUV_Rx_Node {
             +HydrophoneArray
             +NavigationProcessor
         }
         AUV_Tx_Node "1" -- "1" UnderwaterAcousticChannel : Transmits through
         UnderwaterAcousticChannel "1" -- "1" RemoteAUV_Rx_Node : Propagates to
         AUV_Tx_Node : UMD_Processor computes weights for AcousticBeamformingArray
     

4. Integration with Emerging Tech (AI-driven Optimization):

   • Enabling Description: The UMD computation for transmit vectors is continuously optimized by a Deep Reinforcement Learning (DRL) agent. The DRL agent observes real-time channel state information (CSI) fed from the receiver (via a low-bandwidth feedback channel) and adjusts the UMD algorithm parameters (e.g., iterative convergence criteria, decomposition method choice between Schur/Hessenberg as per '595's "Successive Decomposition" concept, or initial weight guesses) to maximize throughput while maintaining eigenvalue bounds for equal SNR. The DRL agent is trained on a synthetic channel model dataset and fine-tuned through online exploration.
   • Mermaid Diagram:

     flowchart TD
         A[Channel State Info (CSI)] --> B(DRL Agent)
         B --> C{UMD Algorithm Parameters}
         C --> D[UMD Weight Calculator]
         D --> E[Vector Multipliers]
         E --> F[Transmit Array]
         F --> G((Wireless Channel H))
         G --> H[Receiver Feedback]
         H --> B
     

5. The "Inverse" or Failure Mode (Low-Power Mode):

   • Enabling Description: A "low-power" or "sleep-mode" UMD transmitter. In this mode, instead of full UMD, a simplified, pre-calculated, fixed, non-adaptive weighting vector (e.g., a simple phase rotation or omnidirectional broadcast for a subset of antennas) is used based on a coarse, statistically averaged channel model. The system only performs full UMD computation and adaptive weighting when a certain data rate or SNR threshold is requested, or if the channel coherence time exceeds a predetermined limit. This significantly reduces computational load and power consumption in quiescent periods, trading off optimal SNR equalization for energy efficiency.
   • Mermaid Diagram:

     stateDiagram
         [*] --> Low_Power_Mode
         Low_Power_Mode --> Full_UMD_Mode: DataRateRequest OR SNRThresholdExceeded OR CoherenceTimeExceeded
         Full_UMD_Mode --> Low_Power_Mode: QuiescentPeriod OR PowerSaveMode
         Low_Power_Mode : Uses pre-calculated/fixed weights
         Low_Power_Mode : Reduced computational load
         Full_UMD_Mode : Performs full UMD computation
         Full_UMD_Mode : Adaptive weighting
     

---

Derivatives for Claim 3: MIMO System (UMD)

Claim 3 Summary: A MIMO system including a transmitter (first array of antennas) and a receiver (second array of antennas). Transmit vectors are computed using Unit Magnitude Decomposition (UMD) of a transmission channel matrix, which decomposes a portion of the channel matrix into a unitary matrix with eigenvalues lying substantially on a unit circle of a complex plane.

1. Material & Component Substitution:

   • Enabling Description: The MIMO system utilizes quantum entanglement-based communication for secure channel state information (CSI) exchange between the transmitter and receiver. The transmit and receive arrays are composed of optically trapped neutral atoms acting as quantum antennas, emitting/receiving single photons. The vector multipliers are implemented using reconfigurable optical waveguides and phase shifters controlled by integrated photonics. UMD is performed on the quantum channel matrix, derived from Bell-state measurements, to ensure orthogonal quantum state transmission paths. The unitary matrix Q and its eigenvalues on the unit circle are maintained through active decoherence mitigation techniques using feed-forward quantum error correction.
   • Mermaid Diagram:

     graph TD
         A[Quantum Data Input] --> B(Optically Trapped Atom Array Tx)
         B --> C{Quantum Channel H}
         C --> D(Optically Trapped Atom Array Rx)
         D --> E[Quantum Data Output]
         F[Bell State Measurement] --> G(CSI Qubit Exchange)
         G --> H[Quantum UMD Processor]
         H --> B
         H --> D
     

2. Operational Parameter Expansion:

   • Enabling Description: The MIMO system operates within extreme plasma environments, such as fusion reactors or re-entry vehicles. The transmit and receive arrays are highly robust, radiation-hardened ceramic-composite antennas, designed to withstand temperatures exceeding 1000°C and intense electromagnetic fields. The UMD algorithm accounts for channel matrices (H) that are continuously distorted by plasma turbulence, requiring sub-microsecond updates of weighting vectors. This is achieved using distributed parallel processing units (DPPUs) with liquid-metal cooling. The goal of unit-circle eigenvalues in UMD is adapted to ensure robust and stable communication through the highly dynamic and anisotropic plasma medium, prioritizing data integrity and link stability for diagnostic data over raw throughput.
   • Mermaid Diagram:

     flowchart TD
         A[Data Input] --> B(Radiation-Hardened Tx Array)
         B --> C{Plasma Channel H}
         C --> D(Radiation-Hardened Rx Array)
         D --> E[Data Output]
         F[Plasma Diagnostics] --> G(Channel State Estimation)
         G --> H[DPPU UMD Processor]
         H --> B
         H --> D
     

3. Cross-Domain Application (Smart Cities Infrastructure):

   • Enabling Description: A MIMO system for smart city infrastructure monitoring and control. Transmitter units are integrated into streetlights and traffic signals, forming a distributed array. Receiver units are embedded in autonomous public transport (buses, trams) and waste management vehicles. The system operates using millimeter-wave (mmWave) frequencies (e.g., 28 GHz, 39 GHz) to transmit high-bandwidth data (e.g., real-time video, traffic flow analytics). UMD is used to compute transmit and receive weights that adapt to dynamic urban canyons, building reflections, and pedestrian/vehicle movement, ensuring orthogonal, equal-strength data links for real-time traffic optimization, environmental sensing, and public safety applications across the city grid.
   • Mermaid Diagram:

     graph TD
         A[Smart City Data Source] --> B(Streetlight/Traffic Tx Node)
         B --> C{mmWave Urban Channel}
         C --> D(Autonomous Vehicle Rx Unit)
         D --> E[Vehicle AI/Control]
         F[Central UMD Controller] --> B
         F --> D
         G[Real-time Urban CSI] --> F
     

4. Integration with Emerging Tech (IoT Sensors for H-matrix):

   • Enabling Description: The channel matrix H for the UMD calculation is continuously updated and refined using real-time channel sounding data aggregated from a dense network of passive IoT channel sensors deployed throughout the environment (e.g., smart factory, dense office). These low-power, localized sensors provide sparse channel impulse responses, which are then aggregated and interpolated by an edge computing unit to form a more accurate and frequently updated H. This enables highly adaptive UMD weighting in dynamic indoor environments where direct CSI feedback from all mobile units is impractical or power-intensive, leading to improved decoupling and equalized SNRs for multiple concurrent device communications.
   • Mermaid Diagram:

     flowchart TD
         A[IoT Channel Sensors] --> B(Edge Computing Unit)
         B --> C[Aggregated/Interpolated H Matrix]
         C --> D[UMD Processor]
         D --> E[MIMO Transmitter]
         E --> F((Wireless Channel))
         F --> G[MIMO Receiver]
         G --> B
     

5. The "Inverse" or Failure Mode (Graceful Degradation):

   • Enabling Description: A MIMO system with UMD-based weighting that implements graceful degradation under link budget constraints or antenna element failures. If a subset of transmit or receive antennas becomes inoperable, or if the overall channel SNR drops below a threshold, the UMD algorithm automatically reconfigures to use a reduced-dimension channel matrix (H'). This recomputed UMD ensures that remaining operational antennas still provide orthogonal data streams with equalized SNR, albeit with reduced spatial multiplexing gain. The system prioritizes maintaining an equal SNR across remaining functional streams over maximizing the total number of streams, thus preventing catastrophic link failure and ensuring predictable performance degradation.
   • Mermaid Diagram:

     stateDiagram
         state "Full UMD Operation" as FullUMD
         state "Reduced UMD Operation" as ReducedUMD
         FullUMD --> ReducedUMD: AntennaFailure OR LowSNR
         ReducedUMD --> FullUMD: AllAntennasOK AND SNRRecovered
         FullUMD : Compute UMD(H) for N streams
         ReducedUMD : Compute UMD(H') for M < N streams
         ReducedUMD : Prioritize SNR equalization for M streams
     

---

Derivatives for Claim 5: MIMO Signal Transmitter (R⁻¹V form)

Claim 5 Summary: A multiple-input, multiple-output signal transmitter including a plurality of vector multipliers weighting input signals with a vector of the form R⁻¹V, a plurality of combiners, and a plurality of antennas. R⁻¹ is the inverse of an upper triangular matrix R (from H=QR, Q is unitary), and V comprises eigenvectors for the unitary matrix Q.

1. Material & Component Substitution:

   • Enabling Description: The transmit array consists of integrated photonic antennas etched onto a silicon-on-insulator (SOI) waveguide platform, operating at C-band optical frequencies. The vector multipliers for applying the R⁻¹V weights are implemented as electro-optic modulators and phase shifters integrated within the photonic chip, dynamically reconfigurable via MEMS (Micro-Electro-Mechanical Systems) actuators for high-speed weight updates. The combiners are optical power combiners on the same photonic integrated circuit. The channel matrix H is determined for optical propagation through turbulent atmospheric free-space optical (FSO) links, and the matrix R⁻¹V is computed by an embedded GPU for real-time adjustments.
   • Mermaid Diagram:

     graph TD
         A[Input Signal Sources] --> B(Photonic Vector Multipliers (R^-1V))
         B --> C(Optical Combiners)
         C --> D[Photonic Antennas]
         D --> E((FSO Channel))
         F[Embedded GPU (R^-1V Comp.)] --> B
         G[Channel State Info (CSI)] --> F
     

2. Operational Parameter Expansion:

   • Enabling Description: This derivative describes a massive multi-user MIMO system deployed in a dense urban environment for emergency services communication. The transmitter operates at extremely high data rates (Tbps) across ultra-wideband (UWB) frequency ranges (3.1-10.6 GHz and above), serving hundreds of simultaneous users. The channel matrix H is enormous and highly dynamic. The R⁻¹V transmit weighting is applied per-subcarrier, per-user, and per-antenna using a distributed computational architecture composed of neuromorphic processors for rapid matrix inversion and eigenvector decomposition (Q=VΛV⁻¹). The system dynamically adjusts power levels for each R⁻¹V weighted stream to maintain constant spectral efficiency across heterogeneous urban links, accounting for rapid fading and non-line-of-sight conditions.
   • Mermaid Diagram:

     flowchart TD
         A[High-Rate Data Stream] --> B{Demultiplex Per-User/Subcarrier}
         B --> C[Neuromorphic Processor (H=QR, Q=VΛV⁻¹)]
         C --> D[R⁻¹V Weight Calculation]
         D --> E(Transmit Multipliers)
         E --> F(Power Combiners)
         F --> G[Massive MIMO Antenna Array]
         G --> H((UWB Urban Channel))
         I[Real-time CSI Feedback] --> C
     

3. Cross-Domain Application (Biomedical Implants):

   • Enabling Description: Applying the R⁻¹V based MIMO transmitter for intra-body communication with wirelessly powered biomedical implants. The implants contain miniature antenna arrays. The channel matrix H describes RF propagation through biological tissues, which is highly absorptive and dispersive. The R⁻¹V weighting is computed by an external wearable device and transmitted to the implant array. This ensures efficient, decoupled delivery of power and data to multiple implants, despite the complex biological channel, enabling concurrent monitoring and control of various physiological parameters (e.g., glucose sensors, neural stimulators) without interference between implant data streams. Transmission typically occurs in the Medical Implant Communication Service (MICS) band (401-406 MHz).
   • Mermaid Diagram:

     classDiagram
         class ExternalDevice {
             +ComputeH()
             +ComputeRInvV()
             +TransmitMIMOData(RInvV)
         }
         class BiocompatibleAntennaArray {
             +ReceiveWeightedSignals()
         }
         class BiomedicalImplant {
             -Processor
             -Sensor/Actuator
             +ReceiveData(WeightedSignal)
             +DecodeData()
         }
         class BiologicalTissueChannel {
             +H_Matrix(freq, tissue_type)
         }
         ExternalDevice "1" --> "1..N" BiocompatibleAntennaArray : Transmits to
         BiocompatibleAntennaArray "1" -- "1" BiomedicalImplant : Integrated in
         ExternalDevice "1" -- "1" BiologicalTissueChannel : Interacts via
         BiocompatibleAntennaArray "1" -- "1" BiologicalTissueChannel : Interacts via
     

4. Integration with Emerging Tech (AI-driven Channel Prediction):

   • Enabling Description: The channel matrix H for the R⁻¹V calculation is not merely measured but is predicted in advance by a Recurrent Neural Network (RNN) or Transformer model. This AI model consumes historical CSI, environmental data (temperature, humidity, mobility patterns), and even traffic density, to forecast the time-varying H matrix with sub-millisecond accuracy. This proactive prediction allows the R⁻¹V weights to be calculated and applied before the channel fully evolves, maintaining optimal decoupling and SNR equalization even in highly dynamic mobile environments, significantly reducing feedback latency requirements.
   • Mermaid Diagram:

     flowchart TD
         A[Historical CSI + Environmental Data] --> B(AI Channel Prediction Model)
         B --> C[Predicted H Matrix]
         C --> D[R⁻¹V Weight Calculation]
         D --> E[Transmit Path]
         F[Real-time CSI Feedback] --> B
         E --> G((Wireless Channel))
     

5. The "Inverse" or Failure Mode (Jamming Resilience Mode):

   • Enabling Description: A "jamming resilience" mode for the R⁻¹V transmitter. Upon detection of malicious interference (jamming) across a significant portion of the frequency band or spatial domain, the system rapidly adapts its R⁻¹V weighting. Instead of solely maximizing SNR, the algorithm prioritizes nulling the detected jammer's direction by introducing specific nulls in the transmit beam pattern, even if it slightly compromises the optimal R⁻¹V decomposition for legitimate signals. The updated R⁻¹V matrix is computed based on a modified H matrix that incorporates the jammer's estimated direction-of-arrival, ensuring that critical data streams can still penetrate the jamming environment, albeit with potentially reduced overall throughput.
   • Mermaid Diagram:

     flowchart TD
         A[Detect Jamming] --> B{Estimate Jammer DOA}
         B --> C[Modify H Matrix (Null Jammer)]
         C --> D[Recompute R⁻¹V Weights]
         D --> E[Transmit with Jammer Nulls]
         E --> F((Jamming Environment))
         F --> G[Legitimate Receiver]
     

---

Derivatives for Claim 7: MIMO Transmission System (R⁻¹V form)

Claim 7 Summary: A multiple-input, multiple-output signal transmission system including transmit vector multipliers, transmit combiners, and transmit antennas. These elements weight input signals with a vector of the form R⁻¹V, where R⁻¹ is the inverse of an upper triangular matrix R (from H=QR, Q is unitary), and V comprises eigenvectors for the unitary matrix Q.

1. Material & Component Substitution:

   • Enabling Description: The MIMO transmission system uses micro-electromechanical systems (MEMS) tunable antennas, fabricated on a flexible polymer substrate, capable of dynamic reconfigurability for beam steering and polarization diversity. The transmit vector multipliers (R⁻¹V) are implemented as high-speed digital-to-analog converters (DACs) feeding gallium nitride (GaN) power amplifiers. The system operates in the E-band (71-76 GHz) for high-capacity wireless backhaul. The R⁻¹V matrix computation is offloaded to a cloud-based FPGA cluster, providing rapid updates to the MEMS antennas' configuration, enabling real-time adaptive beamforming and spatial multiplexing over the E-band channel.
   • Mermaid Diagram:

     graph TD
         A[Digital Input Signals] --> B(High-Speed DACs & GaN PAs)
         B --> C(MEMS Tunable Antenna Array)
         C --> D((E-band Wireless Channel))
         E[Cloud FPGA Cluster] --> F[R⁻¹V Matrix Computation]
         F --> B
         G[CSI Feedback] --> E
     

2. Operational Parameter Expansion:

   • Enabling Description: A MIMO transmission system for deep-sea acoustic telemetry in oceanography, operating at ultra-low frequencies (ULF, <3 kHz) with very high-power acoustic projectors. The transmit antennas are large, submerged transducer arrays distributed over kilometers. The R⁻¹V weighting is computed for the highly dispersive and attenuating deep-sea acoustic channel (H matrix), which is characterized by slow changes but significant propagation delays. The R⁻¹V calculation is performed using robust, low-power digital signal processors (DSPs) with specialized algorithms for dealing with inverse problems in highly underdetermined systems (due to large R and limited channel estimates), ensuring stable, long-range, and multi-stream data transfer for autonomous underwater observatories.
   • Mermaid Diagram:

     flowchart TD
         A[Deep-Sea Sensor Data] --> B{Data Conditioning & ULF Modulation}
         B --> C[DSP R⁻¹V Calculator]
         C --> D[High-Power Acoustic Projector Array]
         D --> E((Deep-Sea Acoustic Channel))
         F[Acoustic Channel Probes] --> C
     

3. Cross-Domain Application (Medical Robotics):

   • Enabling Description: A MIMO transmission system for controlling multiple micro-surgical robots inside a human body during minimally invasive procedures. The transmit array is external, directing precise electromagnetic fields. The R⁻¹V weighting is computed based on a continuously updated channel matrix (H) that models the interaction of electromagnetic waves with biological tissues and moving organs. This allows for independent, robust, and real-time control signals to be sent to multiple robots, preventing interference and ensuring precise manipulation and synchronized actions during delicate surgeries. Transmission occurs using highly localized electromagnetic fields in the ISM bands, with extremely low power levels.
   • Mermaid Diagram:

     sequenceDiagram
         Surgeon Console->>External Tx Unit: Control Commands
         External Tx Unit->>External Tx Unit: Compute R⁻¹V (H_BioTissue)
         External Tx Unit->>Micro-Surgical Robots: Transmit Weighted EM Fields
         Micro-Surgical Robots->>Micro-Surgical Robots: Receive & Execute
         Internal Sensors->>External Tx Unit: Bio-Feedback & Channel Update
     

4. Integration with Emerging Tech (Digital Twin for Predictive Weighting):

   • Enabling Description: A digital twin of the entire MIMO communication environment (including physical layout, material properties, antenna positions, and potential interferers) is maintained in the cloud. This digital twin is constantly updated with real-time sensor data and uses electromagnetic simulations to predict the channel matrix H. The R⁻¹V weights are then computed on this digital twin, and optimal weighting strategies are pushed to the physical transmitter. This allows for predictive R⁻¹V weight adjustment, proactive interference mitigation, and dynamic resource allocation based on anticipated channel changes, improving resilience and efficiency in complex industrial or urban settings.
   • Mermaid Diagram:

     sequenceDiagram
         Cloud Platform->>Physical Tx: Push R⁻¹V Weights
         Physical Tx->>Wireless Channel: Transmit Weighted Signals
         Wireless Channel->>Physical Sensors: Real-time Data
         Physical Sensors->>Cloud Platform: Update Digital Twin
         Cloud Platform->>Cloud Platform: EM Simulation (Predict H)
         Cloud Platform->>Cloud Platform: Compute R⁻¹V Weights
     

5. The "Inverse" or Failure Mode (Power-Constrained Transmission):

   • Enabling Description: A MIMO transmission system with R⁻¹V weighting designed for extreme power efficiency in battery-operated devices (e.g., remote environmental sensors, space probes). When battery levels drop below a threshold, the system switches to a "power-constrained" R⁻¹V mode. In this mode, the R⁻¹V computation is simplified to a lower dimensionality or uses a pre-calculated sparse matrix that prioritizes minimizing transmission power per bit, even if it sacrifices some spatial multiplexing gain or perfect SNR equalization. This ensures maximum operational longevity of the device by reducing the computational load for matrix operations and optimizing transmission power allocation, potentially transmitting fewer streams or reducing the update frequency of R⁻¹V.
   • Mermaid Diagram:

     stateDiagram
         state "High Performance R⁻¹V" as HighPerf
         state "Power Constrained R⁻¹V" as PowerConstrained
         HighPerf --> PowerConstrained: BatteryLow OR PowerLimitExceeded
         PowerConstrained --> HighPerf: BatteryFull OR PowerLimitRelaxed
         HighPerf : Compute Full R⁻¹V, Maximize Throughput
         PowerConstrained : Compute Simplified R⁻¹V, Minimize Power
         PowerConstrained : Reduce Stream Count / Update Freq
     

---

Derivatives for Claim 9: Receiver (UMD)

Claim 9 Summary: A receiver including a first array of antennas configured to receive a plurality of transmit signals transmitted from a second array of antennas. Each of these transmit signals was weighted by a respective transmit vector computed by decomposing at least a portion of a transmission channel matrix into a unitary matrix with eigenvalues that lie substantially on a unit circle of a complex plane. The receiver also includes a plurality of receive vector multipliers.

1. Material & Component Substitution:

   • Enabling Description: The receiver utilizes superconducting bolometer arrays (cooled to millikelvin temperatures) as receive antennas for detecting extremely faint UMD-weighted signals in the sub-millimeter wave band. The receive vector multipliers are implemented as Josephson junction-based parametric amplifiers for ultra-low noise amplification and multiplication, operating with quantum-limited sensitivity. The UMD-informed processing logic, understanding the unitary nature of the incoming signals, performs optimal Bayesian inference on the received data, effectively reconstructing the original, decoupled data streams from highly noisy backgrounds.
   • Mermaid Diagram:

     graph TD
         A((Sub-mmWave Channel)) --> B[Superconducting Bolometer Array]
         B --> C(Josephson Junction Parametric Amplifiers)
         C --> D[UMD-informed Bayesian Inference Processor]
         D --> E[Reconstructed Data Output]
         F[Cryogenic Cooling System] --> B
         F --> C
     

2. Operational Parameter Expansion:

   • Enabling Description: A receiver for interstellar communication, designed to operate with UMD-weighted signals from distant exoplanetary transmitters, where the channel matrix H is subject to extreme dispersion, interstellar scintillation, and gravitational lensing effects. The receive antennas are composed of very large baseline interferometry (VLBI) arrays, spanning thousands of kilometers on Earth or in space. The receive vector multipliers are realized as distributed computing clusters performing super-resolution signal reconstruction, specifically tailored to identify and decode UMD-weighted signals despite the sparse and highly corrupted incoming wavefront. The processing pipeline accounts for vast propagation delays and incorporates relativistic corrections for channel state information.
   • Mermaid Diagram:

     sequenceDiagram
         Exoplanet Tx->>Interstellar Medium: Transmit UMD-Weighted Signal
         Interstellar Medium->>VLBI Array: Extremely Weak, Dispersed Signal
         VLBI Array->>Distributed Computing Cluster: Raw Intereferometry Data
         Distributed Computing Cluster->>Distributed Computing Cluster: Super-Resolution & UMD-informed Reconstruction
         Distributed Computing Cluster->>Data Output: Decoded Data Streams
     

3. Cross-Domain Application (Geodesy and Seismology):

   • Enabling Description: A receiver for high-precision geophysical sensing. The first array of antennas consists of an array of distributed seismic sensors (geophones) or gravimeters, detecting UMD-weighted acoustic or gravitational wave signals transmitted for subsurface imaging or earthquake prediction. The transmit signals are weighted by UMD to ensure each signal path through the heterogeneous geological medium arrives independently and with equal effective strength at the receive array. The receiver's multipliers process the geophysical sensor data, applying inverse UMD-aware filters to effectively separate and localize various subsurface features or seismic events.
   • Mermaid Diagram:

     classDiagram
         class GeophysicalTx {
             +TransmitUMDWeightedWaves()
         }
         class GeologicalMedium {
             +ChannelMatrix_H()
         }
         class SeismicSensorArray {
             +ReceiveWaves()
         }
         class UMDInformedReceiver {
             +ProcessSensorData()
             +ApplyInverseUMDFilter()
             +OutputGeophysicalImage()
         }
         GeophysicalTx "1" --> "1" GeologicalMedium : Transmits through
         GeologicalMedium "1" --> "1" SeismicSensorArray : Propagates to
         SeismicSensorArray "1" --> "1" UMDInformedReceiver : Feeds data to
     

4. Integration with Emerging Tech (AI for Real-time CSI Inference):

   • Enabling Description: The receiver employs a neural network for real-time inference of the UMD transmit vectors from received pilot signals and environmental cues. This AI-driven inference allows for rapid adaptation of its own receive weights to effectively combine and decouple the UMD-weighted incoming streams, maintaining optimal SNR and minimizing interference, even with noisy or intermittent CSI feedback from the transmitter. The neural network learns the complex mapping between observed channel characteristics and the optimal inverse UMD transformation.
   • Mermaid Diagram:

     flowchart TD
         A((Wireless Channel H)) --> B[Receive Antenna Array]
         B --> C[Pilot Signal Extractor]
         C --> D(Neural Network Inference Engine)
         D --> E[Inferred UMD Tx Vectors]
         E --> F[Receive Vector Multipliers (Adaptive)]
         F --> G[Data Output]
         B --> F
     

5. The "Inverse" or Failure Mode (Resilient Signal Acquisition):

   • Enabling Description: A receiver with UMD-informed processing that prioritizes resilient signal acquisition in highly contested electromagnetic environments (e.g., military communication, electronic warfare). Upon detection of severe interference or signal corruption that prevents full UMD decoding, the receiver switches to a "resilient acquisition" mode. In this mode, it focuses on acquiring only the most robust components of the incoming UMD-weighted signal by employing advanced compressed sensing techniques and only partially reconstructing the channel matrix to infer the most probable unitary components. This allows the receiver to extract at least a partial data stream or critical control information, even when a full, high-fidelity reconstruction of all UMD streams is impossible.
   • Mermaid Diagram:

     stateDiagram
         state "Full UMD Decoding" as FullDecoding
         state "Resilient Acquisition Mode" as ResilientAcq
         FullDecoding --> ResilientAcq: SevereInterference OR SignalCorruption
         ResilientAcq --> FullDecoding: ChannelClears OR QualityRestored
         FullDecoding : Full UMD Channel Reconstruction & Decoding
         ResilientAcq : Partial H Reconstruction, Compressed Sensing
         ResilientAcq : Extract Critical Data from Robust Components
     

---

Derivatives for Claim 11: Receiver (R⁻¹V and V⁻¹ forms)

Claim 11 Summary: A receiver including at least two antennas configured to receive at least two received signals multiplied by a transmit weight vector R⁻¹V. It also includes at least two receive vector multipliers configured to weight the at least two received signals with a receive weight vector V⁻¹ to form at least two receive weighted signals, and a plurality of receive combiners to combine these signals.

1. Material & Component Substitution:

   • Enabling Description: The receiver employs a spintronic antenna array capable of detecting spin-wave signals in ferromagnetic materials, operating at gigahertz frequencies. The incoming signals are already weighted by a transmit R⁻¹V vector derived for the spin-wave channel. The receive vector multipliers for applying the V⁻¹ weighting are implemented using reconfigurable magnonic crystals, which dynamically adjust their spin-wave scattering properties to perform the matrix multiplication. The combiners are also magnonic interference structures. This allows for ultra-compact, energy-efficient receive processing of spin-wave data streams, decoupled and reconstructed using the V⁻¹ weighting.
   • Mermaid Diagram:

     graph TD
         A((Spin-wave Channel)) --> B[Spintronic Antenna Array]
         B --> C(Magnonic Crystal V⁻¹ Multipliers)
         C --> D(Magnonic Combiners)
         D --> E[Reconstructed Spin-wave Data]
         F[V⁻¹ Computation Unit] --> C
         G[Spin-Wave Channel State Info] --> F
     

2. Operational Parameter Expansion:

   • Enabling Description: A receiver on an orbital debris monitoring satellite. It receives R⁻¹V weighted radar signals (e.g., in Ka-band, 26.5-40 GHz) transmitted from ground-based radar arrays, which have been weighted to track multiple debris objects simultaneously. The receiver's V⁻¹ multipliers are implemented using onboard, radiation-hardened, ultra-high-speed digital processors (e.g., specialized ASICs for matrix inversion and multiplication), operating at hundreds of giga-operations per second. This enables real-time, precise separation of radar returns from individual debris objects, even when highly clustered, providing critical data for collision avoidance and space situational awareness. The system must account for relativistic effects on signal paths and dynamically adjust for Doppler shifts.
   • Mermaid Diagram:

     flowchart TD
         A((Ka-band Radar Channel)) --> B[Satellite Receive Antenna Array]
         B --> C(High-Speed ADC)
         C --> D[Radiation-Hardened ASIC (V⁻¹ Multipliers)]
         D --> E[Digital Combiners]
         E --> F[Debris Tracking & Analysis Unit]
         G[Channel State Update (from Ground)] --> D
     

3. Cross-Domain Application (Smart Manufacturing Quality Control):

   • Enabling Description: A receiver integrated into a robotic inspection arm for real-time, non-destructive testing (NDT) in smart manufacturing. The arm contains an array of ultrasonic transducers acting as receive antennas. These transducers receive R⁻¹V weighted ultrasonic signals transmitted through material samples (e.g., metal parts, composite structures) for defect detection. The R⁻¹V weighting by the transmitter ensures multiple, decoupled acoustic paths. The receiver's V⁻¹ multipliers process the incoming ultrasonic signals to precisely separate these paths, enabling detailed 3D reconstruction of internal material structures and accurate identification of micro-cracks or voids without interference.
   • Mermaid Diagram:

     classDiagram
         class NDT_Tx {
             +TransmitRInvVWeightedUltrasound()
         }
         class MaterialSample {
             +AcousticChannel_H()
         }
         class RoboticInspectionArm {
             +UltrasonicTransducerArray
             +VInvMultiplierProcessor
             +Combiner
         }
         class QualityControlSystem {
             +3D_ReconstructionModule
             +DefectDetectionAlgorithm
         }
         NDT_Tx "1" --> "1" MaterialSample : Transmits through
         MaterialSample "1" --> "1" UltrasonicTransducerArray : Propagates to
         RoboticInspectionArm "1" --> "1" QualityControlSystem : Feeds data to
         RoboticInspectionArm : VInvMultiplierProcessor (V⁻¹ weighting)
     

4. Integration with Emerging Tech (Digital Twin for Predictive V⁻¹):

   • Enabling Description: The receiver uses a localized digital twin of its immediate environment to predict the optimal V⁻¹ matrix. This digital twin is constantly updated with real-time sensor data from the receiver's vicinity (e.g., reflections, localized interference, mobile obstacle presence). Based on this predictive model of the effective local channel, the V⁻¹ matrix is dynamically adjusted, ensuring real-time, adaptive signal separation from incoming R⁻¹V weighted streams, even in rapidly changing conditions (e.g., within a dense IoT network or an autonomous vehicle's sensor fusion system).
   • Mermaid Diagram:

     sequenceDiagram
         Receiver Sensors->>Local Digital Twin: Real-time Environment Update
         Local Digital Twin->>Local Digital Twin: EM Simulation (Predict H_local)
         Local Digital Twin->>V⁻¹ Computation Unit: Push Predicted V⁻¹
         V⁻¹ Computation Unit->>Receive Vector Multipliers: Apply V⁻¹
         Receive Vector Multipliers->>Digital Combiners: Separate Streams
     

5. The "Inverse" or Failure Mode (Limited Spatial Resolution):

   • Enabling Description: A receiver with V⁻¹ weighting that operates in a "limited spatial resolution" mode under degraded channel conditions (e.g., very high noise, significant antenna failures, or severe multipath). Instead of attempting a full V⁻¹ reconstruction of all R⁻¹V weighted streams, the receiver dynamically reduces the effective dimensionality of the V⁻¹ matrix or switches to a simplified beamforming approach (e.g., combining multiple spatial streams into a single, more robust aggregate stream). This sacrifices the fine spatial separation and individual stream quality for increased robustness and the ability to extract at least some interpretable information (e.g., a dominant data stream), preventing complete loss of communication. The computational load for V⁻¹ is also significantly reduced.
   • Mermaid Diagram:

     stateDiagram
         state "Full V⁻¹ Reconstruction" as FullVInv
         state "Limited Spatial Resolution Mode" as LimitedRes
         FullVInv --> LimitedRes: DegradedChannel OR AntennaFailure
         LimitedRes --> FullVInv: ChannelRestored
         FullVInv : Compute Full V⁻¹ for N streams
         FullVInv : Separate N individual streams
         LimitedRes : Compute Reduced V⁻¹ or Simplified Beamforming
         LimitedRes : Combine multiple streams into 1-2 aggregate streams
     

---

Combination Prior Art Scenarios

These scenarios combine the core principles of US7738595 (MIMO with mathematically derived weighting for orthogonal, equal-SNR streams) with existing open-source communication standards, rendering future incremental advancements obvious.

1. MIMO UMD/R⁻¹V Weighting with IEEE 802.11ax (Wi-Fi 6) OFDMA:

   • Description: Applying the Unit Magnitude Decomposition (UMD) or R⁻¹V / V⁻¹ weighting schemes of US7738595 to the Orthogonal Frequency-Division Multiple Access (OFDMA) framework specified in IEEE 802.11ax (Wi-Fi 6). In 802.11ax, multiple users can transmit or receive simultaneously on different resource units (RUs) within the same OFDM symbol. This combination would involve performing UMD or R⁻¹V weighting for each individual Resource Unit (RU) or group of RUs, for each active user, on each subcarrier, to ensure that each user's data streams within their assigned RUs are perfectly decoupled and received with equal SNR at their respective devices, maximizing the efficiency and fairness of OFDMA in dense multi-user environments. This extends the single-link MIMO optimization of '595 to a multi-user, multi-resource block context.

2. MIMO UMD/R⁻¹V Weighting with 5G New Radio (NR) Massive MIMO and Beam Management:

   • Description: Integrating the UMD or R⁻¹V / V⁻¹ weighting techniques of US7738595 into the advanced Massive MIMO and beam management procedures of 5G New Radio (NR) as defined by 3GPP standards (e.g., Release 15/16). 5G NR uses sophisticated beamforming and multiple-panel antenna arrays. This combination would involve using UMD or R⁻¹V/V⁻¹ at the gNodeB (base station) to refine the pre-coding matrices for individual user equipment (UE) within specific beams, ensuring that even within highly concentrated beams, the multiple data layers transmitted to a single UE are optimally decoupled and have equal SNRs. This would enhance the robustness and spectral efficiency of 5G Massive MIMO by addressing internal stream interference within a UE's allocated spatial channel, complementing existing codebook-based or non-codebook-based beamforming.

3. MIMO UMD/R⁻¹V Weighting for Zigbee (IEEE 802.15.4) Mesh Networks:

   • Description: Applying the UMD or R⁻¹V / V⁻¹ weighting schemes of US7738595 to improve reliability and throughput in low-power, low-data-rate mesh networks based on the Zigbee (IEEE 802.15.4) standard. While 802.15.4 typically uses single antennas, this derivative envisions Zigbee nodes equipped with miniature, low-cost antenna arrays. The '595 patent's techniques would enable robust, multi-stream communication between mesh nodes, even over challenging propagation paths. The UMD/R⁻¹V computations would be simplified and run periodically or reactively due to the resource constraints of Zigbee devices, but would ensure reliable, equal-strength links for sensor data aggregation or smart home control, dramatically improving the capacity and link stability of a critical Zigbee mesh backbone.