# US 2026/0149629 A1 · Communication method and communication system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0149629 A1
- Document ID: US20260149629A1
- Status: Published application
- Kind: A1
- Application number: 19/215,384
- Filed: 2025-05-22
- Published: 2026-05-28
- Earliest claimed: 2024-11-28
- Assignees: Ningbo University
- Applicants: Ningbo University
- Inventors: Gang WANG; Danyan LIN; King Choi HO
- Web page: https://patentgrep.com/patent/US20260149629A1

## CPC

- H04L 27/0014: {Carrier regulation (of chaotic carriers H04L27/001; for multicarrier receivers H04L27/2657)}
- H04L 27/2627: {Modulators}
- H04L 27/2628: {Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators (H04L27/2634 takes precedence)}
- H04L 27/263: {modification of IFFT/IDFT modulator for performance improvement}
- H04L 27/2634: {Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation}
- H04L 27/2636: {with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]}
- H04L 27/2639: {Modulators using other transforms, e.g. discrete cosine transforms, Orthogonal Time Frequency and Space [OTFS] or hermetic transforms}
- H04L 27/265: {Fourier transform demodulators, e.g. fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators (H04L27/26524 takes precedence)}
- H04L 27/2651: {Modification of fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators for performance improvement}
- H04L 27/26524: {Fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators in combination with other circuits for demodulation}
- H04L 27/26526: {with inverse FFT [IFFT] or inverse DFT [IDFT] demodulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] receiver or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]}
- H04L 27/2697: {in combination with other modulation techniques}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present application provides a communication method and a communication system. The communication method, applied to a transmitter, includes: collecting a bitstream; modulating and converting the bitstream and obtaining a frequency domain signal matrix; multiplying the frequency domain signal matrix with an inverse approximate Discrete Fourier Transform (DFT) matrix and obtaining a time domain signal matrix; post-processing the time domain signal matrix and obtaining a time domain signal, and sending the time domain signal to a receiver connected with the transmitter. The communication method, applied to a receiver, includes: receiving a time domain signal from a transmitter connected with the receiver; pre-processing the time domain signal and obtaining a time domain signal matrix; multiplying the time domain signal matrix with an approximate DFT matrix and obtaining a frequency domain signal matrix; demodulating and converting the frequency domain signal matrix and obtaining a bitstream.

## Claims

### Claim 1

A communication method, applied to a transmitter, comprising:
collecting a bitstream;
modulating and converting the bitstream and obtaining a frequency domain signal matrix;
multiplying the frequency domain signal matrix with an inverse approximate Discrete Fourier Transform (DFT) matrix and obtaining a time domain signal matrix, the inverse approximate Discrete Fourier Transform (DFT) matrix being an inverse matrix of an approximate Discrete Fourier Transform (DFT);
post-processing the time domain signal matrix and obtaining a time domain signal, and sending the time domain signal to a receiver connected with the transmitter.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining the inverse approximate DFT matrix comprises:
determining the approximate DFT matrix;
performing conjugate transpose on the approximate DFT matrix and dividing by N to obtain the inverse approximate DFT matrix.

### Claim 3 (depends on 2)

The method of claim 2, wherein the determining the approximate DFT matrix comprises:
constructing a sparse factor matrix FN of an N-point DFT matrix, where N is a power of two integer, based on a symmetric structure of the DFT matrix, wherein
F
N
,
(
k
,
i
)
=
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
,
k=1, 2, . . . , N, i=1, 2, . . . , N,
wherein ωN=e−j2π/N is a Nth unit root, j=√{square root over (−1)} is an imaginary unit,
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
represents a (k−1)(i−1)th power of ωN, and FN,(k,i) represents a (k,i)th element of the matrix FN;
factorizing the sparse factor matrix FN of the N-point DFT matrix by a formula of:
F
N
=
P
N
⁢
∏
i
=
1
t
A
i
,
wherein t log2N, and PN is a bit-reversal order permutation matrix,
in a case where the bit-reversal order permutation matrix PN=[erN,(1), erN,(2), . . . , erN,(N)] as a bit-reversed sequence is rN, wherein el is a l+1th column of a N×N unit matrix, rN,(l) is a lth element of rN, Ai is expressed as
A
i
=
blk
⁢
diag
[
1
ω
N
r
N
,
(
1
)
1
ω
N
r
N
,
(
2
)
]
,
[
1
ω
N
r
N
,
(
3
)
1
ω
N
r
N
,
(
4
)
]
,
…
,
[
1
ω
N
r
N
,
(
2
t
-
1
+
1
)
-
1
)
1
ω
N
r
N
,
(
2
t
-
1
+
1
)
)
]
)
⊗
I
2
i
-
1
,
wherein bkdiag(·) denotes a block diagonal matrix comprising specified matrices on a diagonal of the block diagonal matrix, ⊗ is a Kronecker product operation, and rN,(l) is a lth element of rN;
mapping the matrix Ai to a first feasible set ={0, ±1, ±2, . . . , ±2q} for a non-negative integer q and obtaining a first quantized-mapping factor matrix Âi;
performing amplitude calibration and phase calibration on the first quantized-mapping factor matrix and obtaining a first mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained;
obtaining the approximate DFT matrix by applying a real scaling factor β and optimizing the mapped-calibrated sparse factor matrix,
wherein the approximate DFT matrix
F
^
N
=
β
^
⁢
∏
i
=
1
t
-
2
H
^
i
⁢
A
^
i
⁢
A
t
-
1
⁢
A
t
;
wherein
β
^
=
Re
⁡
(
Tr
⁡
(
F
N
†
⁢
P
N
⁢
G
N
)
Tr
⁡
(
G
N
†
⁢
G
N
)
)
.

### Claim 4 (depends on 2)

The method of claim 2, wherein the determining the approximate DFT matrix comprises:
constructing a sparse factor matrix FN of an N-point DFT matrix, where N is a power of two integer, based on a symmetric structure of the DFT matrix, wherein
F
N
,
(
k
,
i
)
=
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
,
k=1, 2, . . . , N, i=1, 2, . . . , N,
wherein ωN=e−j2π/N is a Nth unit root, j=√{square root over (−1)} is an imaginary unit,
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
represents a (k−1)(i−1)th power of ωN, and FN,(k,i) represents a (k,i)th element of the matrix FN;
factorizing the sparse factor matrix FN of the N-point DFT matrix by a formula of:
F
N
=
P
N
⁢
∏
i
=
1
t
A
i
,
wherein t=log2N, and PN is a bit-reversal order permutation matrix,
in a case where the bit-reversal order permutation matrix PN=[erN,(1), erN,(2), . . . , erN,(N)] as a bit-reversed sequence is rN, wherein el is a l+1th column of a N×N unit matrix, rN,(l) is a lth element of rN, Ai is expressed as
A
i
=
blk
⁢
diag
⁡
(
[
1
ω
N
r
N
,
(
1
)
1
ω
N
r
N
,
(
2
)
]
,
[
1
ω
N
r
N
,
(
3
)
1
ω
N
r
N
,
(
4
)
]
,
…
,
[
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
-
1
)
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
)
]
)
⊗
I
2
i
-
1
,
wherein blkdiag(·) denotes a block diagonal matrix comprising specified matrices on a diagonal of the block diagonal matrix, ⊗ is a Kronecker product operation, and rN,(l) is a lth element of rN;
mapping the matrix Ai to a second feasible set
𝒩
=
{
0
,
±
1
2
,
±
1
}
and obtaining a second quantized-mapping factor matrix Âi;
performing amplitude calibration and phase calibration on the second quantized-mapping factor matrix and obtaining a second mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained;
obtaining the approximate DFT matrix by applying a real scaling factor β to optimize the mapped-calibrated sparse factor matrix,
wherein the approximate DFT matrix
F
^
N
=
β
^
⁢
∏
t
-
2
i
=
1
H
^
i
⁢
A
^
i
⁢
A
t
-
1
⁢
A
t
;
wherein
β
^
=
Re
⁡
(
Tr
⁡
(
F
N
†
⁢
P
N
⁢
G
N
)
Tr
⁡
(
G
N
†
⁢
G
N
)
)
.

### Claim 5 (depends on 3)

The method of claim 3, wherein the performing amplitude calibration and phase calibration on the first quantized-mapping factor matrix and obtaining a first mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained comprises:
constructing a least squares calibration matrix
H
_
i
=
arg
min
H
i

H
i
⁢
A
^
i
-
A
i

F
2
,
wherein ∥·∥F is the Frobenius norm, and Hl is a calibration matrix;
mapping the least squares calibration matrix to the first feasible set and obtaining a first calibrated factor matrix Ĥi;
calibrating the first quantized-mapping factor matrix Âi based on first calibrated factor matrix Ĥi and obtaining the first mapped-calibrated factor matrix ĤiÂi.

### Claim 6 (depends on 4)

The method of claim 4, wherein the performing amplitude calibration and phase calibration on the second quantized-mapping factor matrix and obtaining a second mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained comprises:
constructing a least squares calibration matrix
H
_
i
=
arg
min
H
i

H
i
⁢
A
^
i
-
A
i

F
2
,
wherein ∥·∥F is the Frobenius norm, and Hi is a calibration matrix;
calibrating the second quantized-mapping factor matrix Âi based on second calibrated factor matrix Ĥi and obtaining the second mapped-calibrated factor matrix ĤiÂi.

### Claim 7 (depends on 3)

The method of claim 3, wherein the mapping the matrix Ai to a first feasible set ={0, ±1, ±2, . . . , ±2q} and obtaining a first quantized-mapping factor matrix Âi, comprises:
mapping, in condition of all elements in a matrix At-1 and a matrix Ai satisfying constraints of the first feasible set, rest of matrices Ai to the first feasible set.

### Claim 8 (depends on 4)

The method of claim 4, wherein the mapping the matrix Ai to a second feasible set
𝒩
=
{
0
,
±
1
2
,
±
1
}
and obtaining a second quantized-mapping factor matrix Âi, comprises:
mapping, in condition of all elements in a matrix At-1 and a matrix At satisfying constraints of the second feasible set, rest of matrices Ai to the second feasible set.

### Claim 9 (depends on 1)

The method of claim 1, wherein the post-processing the time domain signal matrix comprises:
adding a cyclic prefix;
performing a parallel-to-serial conversion;
performing a digital-to-analog conversion.

### Claim 10

A communication method, applied to a receiver, comprising:
receiving a time domain signal from a transmitter connected with the receiver;
pre-processing the time domain signal and obtaining a time domain signal matrix;
multiplying the time domain signal matrix with an approximate DFT matrix and obtaining a frequency domain signal matrix;
demodulating and converting the frequency domain signal matrix and obtaining a bitstream.

### Claim 11 (depends on 10)

The method of claim 10, wherein the pre-processing the time domain signal to obtain a time domain signal matrix comprises:
performing an analog-to-digital conversion;
removing a cyclic prefix;
performing a serial-to-parallel conversion.

### Claim 12 (depends on 10)

The method of claim 10, wherein the determining the approximate DFT matrix comprises:
constructing a sparse factor matrix FN of an N-point DFT matrix, where N is a power of two integer, based on a symmetric structure of the DFT matrix, wherein
F
N
,
(
k
,
i
)
=
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
,
k=1, 2, . . . , N, i=1, 2, . . . , N,
wherein ωN=e−j2π/N is a Nth unit root, j=√{square root over (−1)} is an imaginary unit,
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
represents a (k−1)(i−1)th power of ωN, and FN,(k,i) represents a (k,i)th element of the matrix FN;
factorizing the sparse factor matrix FN of the N-point DFT matrix by a formula of:
F
N
=
P
N
⁢
∏
i
=
1
t
A
i
,
wherein t=log2N, and PN is a bit-reversal order permutation matrix,
in a case where the bit-reversal order permutation matrix PN=[erN,(1), erN,(2), . . . erN,(N)] as a bit-reversed sequence is rN, wherein el dis a l+1th column of a N×N unit matrix, rN,(l) is a lth element of rN, Ai is expressed as
A
i
=
blk
⁢
diag
⁡
(
[
1
ω
N
r
N
,
(
1
)
1
ω
N
r
N
,
(
2
)
]
,
[
1
ω
N
r
N
,
(
3
)
1
ω
N
r
N
,
(
4
)
]
,
…
,
[
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
-
1
)
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
)
]
)
⊗
I
2
i
-
1
,
wherein blkdiag(·) denotes a block diagonal matrix comprising specified matrices on a diagonal of the block diagonal matrix, ⊗ is a Kronecker product operation, and rN,(l) is a lth element of rN;
mapping the matrix Ai to a first feasible set ={0, ±1, ±2, . . . , ±2q} and obtaining a first quantized-mapping factor matrix Âi;
performing amplitude calibration and phase calibration on the first quantized-mapping factor matrix and obtaining a first mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained;
obtaining the approximate DFT matrix by applying a real scaling factor β and optimizing the mapped-calibrated sparse factor matrix,
wherein the approximate DFT matrix
F
^
N
=
β
^
⁢
∏
t
-
2
i
=
1
H
^
i
⁢
A
^
i
⁢
A
t
-
1
⁢
A
t
;
wherein
β
^
=
Re
⁡
(
Tr
⁡
(
F
N
†
⁢
P
N
⁢
G
N
)
Tr
⁡
(
G
N
†
⁢
G
N
)
)
.

### Claim 13

A communication system, comprising a transmitter and a receiver;
the transmitter comprising a modulator, a first multiplier, and a post-processing circuit, the modulator being connected to an input end of the transmitter, the first multiplier being connected to an output end of the modulator, and the post-processing circuit being connected to an output end of the first multiplier;
wherein the modulator is configured to modulate and convert the bitstream and obtain a frequency domain signal matrix;
the first multiplier is configured to multiply the frequency domain signal matrix with an inverse approximate Discrete Fourier Transform (DFT) matrix and obtain a time domain signal matrix, the inverse approximate Discrete Fourier Transform (DFT) matrix being an inverse matrix of an approximate Discrete Fourier Transform (DFT);
the post-processing circuit is configured to post-process the time domain signal matrix and obtain a time domain signal, and send the first domain signal to the receiver connected with the transmitter;
the receiver comprises a pre-processing circuit, a second multiplier, and a demodulator; the pre-processing circuit is connected to an input end of the receiver; the second multiplier is connected to an output end of the pre-processing circuit; the demodulator is connected to an output end of the second multiplier;
the pre-processing circuit is configured to pre-process a time domain signal received from a transmitter connected with the receiver and obtain a time domain signal matrix;
the second multiplier is configured to multiply the time domain signal matrix with an approximate DFT matrix and obtain a frequency domain signal matrix;
the demodulator is configured to demodulate and convert the frequency domain signal matrix and obtain a bitstream.

### Claim 14 (depends on 13)

The communication system of claim 13, wherein determining the inverse approximate DFT matrix comprises:
determining an approximate DFT matrix;
performing conjugate transpose on the approximate DFT matrix and dividing by N to obtain the inverse approximate DFT matrix.

### Claim 15 (depends on 14)

The communication system of claim 14, wherein the determining the approximate DFT matrix comprises:
constructing a sparse factor matrix FN of an N-point DFT matrix, where N is a power of two integer, based on a symmetric structure of the DFT matrix, wherein
F
N
,
(
k
,
i
)
=
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
,
k=1, 2, . . . , N, i=1, 2, . . . , N,
wherein ωN=e−2π/N is a Nth unit root, j=√{square root over (−1)} is an imaginary unit,
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
represents a (k−1)(i−1)th power of ωN, and FN,(k,i) represents a (k,i)th element of the matrix FN;
factorizing the sparse factor matrix FN of the N-point DFT matrix by a formula of:
F
N
=
P
N
⁢
∏
i
=
1
t
A
i
,
wherein t=log2N, and PN is a bit-reversal order permutation matrix,
in a case where the bit-reversal order permutation matrix PN=[erN,(1), erN,(2), . . . erN,(N)] as a bit-reversed sequence is rN, wherein el is a l+1th column of a N×N unit matrix, rN,(l) is a lth element of rN, Ai is expressed as
A
i
=
blkdiag
⁡
(
[
1
ω
N
r
N
,
(
1
)
1
ω
N
r
N
,
(
2
)
]
,
[
1
ω
N
r
N
,
(
3
)
1
ω
N
r
N
,
(
4
)
]
,
…
,
[
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
-
1
)
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
)
]
)
⊗
I
2
i
-
1
,
wherein blkdiag(·) denotes a block diagonal matrix comprising specified matrices on a diagonal of the block diagonal matrix, ⊗ is a Kronecker product operation, and rN,(l) is a lth element of rN;
mapping the matrix Ai to a first feasible set ={0, ±1, ±2, . . . , ±2q} and obtaining a first quantized-mapping factor matrix Âi;
performing amplitude calibration and phase calibration on the first quantized-mapping factor matrix and obtaining a first mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained;
obtaining the approximate DFT matrix by applying a real scaling factor β and optimizing the mapped-calibrated sparse factor matrix,
wherein the approximate DFT matrix
F
^
N
=
β
^
⁢
∏
i
=
1
t
-
2
H
^
i
⁢
A
^
i
⁢
A
t
-
1
⁢
A
t
;
wherein
β
ˆ
=
Re
(
T
⁢
r
⁡
(
F
N
†
⁢
P
N
⁢
G
N
)
T
⁢
r
⁡
(
G
N
†
⁢
G
N
)
)
.

### Claim 16 (depends on 14)

The communication system of claim 14, wherein the determining the approximate DFT matrix comprises:
constructing a sparse factor matrix FN of an N-point DFT matrix, where N is a power of two integer, based on a symmetric structure of the DFT matrix, wherein
F
N
,
(
k
,
i
)
=
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
,
k=1, 2, . . . , N, i=1, 2, . . . , N,
wherein ωN=e−j2π/N is a Nth unit root, j=√{square root over (−1)} is an imaginary unit,
ω
N
(
k
-
1
)
⁢
(
i
-
1
)
represents a (k−1)(i−1)th power of ωN, and FN,(k,i) represents a (k,i)th element of the matrix FN;
factorizing the sparse factor matrix FN of the N-point DFT matrix by a formula of:
F
N
=
P
N
⁢
∏
i
=
1
t
A
i
,
wherein t=log2N, and PN dis a bit-reversal order permutation matrix,
in a case where the bit-reversal order permutation matrix PN=[erN,(1), erN,(2), . . . erN,(N)] as a bit-reversed sequence is rN, wherein el is a l+1th column of a N×N unit matrix, rN,(l) is a lth element of rN, Ai is expressed as
A
i
=
blkdiag
⁡
(
[
1
ω
N
r
N
,
(
1
)
1
ω
N
r
N
,
(
2
)
]
,
[
1
ω
N
r
N
,
(
3
)
1
ω
N
r
N
,
(
4
)
]
,
…
,
[
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
-
1
)
1
ω
N
r
N
,
(
2
(
t
-
i
+
1
)
)
]
)
⊗
I
2
i
-
1
,
wherein blkdiag(·) denotes a block diagonal matrix comprising specified matrices on a diagonal of the block diagonal matrix, ⊗ is a Kronecker product operation, and rN,(l) is a lth element of rN;
mapping the matrix Ai to a second feasible set
𝒩
=
{
0
,
±
1
2
,
±
1
}
and obtaining a second quantized-mapping factor matrix Âi;
performing amplitude calibration and phase calibration on the second quantized-mapping factor matrix and obtaining a second mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained;
obtaining the approximate DFT matrix by applying a real scaling factor β to optimize the mapped-calibrated sparse factor matrix,
wherein the approximate DFT matrix
F
^
N
=
β
^
⁢
∏
i
=
1
t
-
2
H
^
i
⁢
A
^
i
⁢
A
t
-
1
⁢
A
t
;
wherein
β
ˆ
=
Re
(
T
⁢
r
⁡
(
F
N
†
⁢
P
N
⁢
G
N
)
T
⁢
r
⁡
(
G
N
†
⁢
G
N
)
)
.

### Claim 17 (depends on 15)

The communication system of claim 15, wherein the performing amplitude calibration and phase calibration on the first quantized-mapping factor matrix and obtaining a first mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained comprises:
constructing a least squares calibration matrix
H
_
i
=
arg
min
H
i

H
i
⁢
A
^
i
-
A
i

F
2
,
wherein ∥·∥F is the Frobenius norm, and Hi is a calibration matrix;
mapping the least squares calibration matrix to the first feasible set and obtaining a first calibrated factor matrix Ĥi;
calibrating the first quantized-mapping factor matrix Âi based on first calibrated factor matrix Ĥi and obtaining the first mapped-calibrated factor matrix ĤiÂi.

### Claim 18 (depends on 16)

The communication system of claim 16, wherein performing amplitude calibration and phase calibration on the second quantized-mapping factor matrix and obtaining a second mapped-calibrated factor matrix ĤiÂi, such that a mapped-calibrated sparse factor matrix is obtained comprises:
constructing a least squares calibration matrix
H
_
i
=
arg
min
H
i

H
i
⁢
A
^
i
-
A
i

F
2
,
wherein ∥·∥F is the Frobenius norm, and Hi is a calibration matrix;
calibrating the second quantized-mapping factor matrix Âi based on second calibrated factor matrix Ĥi and obtaining the second mapped-calibrated factor matrix ĤiÂi.

### Claim 19 (depends on 15)

The communication system of claim 15, wherein the mapping the matrix Ai to a first feasible set ={0, ±1, ±2, . . . , ±2q} and obtaining a first quantized-mapping factor matrix Âi, comprises:
mapping, in condition of all elements in a matrix At-1 and a matrix At satisfying constraints of the first feasible set, rest of matrices Ai to the first feasible set.

### Claim 20 (depends on 16)

The communication system of claim 16, wherein the mapping the matrix Ai to a second feasible set
𝒩
=
{
0
,
±
1
2
,
±
1
}
and obtaining a second quantized-mapping factor matrix Âi, comprises:
mapping, in condition of all elements in a matrix At-1 and a matrix At satisfying constraints of the second feasible set, rest of matrices Ai to the second feasible set.
